제출 #598846

#제출 시각아이디문제언어결과실행 시간메모리
598846pakhomovee동굴 (IOI13_cave)C++17
0 / 100
521 ms392 KiB
#include "cave.h" #include <algorithm> using namespace std; void exploreCave(int N) { int match[N]; for (int i = 0; i < N; ++i) { int S[N]; int l = 0, r = N; while (l + 1 < r) { int m = (l + r) / 2; fill(S, S + N, 1); fill(S, S + m, 0); for (int j = 0; j < i; ++j) { S[match[j]] = 0; } if (tryCombination(S) == i) { l = m; } else { r = m; } } match[i] = l + 1; } int res[N]; fill(res, res + N, 0); answer(res, match); }
#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...