Submission #775049

#TimeUsernameProblemLanguageResultExecution timeMemory
775049t6twotwoThe Big Prize (IOI17_prize)C++17
0 / 100
6 ms360 KiB
#include "prize.h" #include <bits/stdc++.h> using namespace std; int find_best(int N) { int mx = 0; for (int i = 0; i < 500; i++) { vector<int> t = ask(i); if (t[0] + t[1] == 0) { return i; } mx = max(mx, t[0] + t[1]); } int x = 500; while (1) { vector<int> t = ask(x); if (t[0] + t[1] == 0) { return x; } if (t[0] + t[1] != mx) { x++; continue; } int lo = x, hi = N - 1; while (lo < hi) { int mi = (lo + hi + 1) / 2; vector<int> v = ask(mi); if (v[0] + v[1] == t[0] + t[1]) { lo = mi; } else { hi = mi - 1; } } x = lo + 1; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...