# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
101238 | arman_ferdous | Bali Sculptures (APIO15_sculpture) | C++17 | 37 ms | 16212 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 2010;
int n, A, B;
ll a[N], sum[N], mask, diff;
int dp4[N][N], dp5[N];
int DP4(int pos, int parts) {
if(pos > n) {
if(A <= parts && parts <= B) return 1;
return 0;
} if(parts > B) return 0;
if(dp4[pos][parts] != -1) return dp4[pos][parts];
int &ret = dp4[pos][parts]; ret = 0;
ll s = 0;
for(int i = pos; i <= n; i++) {
s += a[i];
if((mask ^ s) < diff) ret |= DP4(i+1, parts+1);
}
return ret;
}
int main() {
scanf("%d %d %d", &n, &A, &B);
for(int i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
sum[i] = sum[i-1] + a[i];
}
if(n <= 100) {
for(int i = 5; i >= 0; i--) {
memset(dp4, -1, sizeof dp4);
diff = (1ll<<i);
if(!DP4(1,0)) mask |= (1ll<<i);
}
printf("%lld\n", mask);
return 0;
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |