# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
972087 | tamir1 | Cave (IOI13_cave) | C++17 | 9 ms | 568 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<iostream>
using namespace std;
int S[5000],D[5000];
void exploreCave(int N) {
int i,n;
if(N<=100){
while(tryCombination(S)!=-1){
int x=tryCombination(S);
for(i=0;i<N;i++){
if(S[i]==1) continue;
S[i]=1-S[i];
int y=tryCombination(S);
if(y==-1) break;
if(y<x) S[i]=1-S[i];
}
}
}
if(tryCombination(S)==-1){
for(i=0;i<N;i++){
S[i]=1-S[i];
int x=tryCombination(S);
S[i]=1-S[i];
D[i]=x;
}
answer(S,D);
}
for(i=0;i<N;i++) D[i]=i;
for(i=0;i<N;i++){
int x=tryCombination(S);
if(x==-1) break;
S[x]=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... |