제출 #670964

#제출 시각아이디문제언어결과실행 시간메모리
6709641bin동굴 (IOI13_cave)C++14
0 / 100
199 ms408 KiB
#include <bits/stdc++.h> #include "cave.h" using namespace std; #define all(v) v.begin(), v.end() typedef long long ll; const int NMAX = 5e3 + 5; int N, S[NMAX], D[NMAX], fix[NMAX], x, y; void exploreCave(int N){ for(int i = 0; i < N; i++){ for(int t = 0; t < 2; t++){ for(int j = 0; j < N; j++) if(!fix[j]) S[j] = t; y = tryCombination(S); if(y == -1 || y > i) { x = t; break; } } int l = 0, r = N - 1, m; while(l < r){ m = (l + r + 1) / 2; for(int i = l; i < m; i++) if(!fix[i]) S[i] = x; for(int i = m; i <= r; i++) if(!fix[i]) S[i] = !x; y = tryCombination(S); if(y == -1 || y < m) r = m - 1; else l = m; } S[l] = x; D[l] = i; fix[l] = 1; } answer(S, D); return; }
#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...