제출 #235641

#제출 시각아이디문제언어결과실행 시간메모리
235641jam_xd_동굴 (IOI13_cave)C++17
25 / 100
17 ms512 KiB
#include "cave.h" #include "bits/stdc++.h" void exploreCave(int N) { int S[N]; int D[N]; for(int i=0;i<N;i++) S[i] = 0, D[i] = i; int val = tryCombination(S); if(val == -1){ for(int i=0;i<N;i++){ S[i] = 1; D[i] = tryCombination(S); S[i] = 0; } }else{ while(val != -1){ S[val] = 1; val = tryCombination(S); } } 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...