# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
550544 | esomer | Cave (IOI13_cave) | C++17 | 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;
void exploreCave(int N) {
vector<int> correct(N, -1);
vector<int> switches(N, -1);
for(int i = 0; i < N; i++){
if(correct[i] == -1){
vector<int> v(N, 0);
for(int j = 0; j < i; j++) v[j] = correct[j];
int x = tryCombination(v);
if(x == -1){
for(int j = i; j < N; j++) correct[j] = 0;
}else{
for(int j = i; j < x; j++) correct[j] = 0;
correct[x] = 1;
}
}
int lo = 0;
int hi = N - 1;
while(lo < hi){
int mid = (lo + hi) / 2;
vector<int> v(N, 1 - correct[i]);
for(int j = 0; j < i; j++){
v[switches[j]] = correct[j];
}
for(int j = lo; j <= mid; j++) v[j] = correct[i];
int x = tryCombination(v);
if(x > i || x == -1){
hi = mid;
}else lo = mid + 1;
}
switches[i] = lo;
}
vector<int> d(N);
for(int i = 0; i < N; i++){
d[switches[i]] = i;
}
vector<int> s(N);
for(int i = 0; i < N; i++){
s[switches[i]] = correct[i];
}
answer(s, d);
}