제출 #1083073

#제출 시각아이디문제언어결과실행 시간메모리
1083073erdemfurkan동굴 (IOI13_cave)C++14
0 / 100
1 ms348 KiB
#include "cave.h" void exploreCave(int N) { int S[N] = {}; int bozuk = tryCombination(S); for(int i = 0; i < N; i++) { S[i] = i; } int D[N]; for(int i = 0; i < N; i++) { if(i == bozuk) { D[i] = 0; continue; } D[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...