# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
464746 | AdamGS | Cave (IOI13_cave) | C++14 | 261 ms | 456 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 "cave.h"
#include<bits/stdc++.h>
using namespace std;
#define rep(a, b) for(int a = 0; a < (b); ++a)
void exploreCave(int N) {
int S[N], D[N];
rep(i, N) {
S[i]=0;
D[i]=-1;
}
int lst=tryCombination(S);
rep(i, N) {
int p=0, k=N-1;
while(p<k) {
int sr=(p+k)/2;
for(int j=p; j<=sr; ++j) if(D[j]==-1) S[j]^=1;
int nowe=tryCombination(S);
if(nowe!=i && lst!=i || nowe==i && lst==i) p=sr+1; else k=sr;
lst=nowe;
}
D[p]=i;
if(lst==i) S[p]^=1;
lst=tryCombination(S);
}
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... |