Submission #925765

#TimeUsernameProblemLanguageResultExecution timeMemory
925765Boycl07Bali Sculptures (APIO15_sculpture)C++17
100 / 100
72 ms600 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; #define rep(i, n) for(int i = 1; i <= n; ++i) #define forn(i, l, r) for(int i = l; i <= r; ++i) #define ford(i, r, l) for(int i = r; i >= l; --i) #define FOR(i, n) for(int i = 0; i < n; ++i) #define FORD(i, n) for(int i = n - 1; i >= 0; --i) #define fi first #define se second #define pii pair<int, int> #define pll pair<ll, ll> #define pb push_back #define endl "\n" #define task "sculptures" #define sz(a) int(a.size()) #define C(x, y) make_pair(x, y) #define all(a) (a).begin(), (a).end() #define bit(i, mask) (mask >> i & 1) template<typename T> bool maximize(T &res, const T &val) { if (res < val){ res = val; return true; }; return false; } template<typename T> bool minimize(T &res, const T &val) { if (res > val){ res = val; return true; }; return false; } inline int readInt() {char c;while(c=getchar(),c!='-'&&(c<'0'||c>'9'));bool sign=(c=='-');if(sign)c=getchar();int n=c-'0';while(c=getchar(),c>='0'&&c<='9')n=10*n+c-'0';return(!sign)?n:-n;} inline ll readLong() {char c;while(c=getchar(),c!='-'&&(c<'0'||c>'9'));bool sign=(c=='-');if(sign)c=getchar();ll n=c-'0';while(c=getchar(),c>='0'&&c<='9')n=10*n+c-'0';return(!sign)?n:-n;} inline string readString() {char c;while(c=getchar(),c==' '||c=='\n'||c=='\t');string s({c});while(c=getchar(),c!=EOF&&c!=' '&&c!='\n'&&c!='\t')s+=c;return s;} const int N = 1e5 + 10; const int M = 1e3 + 3; const int N1 = 2e3 + 10; const int K = 1e2 + 1; const int MOD = 1e9 + 7; const int INF = 0x3f3f3f3f; const ll LINF = 1e17 + 2; const int block_size = 500; const int LOG = 40; const int offset = N; const int LIM = 11 ; const int AL = 26; int n, L, R; int a[N]; bool check(ll res) { if(n <= 100) { vector<vector<int>> dp(n + 1, vector<int>(n + 1)); dp[0][0] = 1; rep(i, n) { forn(k, 1, n) { ll cur = 0; ford(j, i, 1) { cur += a[j]; if((cur & res) == 0) dp[i][k] |= dp[j - 1][k - 1]; } } } forn(i, L, R) if(dp[n][i]) return 1; return 0; } else { vector<int> dp(n + 1); dp[0] = 0; rep(i, n) { dp[i] = n + 1; ll cur = 0; ford(j, i, 1) { cur += a[j]; if((cur & res) == 0) minimize(dp[i], dp[j - 1] + 1); } } return dp[n] <= R; } } void solve() { cin >> n >> L >> R; rep(i, n) cin >> a[i]; ll res = 0; for(int bit = LOG; bit >= 0; --bit) { res |= 1ll << bit; if(!check(res)) res ^= 1ll << bit; } for(int bit = LOG; bit >= 0; --bit) res ^= 1ll << bit; cout << res; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int TC = 1; if(fopen(task".inp", "r")) { freopen(task".inp", "r", stdin); freopen(task".out", "w", stdout); } while(TC--) { solve(); cout << endl; } return 0; }

Compilation message (stderr)

sculpture.cpp: In function 'int main()':
sculpture.cpp:116:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  116 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
sculpture.cpp:117:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  117 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...