| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 524833 | CSQ31 | The Big Prize (IOI17_prize) | 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 "prize.h"
#define X first
#define Y second
using namespace std;
typedef pair<int,int> pii;
int numb, q_count = 4999;
pii P[210000];
bool mark[210000];
vector<int>vtmp;
pii query(int x)
{
if(mark[x]) return P[x];
mark[x]=true;
q_count --;
vtmp=ask(x);
pii tmp=pii(vtmp[0],vtmp[1]);
if(tmp.X+tmp.Y==0) throw x;
return P[x]=tmp;
}
void bs(int l,int r,int nl,int nr)
{
if(l>r) return;
for(int i=0;i<=r-l;i++)
{
int mid,midl=(l+r)/2-i/2,midr=(l+r)/2+(i+1)/2;
if(i%2==0) mid=midl;
else mid=midr;
pii tmp=query(mid);
if(tmp.X+tmp.Y==numb)
{
int tmpl=(i%2==0?0:midr-midl);
int tmpr=(i%2==1?0:midr-midl);
if(tmp.X-tmpl>nl) bs(l,midl-1,nl,tmp.Y+tmpl);
if(tmp.Y-tmpr>nr) bs(midr+1,r,tmp.X+tmpr,nr);
break;
}
}
}
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
int find_best(int n)
{
if(n==1) return 0;
try{
numb=0;
memset(mark,false,sizeof mark);
for(int i=0;i<20;i++){
int c = uniform_int_distribution<int>(0,n-1)(rng);
pii tmp = query(c);
numb = max(num,tmp.X +tmp.Y);
}
bs(0,n-1,0,0);
}
catch(int ans){
for(int i=0;i<q_count;i++)
ask(0);
return ans;
}
return -1;
}