# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
106844 | Diuven | Bali Sculptures (APIO15_sculpture) | C++14 | 117 ms | 504 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;
typedef long long lint;
typedef pair<int, int> pii;
const int INF = 2e9;
int _min(int x, int y){ return x<y ? x : y; }
int n, l, r;
lint A[2010], S[2010];
lint solve1(){
int D[2010]; lint obj = (1LL<<42LL)-1;
for(int b=41; b>=0; b--){
D[0] = 0; obj ^= (1LL<<lint(b));
for(int i=1; i<=n; i++){
D[i] = INF;
for(int k=0; k<i; k++){
if(((S[i]-S[k])|obj) != obj) continue;
D[i] = _min(D[i], D[k] + 1);
}
}
if(D[n]>r) obj |= (1LL<<lint(b));
}
return obj;
}
lint solve2(){
# | 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... |