# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
291379 | cig32 | Cave (IOI13_cave) | C++14 | 79 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>
void exploreCave(int N) {
int S[N], D[N];
for(int i=0;i<N;i++){
S[i]=0;
D[i]=-1;
}
int prev=tryCombination(S);
if(prev==-1){
for(int i=0;i<N;i++){
S[i]=1;
int now=tryCombination(S);
D[i]=now;
S[i]=0;
}
answer(S,D);
return;
}
bool st1=true;
for(int i=0;i<N;i++){
bool ok=false;
int oops;
S[i]=1;
int one=tryCombination(S);
if(one==i)ok=true;
S[i]=0;
one=tryCombination(S);
if(one==i)ok=true;
if(!ok)st1=false;
}
if(st1){
for(int i=0;i<N;i++){
D[i]=i;
S[i]=1;
if(tryCombination(S)==i){
S[i]=0;
}
}
return;
}
while(true){
bool ok=true;
for(int i=0;i<N;i++){
if(D[i]==-1)ok=false;
}
if(ok){
answer(S,D);
return;
}
for(int i=0;i<N;i++){
if(D[i]==-1){
S[i]=1-S[i];
int now=tryCombination(S);
if(now==-1 || now>prev){
D[i]=prev;
prev=now;
}
else{
S[i]=1-S[i];
}
}
}
}
}
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... |