# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
43650 | gnoor | Bali Sculptures (APIO15_sculpture) | C++14 | 2 ms | 520 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 <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
int tbl[5000];
int n,a,b;
int num(long long mask) {
int grp=1;
long long sum=0;
for (int i=0;i<n;i++) {
sum+=tbl[i];
if (sum&(~mask)) {
sum=tbl[i];
grp++;
}
}
return grp;
}
void printBin(long long x) {
for (int i=50;i>=0;i--) {
printf("%d",(x&(1ll<<i))?1:0);
}
printf("\n");
}
int main () {
scanf("%d%d%d",&n,&a,&b);
for (int i=0;i<n;i++) {
scanf("%d",&tbl[i]);
}
long long mask=(1ll<<50)-1;
//printBin(mask);
for (int i=49;i>=0;i--) {
mask^=(1ll<<i);
//printBin(mask);
int tmp=num(mask);
if (tmp>b) {
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... |