제출 #1083095

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