제출 #390863

#제출 시각아이디문제언어결과실행 시간메모리
390863jampm동굴 (IOI13_cave)C++17
34 / 100
63 ms416 KiB
#include "cave.h" void exploreCave(int N) { int S[N], D[N]; int last = 0; for (int i = 0; i < N; i++) S[i] = 0; while (last != -1) { last = tryCombination(S); for (int i = 0; i < N; i++) { S[i] = (S[i] - 1)*(S[i] - 1); int aux = tryCombination(S); if (aux > last || aux == -1) { last = aux; break; } S[i] = (S[i] - 1)*(S[i] - 1); } } for (int i = 0; i < N; i++) { S[i] = (S[i] - 1)*(S[i] - 1); D[i] = tryCombination(S); S[i] = (S[i] - 1)*(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...