Submission #371395

#TimeUsernameProblemLanguageResultExecution timeMemory
371395bvh1234567891Cave (IOI13_cave)C++17
12 / 100
28 ms620 KiB
#include "cave.h" #include "iostream" #include "vector" #include "algorithm" using namespace std; void exploreCave(int N) { int len = 1; int tmp = 1; while (N>tmp) { len++; tmp*=2; } int position[N]; for (int i = 0; i < N; i++) position[i]=i; int button[N]; fill(button, button+N, 0); for (int i = 0; i < N; i++) { int res = tryCombination(button); if (res!=i) continue; else button[i]=1; } answer(button, position); }
#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...