# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
270374 | 2020-08-17T14:27:34 Z | BeanZ | Bali Sculptures (APIO15_sculpture) | C++14 | 1 ms | 384 KB |
#include <bits/stdc++.h> using namespace std; #define ll long long #define endl '\n' const int N = 3e6 + 5; ll dp[105][105], a[2005], sum[2005]; bool chk(ll now, ll need){ return ((need & now) == now); } int main(){ ios_base::sync_with_stdio(false); cin.tie(0); if (fopen("VietCT.INP", "r")){ freopen("VietCT.INP", "r", stdin); freopen("VietCT.OUT", "w", stdout); } ll n, L, R; cin >> n >> L >> R; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + a[i]; ll ans = 1e18; for (int s = 0; s < 2048; s++){ for (int i = 0; i <= n; i++){ for (int j = 0; j <= R; j++){ dp[j][i] = 1e18; } } for (int i = 1; i <= n; i++) if (chk(sum[i], s)) dp[1][i] = sum[i]; for (int i = 2; i <= R; i++){ for (int j = 1; j <= n; j++){ for (int k = 0; k < j; k++){ ll cost = dp[i - 1][k] | (sum[j] - sum[k]); if (chk(cost, s)){ if (dp[i][j] > cost){ dp[i][j] = cost; } } } } if (i >= L) ans = min(ans, dp[i][n]); } } cout << ans; } /* 6 1 3 8 1 2 1 5 4 */
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Correct | 1 ms | 384 KB | Output is correct |
3 | Incorrect | 1 ms | 384 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Correct | 1 ms | 384 KB | Output is correct |
3 | Incorrect | 1 ms | 384 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Correct | 1 ms | 384 KB | Output is correct |
3 | Incorrect | 1 ms | 384 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Correct | 1 ms | 384 KB | Output is correct |
3 | Incorrect | 1 ms | 384 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Correct | 1 ms | 384 KB | Output is correct |
3 | Incorrect | 1 ms | 384 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |