Submission #511109

#TimeUsernameProblemLanguageResultExecution timeMemory
511109bebecanvasCave (IOI13_cave)C++14
13 / 100
10 ms368 KiB
#include "cave.h" #include <queue> void exploreCave(int N) { int d[N]; int s[N]; for(int i=0; i<N; i++){s[i]=0;} while(tryCombination(s)!=-1){ int a= tryCombination(s); for(int i=0; i<N; i++){ s[i]++; s[i]%=2; if(tryCombination(s)==-1||tryCombination(s)>a){break;} s[i]++; s[i]&=2; } } for(int i=0; i<N; i++){ s[i]+=1; s[i]%=2; int a= tryCombination(s); d[i]=a; s[i]+=1; s[i]%=2; } answer(s, d); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...