# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
559772 | Mahmudul_Kabir | 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 "prize.h"
#include "bits/stdc++.h"
#define sp <<" "
#define el <<"\n"
#define S second
#define F first
#define pb push_back
#define all(ar) ar.begin(),ar.end()
#define pii pair<ll,ll>
using namespace std;
using ll = long long;
int find_best(int n) {
int l = 0, r = n - 1;
int mid;
for(int i = 0; i < n; i++) {
mid = l + (r - l)/2;
std::vector<int> res = ask(mid);
if(res[0] + res[1] == 0) return mid;
if(res[0] > res[1]) r = mid - 1;
else l = mid + 1;
}
return 0;
}
#ifndef LOCALLL
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
/*
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
//*/
cout<<find_best(8);
return 0;
}
#endif