# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
820813 | ZHIRDILBILDIZ | The Big Prize (IOI17_prize) | C++14 | 81 ms | 296 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 ;
//vector<int> ask(int ind)
//{
// vector<int> v(2) ;
// cout << "? " << ind << '\n' ;
// cin >> v[0] >> v[1] ;
// return v ;
//}
int find_best(int n)
{
bool flag = 0 ;
int l = -1, r = n, cnt = 0 ;
while(l + 1 < r)
{
int mid = (l + r) / 2 ;
cnt++ ;
vector<int> v = ask(mid) ;
if(v[0] && v[1])
{
flag = 1 ;
break ;
}
if(!v[0] && !v[1])
return mid ;
else
{
if(v[0])
r = mid ;
else
l = mid ;
}
}
if(!flag)
return l ;
int ind = 0 ;
while(ind < n)
{
cnt++ ;
vector<int> abu = ask(ind) ;
if(cnt == 10000)
{
while(true)
{
}
}
if(!abu[0] && !abu[1])
return ind ;
int l = ind, r = n ;
while(l + 1 < r)
{
int mid = (l + r) >> 1 ;
vector<int> now = ask(mid) ;
if(cnt == 10000)
{
while(true)
{
}
}
cnt++ ;
if(!now[0] && !now[1])
return mid ;
else
{
if(now[0] == abu[0] && now[1] == abu[1])
l = mid ;
else
r = mid ;
}
}
ind = l + 1 ;
}
}
//signed main()
//{
// int n ;
// cin >> n ;
// cout<<find_best(n) ;
// return 0 ;
//}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |