| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 897248 | TahirAliyev | Bali Sculptures (APIO15_sculpture) | C++17 | 30 ms | 952 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>
#define ll long long
#define oo 1e9
#define pii pair<int, int>
using namespace std;
const int MAX = 105;
int n, a, b;
int arr[MAX];
ll pre[MAX];
int dp[MAX][MAX];
ll cur = 0;
bool rec(int i, int k, int bit){
if(i == n + 1){
if(k >= a && k <= b) return 1;
else return 0;
}
if(dp[i][k] != -1) return dp[i][k];
for(int j = i + 1; j <= n + 1; j++){
if((cur | (pre[j - 1] - pre[i - 1])) >> bit << bit == cur && rec(j, k + 1, bit)){
return dp[i][k] = 1;
}
}
return dp[i][k] = 0;
}
int main(){
cin >> n >> a >> b;
for(int i = 1; i <= n; i++){
cin >> arr[i];
pre[i] = pre[i - 1] + arr[i];
}
for(int B = 40; B >= 0; B--){
memset(dp, -1, sizeof(dp));
if(!rec(1, 0, B)){
cur |= (1ll << B);
}
}
cout << cur << '\n';
}
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... | ||||
