# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
89167 | igzi | The Big Prize (IOI17_prize) | C++17 | 109 ms | 680 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 maxN 200002
using namespace std;
int i,x=0;
vector <int> v,a;
int find_best(int n){
for(i=0;i<n && i<500;i++){
a=ask(i);
if(a[0]+a[1]>x) x=a[0]+a[1];
if(a[0]+a[1]==0) return i;
}
int p=-1;
for(int i=0;i<x;i++){
int l,d,m;
l=p+1; d=n-x+i;
while(l<d){
m=(l+d)/2;
a=ask(m);
if(a[0]+a[1]==x){
if(a[0]-v.size()>0) d=m-1;
else l=m+1;
}
else{
d=m;
}
}
v.push_back(l);
p=l;
}
for(i=0;i<v.size();i++){
a=ask(v[i]);
if(a[0]+a[1]==0) return v[i];
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |