# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
341133 | YJU | 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<bits/stdc++.h>
#include"cave.h"
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
const ll MOD=1e9+7;
const ll MOD2=998244353;
const ll N=5e3+7;
const ll K=350;
const ld pi=acos(-1);
const ll INF=(1LL<<60);
#define SQ(i) ((i)*(i))
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(_a) (ll)_a.size()
ll S[N],R[N],guess[N];
void exploreCave(ll n){
REP(i,n)S[i]=R[i]=-1;
REP(i,n){
REP(j,n){
if(S[j]!=-1)guess[j]=S[j];
else guess[j]=0;
}
ll fc=tryCombinaion(guess);
ll l=0,r=n-1;
while(l<r){
ll mid=(l+r)>>1;
REP(j,n)if(S[j]!=-1)guess[j]=S[j];else guess[j]=(j<=mid?1:0);
ll c=tryCombination(guess);
if((fc==i)^(c==i))r=mid;
else l=mid+1;
}
S[l]=(fc==gate);
R[i]=l;
}
answer(S,R);
}