Submission #814658

#TimeUsernameProblemLanguageResultExecution timeMemory
814658Dan4LifeThe Big Prize (IOI17_prize)C++17
20 / 100
82 ms336 KiB
#include "prize.h" #include <bits/stdc++.h> using namespace std; #define pb push_back vector<int> v, w; void query(int l, int r){ if(l>r) return; if(l==r) v.pb(l); int mid = (l+r)/2; auto a = ask(mid); if(a[0]+a[1]==0) { w.pb(mid);return;} if(a[0]) query(l,mid-1); if(a[1]) query(mid+1,r); } int find_best(int n) { query(0,n-1); if(!w.empty()) return w[0]; for(auto u : v){ auto a = ask(u); if(a[0]+a[1]==0) return u; } }

Compilation message (stderr)

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