제출 #1042026

#제출 시각아이디문제언어결과실행 시간메모리
1042026blackslex동굴 (IOI13_cave)C++17
0 / 100
3 ms348 KiB
#include "cave.h" #include<bits/stdc++.h> using namespace std; void exploreCave(int N) { int D[N], pos[N]; for (int i = 0; i < N; i++) pos[i] = i; int cmx = tryCombination(D); if (!(~cmx)) return void(answer(D, pos)); for (int i = cmx + 1; i < N; i++) { int z0 = tryCombination(D); if (z0 >= i) {D[i] = 0; continue;} D[i] = 1; } answer(D, pos); }
#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...