# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
17343 | comet | Bali Sculptures (APIO15_sculpture) | C++98 | 139 ms | 1132 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 <cstring>
#include <algorithm>
using namespace std;
typedef long long ll;
ll a[2010];
ll sum[2010];
int N,A,B;
ll lim;
bool d[101][101];
int d2[2001];
int f(int D){
switch(D){
case 1:
for(int i=1;i<=N;i++){
d2[i]=1e9;
for(int j=0;j<i;j++){
if(((sum[i]-sum[j])|lim)==lim){
d2[i]=min(d2[i],d2[j]+1);
}
}
}
return d2[N];
case 2:
for(int i=1;i<=N;i++){
d[1][i]=0;
# | 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... |