# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
386408 | ismoilov | 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;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).begin(), (x).end()
#define fp(a,i,c) for(int (a) = (i); (a) < (c); (a)++)
#define fpp(a,i,c) for(int (a) = (i); (a) <= (c); (a)++)
#define fv(c) for(int (a) = (1); (a) <= (c); (a)++)
#define fz(c) for(int (a) = (0); (a) < (c); (a)++)
#define fm(a,i,c) for(int (a) = (i); (a) > (c); (a)--)
#define fmm(a,i,c) for(int (a) = (i); (a) >= (c); (a)--)
#define pb push_back
#define in insert
#define ss second
#define ff first
void exploreCave(int n) {
int v[n], a[n];
vector <int> s;
fp(i,0,n)
a[i] = -1, v[i] = 0, s.pb(i);
int x = 0;
fp(i,0,n){
fp(j,0,n)
if(!s[j])
v[j] = x;
int f = tryCombination(v);
if(f == i)
x = (x+1)%2;
int l = 0, r = n-1;
while(l < r){
int m = (l+r)/2;
fp(j,0,n){
if(!s[j]){
v[j] = x;
if(j < l || j > m)
v[j] = (x+1)%2;
}
}
f = tryCombination(v);
if(f == i)
l = m + 1;
else
r = m - 1;
}
v[l] = x;
s[l] = 1;
ans[l] = x;
a[l] = i;
}
answer(v, a);
}