Submission #1083080

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