Submission #617763

#TimeUsernameProblemLanguageResultExecution timeMemory
617763AbdelmagedNourThe Big Prize (IOI17_prize)C++17
20 / 100
36 ms336 KiB
#include<bits/stdc++.h> using namespace std; #include "prize.h" int MAX,res=-1; bool is_max(vector<int>x){ return x[0]+x[1]==MAX; } void divide(int l,int r){ if(l>r||res!=-1)return; if(l==r){ vector<int>x=ask(l); if(x[0]+x[1]==0)res=l; return; } vector<int>x=ask(l); if(!is_max(x)){ if(x[0]+x[1]==0)res=l; divide(l+1,r); return; } vector<int>y=ask(r); if(!is_max(y)){ if(y[0]+y[1]==0)res=r; divide(l,r-1); return; } if(x[0]==y[0]&&x[1]==y[1])return; int md=(l+r)>>1; divide(l,md); divide(md+1,r); } int find_best(int n){ MAX=0; res=-1; for(int i=0;i<min(n,1000);i++){ vector<int>x=ask(i); if(x[0]+x[1]==0)return i; MAX=max(MAX,x[0]+x[1]); } divide(1000,n-1); return res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...