# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
16333 | comet | Cave (IOI13_cave) | C++98 | 393 ms | 608 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 <cstring>
#include "cave.h"
int a[5000],b[5000],p,n;
bool flip(int L,int R){
bool ret=0;
for(int i=L;i<=R;i++){
if(b[i]<0)a[i]=!a[i],ret=1;
}
return ret;
}
void finish(){
for(int i=0;i<n;i++){
if(b[i]<0){
a[i]=!a[i];
b[i]=tryCombination(a);
a[i]=!a[i];
}
}
answer(a,b);
}
void f(int L,int R,int v){
if(L==R){
b[L]=v;
if(p==v)a[L]=!a[L];
return;
}
int mid=(L+R)/2;
if(!flip(L,mid)){
f(mid+1,R,v);
return;
# | 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... |