# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1084159 | Jovica | 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>
using namespace std;
//pair<int,int> prasanja[200001];
/*
int *ask(int i)
{
cout<< "prasuva za "<<i<<endl;
int *a = new int [2];
cin>>a[0]>>a[1];
return a;
}
*/
int find_best(int n)
{
queue<pair<int,int> > q;
q.push({0,n-1});
while(true)
{
int l = q.front().first;
int r = q.front().second;
q.pop();
int mid = (l+r)/2;
int *a = ask(mid);
if (a[0]==0 && a[1]==0) return mid;
if (a[0]>0) q.push({l,mid-1});
if (a[1]>0) q.push({mid+1,r});
}
}
int main()
{
//find_best(100);
return 0;
}