# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
798510 | QwertyPi | Cave (IOI13_cave) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
int N;
const int N_MAX = 5000;
bool U[N_MAX] = {};
int S[N_MAX], D[N_MAX], T[N_MAX];
int selfTryCombination(int T[]){
int r = tryCombination(T);
return r == -1 ? N : r;
}
int BS(int i, int s, vector<int>& v, int l, int r){
if(l + 1 == r) return v[l];
int mid = (l + r) / 2;
for(int j = 0; j < N; j++) T[j] = S[j];
for(int j = 0; j < v.size(); j++) T[v[j]] = !s;
for(int j = l; j < mid; j++) T[v[j]] = s;
int r = selfTryCombination(T);
int ok = r >= i + 1;
if(ok){
return BS(i, s, v, l, mid);
}else{
return BS(i, s, v, mid, r);
}
}
void exploreCave(int N) {
::N = N;
for(int i = 0; i < N; i++){
vector<int> v; for(int j = 0; j < N; j++) if(!U[j]) v.push_back(j);
for(int j = 0; j < N; j++) T[j] = S[j];
for(auto i : v) T[i] = 1;
int r = selfTryCombination(T);
int s = r >= i + 1;
int nxt = BS(i, s, v, 0, v.size());
S[nxt] = s; D[nxt] = i;
}
}