# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
152384 | 2019-09-07T20:48:08 Z | beso123 | Bali Sculptures (APIO15_sculpture) | C++14 | 2 ms | 504 KB |
#include<bits/stdc++.h> #define int long long using namespace std; int n,A,B,pref[2002],a[2002],dp[2002][2002]; main(){ cin>>n>>A>>B; for(int k=1;k<=n;k++){ cin>>a[k]; pref[k]=a[k]+pref[k-1]; } for(int k=1;k<=n;k++) dp[1][k]=pref[k]; int ans=INT_MAX; for(int k=2;k<=B;k++){ for(int i=1;i<=n-k;i++){ if(k>i) continue; int h=dp[k-1][i] | (pref[n]-pref[i]); dp[k][i]=h; if(k>=A && k<=B && i==n-k) ans=min(ans,dp[k][i]); } } cout<<ans; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 504 KB | Output is correct |
2 | Incorrect | 2 ms | 376 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Incorrect | 2 ms | 376 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 504 KB | Output is correct |
2 | Incorrect | 2 ms | 376 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Incorrect | 2 ms | 376 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 504 KB | Output is correct |
2 | Incorrect | 2 ms | 504 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |