제출 #261590

#제출 시각아이디문제언어결과실행 시간메모리
261590s_avila_g동굴 (IOI13_cave)C++14
0 / 100
12 ms384 KiB
#include <bits/stdc++.h> using namespace std; #include "cave.h" void exploreCave(int N) { int comb[N], inter[N]; for(int i = 0; i < N; i++) inter[i] = i, comb[i] = 0; for(int i = 0; i < N; i++){ if(tryCombination(comb) > i) continue; else comb[i] = 1; } answer(comb,inter); }
#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...