Submission #1083082

#TimeUsernameProblemLanguageResultExecution timeMemory
1083082erdemfurkanCave (IOI13_cave)C++14
12 / 100
8 ms564 KiB
#include "cave.h" #include <algorithm> void exploreCave(int N) { int combination[N] = {0}; int S[N]; for(int i = 0; i < N; i++) { S[i] = 1; } int D[N]; for(int i = 0; i < N; i++) { D[i] = i; } for(int i = 0; i < N; i++) { combination[i] = 1; int x = tryCombination(combination); if(x == i) { S[i] = 0; combination[i] = 0; } } 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...