Submission #316074

#TimeUsernameProblemLanguageResultExecution timeMemory
316074MrDominoThe Big Prize (IOI17_prize)C++14
20 / 100
3058 ms372 KiB
#include <bits/stdc++.h> #include "prize.h" using namespace std; mt19937 rng((long long) (new char)); int find_best(int n) { /// subtask 1 int q = 0; int l = 0; while (l < n) { int r = l, lo = l + 1, hi = n - 1; vector<int> v_l = ask(r); q++; if (v_l[0] == 0 && v_l[1] == 0) { return l; } while (lo <= hi) { int pos = (lo + hi) / 2; vector<int> v_pos = ask(pos); q++; if (v_pos == v_l) { r = pos; lo = pos + 1; } else { hi = pos - 1; } } if (q >= 9000) { while (1) { cout << "sad\n"; } } l = r + 1; } }

Compilation message (stderr)

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