Submission #559773

#TimeUsernameProblemLanguageResultExecution timeMemory
559773Mahmudul_KabirThe Big Prize (IOI17_prize)C++14
20 / 100
67 ms336 KiB
#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; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...