Submission #427139

#TimeUsernameProblemLanguageResultExecution timeMemory
427139MOUF_MAHMALATThe Big Prize (IOI17_prize)C++14
0 / 100
70 ms284 KiB
#include "prize.h" #include<bits/stdc++.h> using namespace std; typedef int ll; vector<ll>v,w,x; ll l,r,m; int find_best(int n) { v=ask(0); l=0,r=n-1; while(l<n) { m=(l+n)/2; w=ask(m); if(w[0]+w[1]==0) return m; if(v==w) { l=m+1; continue; } for(ll i=l; i<=min(n-1,l+500); i++) { x=ask(i); if(x[0]+x[1]==0) return i; v=x; } l+=500; } }

Compilation message (stderr)

prize.cpp: In function 'int find_best(int)':
prize.cpp:31:1: warning: control reaches end of non-void function [-Wreturn-type]
   31 | }
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...