# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
103059 | username | The Big Prize (IOI17_prize) | 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 "prize.h"
using namespace std;
typedef pair<int,int> pii;
typedef vector<int> VI;
#define REP(i,j,k) for(register int i=(j);i<(k);++i)
#define RREP(i,j,k) for(register int i=(j)-1;i>=(k);--i)
#define ALL(a) a.begin(),a.end()
#define MST(a,v) memset(a,(v),sizeof a)
#define pb push_back
#define mid (l+r>>1)
#define lch (idx*2+1)
#define rch (idx*2+2)
#define F first
#define S second
#define de(...) cerr<<__VA_ARGS__
#define ar(a,s,t) {REP(__i,s,t)de(a[__i]<<' ');de(endl);}
map<int,pii>mp;
pii qr(int i){
if(mp.count(i))return mp[i];
else{
VI tt=ask(i);
return mp[i]=pii(tt[0],tt[1]);
}
}
void dfs(int l,int r,pii ll,pii rr,int mx,int&res){
if(res<0&&l<r){
pii tt=qr(mid);
if(tt.F+tt.S==0)res=i;
else{
if(ll!=tt)dfs(l,mid,ll,tt,mx,res);
if(tt!=rr)dfs(mid,r,tt,rr,mx,res);
}
}
}
int find_best(int n){
int res=-1,mx=0;
REP(i,0,min(n,448)){
pii tt=qr(i);
mx=max(mx,tt.F+tt.S);
}
dfs(0,n,qr(0),pii(mx,0),mx,res);
return res;
}