Submission #1083084

#TimeUsernameProblemLanguageResultExecution timeMemory
1083084erdemfurkanCave (IOI13_cave)C++14
13 / 100
9 ms600 KiB
#include "cave.h" #include <algorithm> void exploreCave(int N) { int combination[N]; for(int i = 0; i < N; i++) { combination[i] = 0; } // Hepsi açık int S[N]; int D[N]; for(int i = 0; i < N; i++) { S[i] = 0; } for(int i = 0; i < N; i++) { combination[i] = 1; int x = tryCombination(combination); D[i] = x; 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...