# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
102006 | Nicholas_Patrick | Bali Sculptures (APIO15_sculpture) | C++17 | 1073 ms | 512 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;
int n, a, b;
vector <long long> y, psy;
int checkPossibility(long long x, long long toDeduct=0, int checkFrom=0){
if(checkFrom==n)
return 0;
int ret=n;
for(int i = checkFrom;i < n;i ++){
if(((psy[i]-toDeduct)|x)==x)
ret=min(ret, checkPossibility(x, psy[i], i+1));
if(psy[i]-toDeduct>x)
break;
}
return ret+1;
}
int main(){
scanf("%d %d %d", &n, &a, &b);
y.resize(n);
psy.resize(n);
for(int i = 0;i < n;i ++)
scanf("%lld", &y[i]);
psy[0]=y[0];
for(int i = 1;i < n;i ++)
psy[i]=psy[i-1]+y[i];
if(a==1){
long long lo=0x0 , hi=0x20000000000, mi;
while(true){
if(checkPossibility(lo)<=b)break;
lo++;
}
printf("%lld\n", lo);
}else{
}
}
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... |