제출 #1105146

#제출 시각아이디문제언어결과실행 시간메모리
1105146jadai007동굴 (IOI13_cave)C++17
13 / 100
10 ms564 KiB
#include "cave.h" #include<bits/stdc++.h> using namespace std; void exploreCave(int N) { int state[N] = {0}, link[N] = {0}; for(int i = 0; i < N; ++i){ int ft = tryCombination(state); state[i] = 1; int nd = tryCombination(state); if(ft == -1){ state[i] = 0; break; } else if(nd == -1) break; else if(ft != nd) state[i] = 0; } for(int i = 0; i < N; ++i){ state[i] = !state[i]; int ck = tryCombination(state); link[i] = ck; state[i] = !state[i]; } answer(state, link); }
#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...