Submission #441140

#TimeUsernameProblemLanguageResultExecution timeMemory
441140lLab_Cave (IOI13_cave)C++14
13 / 100
16 ms460 KiB
#include "cave.h" #include <bits/stdc++.h> using namespace std; void exploreCave(int N) { int B[N], door[N]; for(int i=0;i<N;++i){ B[i] = 0; door[i] = -1; } int res = 0; while(res != -1){ res = tryCombination(B); if(res == -1) break; for(int i=0;i<N;++i){ if(door[i] != -1) continue; B[i] = (B[i]+1)%2; int res2 = tryCombination(B); B[i] = (B[i]+1)%2; if(res2 < res){ door[i] = res2; }else if(res2 > res){ door[i] = res; break; } } } for(int i=0;i<N;++i){ B[i] = (B[i]+1)%2; door[i] = tryCombination(B); B[i] = (B[i]+1)%2; } answer(B,door); }
#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...