Submission #1280827

#TimeUsernameProblemLanguageResultExecution timeMemory
1280827LoboCave (IOI13_cave)C++17
12 / 100
14 ms484 KiB
#include "cave.h" void exploreCave(int N) { int s[N]; int d[N]; for(int i = 0; i < N; i++) { s[i] = 0; d[i] = i; } for(int i = 0; i < N; i++) { int q = tryCombination(s); if(!(q == -1 or q > i)) { s[i] = 1; } } 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...