제출 #1294758

#제출 시각아이디문제언어결과실행 시간메모리
1294758cnasteaCave (IOI13_cave)C++20
100 / 100
174 ms524 KiB
#include "cave.h" #include <bits/stdc++.h> using namespace std; void exploreCave(int n) { int k, q; int b[n], c[n]; for(int i = 0; i < n; i++) b[i] = -1; for(int j = 0; j < n; j++){ int a[n]; for(int i = 0; i < n; i++) {a[i] = 0; if(b[i] == 1) a[i] = 1;} k = tryCombination(a); q = 0; if(k == j) q = 1; for(int i = 0; i < n; i++) if(b[i] == -1) a[i] = (q^1); int l = 0, r = n; while(r-l > 1){ int m = (l+r)/2; for(int i = l; i < m; i++) if(b[i] == -1) a[i] = q; k = tryCombination(a); if(k != j){ for(int i = l; i < m; i++) if(b[i] == -1) a[i] = (q^1); r = m; } else l = m; } b[l] = q; c[l] = j; } answer(b, c); }
#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...