# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
742822 | Dulguun | Cave (IOI13_cave) | C++11 | 44 ms | 420 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>
#include "cave.h".
using namespace std;
typedef long long ll;
int cur=0;
void exploreCave(int n){
int s[n], d[n];
for(int &i: s) i=0;
while(cur<n){
int exp, mid, l=0, r=n-1;
while(l<r){
if(l==r){
d[l]=cur++;
break;
}
mid = (l+r)/2;
for(int i=l; i<=mid; s[i++]^=1);
exp = tryCombination(s);
if(exp>cur || exp==-1) r=mid;
else l=mid+1;
for(int i=l; i<=mid; s[i++]^=1);
}
}
answer(s,d);
}
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... |