# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
488397 | SlavicG | 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 "bits/stdc++.h"
#include"cave.h"
using namespace std;
#define ll long long
#define forn(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(),v.rend()
#define pb push_back
#define sz(a) (int)a.size()
/*
int tryCombination(vector<int> s){return 0;}
void answer(vector<int> s, vector<int> k){return;}
*/
void exploreCave(int n){
vector<int> v;
vector<int> k;
vector<int> a(n, -1);
while(sz(v) < n){
int cur = sz(v);
vector<int> c = a;
for(int i = 0;i < n; ++i){
if(c[i] == -1)c[i] = 1;
}
int f = tryCombination(c);
int x = (f > sz(v) || f == -1);
int l = 0, r = n - 1, idx = -1;
while(l <= r){
int mid = l + r >> 1;
c = a;
for(int i = 0;i < mid; ++i){
if(c[i] == -1)c[i] = x;
}
for(int i = mid;i < n; ++i){
if(c[i] == -1)c[i] = (!x);
}
f = tryCombination(c);
if(f > sz(v) || f == -1){
idx = mid;
r = mid - 1;
}else l = mid + 1;
}
v.pb(idx);
k.pb(x);
}
answer(v, k);
}
/*
void solve()
{
}
int32_t main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int t = 1;
//cin >> t;
while(t--)
{
solve();
}
}
*/