# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
270314 | 2020-08-17T14:10:50 Z | BeanZ | Bali Sculptures (APIO15_sculpture) | C++17 | 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[2005][2005], a[2005], sum[2005]; 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]; 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++) 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 (dp[i][j] > cost){ dp[i][j] = cost; } } } } ll ans = 1e18; for (int i = L; i <= R; i++){ if (dp[i][n] < ans){ 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 | Incorrect | 1 ms | 384 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Incorrect | 1 ms | 360 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Incorrect | 0 ms | 384 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Incorrect | 1 ms | 384 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Incorrect | 1 ms | 384 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |