제출 #390861

#제출 시각아이디문제언어결과실행 시간메모리
390861jampm동굴 (IOI13_cave)C++17
12 / 100
28 ms408 KiB
#include "cave.h" void exploreCave(int N) { int S[N], D[N]; for (int i = 0; i < N; i++) { D[i] = i; S[i] = 0; } for (int i = 0; i < N; i++) { if (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...