| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 820494 | vjudge1 | 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 "books.h"
using namespace std ;
//vector<int> ask(int ind)
//{
// vector<int> v(2) ;
// cout << "? " << ind << '\n' ;
// cin >> v[0] >> v[1] ;
// return v ;
//}
int find_best(int n)
{
int l = -1, r = n ;
while(l + 1 < r)
{
int mid = (l + r) / 2 ;
vector<int> v = ask(mid) ;
if(!v[0] && !v[1])
return mid ;
else
{
if(v[0])
r = mid ;
else
l = mid ;
}
}
return l ;
}
//signed main()
//{
// int n ;
// cin >> n ;
// cout<<find_best(n) ;
// return 0 ;
//}