# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
41386 | 2018-02-17T06:31:54 Z | fest | Bali Sculptures (APIO15_sculpture) | C++14 | 162 ms | 188688 KB |
// fest #include <bits/stdc++.h> #define pb push_back #define F first #define S second #define y1 dasdasfasfas #define x1 wqdadfasfasfas #define All(c) c.begin(), c.end() #define SZ(A) (int((A).size())) #define umap unordered_map #define FILENAME "" #define __ fflush(stdout) typedef long long ll; typedef long double ld; using namespace std; void FREOPEN() { #ifdef COMP freopen(".in", "r", stdin); freopen("1.out", "w", stdout); #else freopen(FILENAME".in", "r", stdin); freopen(FILENAME".out", "w", stdout); #endif } inline double Time() {return (clock() * 1.0) / CLOCKS_PER_SEC; } const int N = 2001, inf = 1e9 * 2, MOD = (int)1e9 + 7; char CH[N]; const ll INF = 1e18; const int dx[] = {1, -1, 0, 0, -1, 1, -1, 1}; const int dy[] = {0, 0, 1, -1, -1, 1, 1, -1}; ll a[N]; map<ll, bool> dp[N][N]; int main() { #ifndef ONLINE_JUDGE FREOPEN(); #endif int n, l, r; cin >> n >> l >> r; for (int i = 1; i <= n; i++) scanf("%lld ", a + i); ll should = INF; for (int i = 50; i >= 0; i--) { int bl = 0; for (int j = 1; j <= n;) { ll now = a[j]; int rig = j + 1; while (rig <= n && now + a[rig] < (1ll << i)) now += a[rig], rig++; if (now >= (1ll << i)) { bl = r + 1; break; } bl++; j = rig; } if (bl <= r) should = (1ll << i); else break; } dp[0][0][0] = 1; for (int i = 1; i <= n; i++) { for (int k = 1; k <= r; k++) { ll sum = a[i]; for (int j = i - 1; j >= 0; j--) { if (sum >= should) break; for (auto m : dp[j][k - 1]) if ((m.F | sum) < should) dp[i][k][(m.F | sum)] = 1; sum += a[j]; } } } ll ans = INF; for (int k = l; k <= r; k++) for (auto m : dp[n][k]) ans = min(ans, m.F); cout << ans; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 154 ms | 188280 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 159 ms | 188512 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 157 ms | 188688 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 157 ms | 188688 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 162 ms | 188688 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |