Submission #96375

#TimeUsernameProblemLanguageResultExecution timeMemory
96375figter001The Big Prize (IOI17_prize)C++14
20 / 100
36 ms416 KiB
#include "prize.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; int ans,n; void solve(int l,int r){ if(l > r || ans != -1)return; int md = (l+r)/2; vector<int> res = ask(md); if(res[0] + res[1] == 0){ ans = md; return; } if(res[0] > res[1]){ solve(l,md-1); solve(md+1,r); }else{ solve(md+1,r); solve(l,md-1); } } int find_best(int N) { n = N; ans = -1; solve(0,n-1); return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...