Submission #29844

#TimeUsernameProblemLanguageResultExecution timeMemory
29844ozaslanCave (IOI13_cave)C++14
33 / 100
235 ms516 KiB
#include "cave.h" #define max_N 5005 int kul[max_N], S[max_N], D[max_N]; void exploreCave(int N) { for (int i = 0; i < N; i++) { int kapi = tryCombination(S); if (kapi != i) { for (int j = 0; j < N; j++) if (!kul[j]) { S[j] = 1; kapi = tryCombination(S); if (kapi == i) { S[j] = 0; D[j] = i; kul[j] = 1; break; } else S[j] = 0; } } else for (int j = 0; j < N; j++) if (!kul[j]) { S[j] = 1; kapi = tryCombination(S); if (kapi > i || kapi == -1) { D[j] = i; kul[j] = 1; break; } else S[j] = 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...