제출 #511075

#제출 시각아이디문제언어결과실행 시간메모리
511075bebecanvas동굴 (IOI13_cave)C++14
12 / 100
17 ms456 KiB
#include "cave.h" void exploreCave(int N) { int d[N]; for(int i=0; i<N; i++){d[i]=i;} int s[N]; for(int i=0; i<N; i++){s[i]=0;} while(tryCombination(s)!=-1){ int a= tryCombination(s); s[a]+=1; s[a]%=2; } 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...