Submission #424632

#TimeUsernameProblemLanguageResultExecution timeMemory
424632salehThe Big Prize (IOI17_prize)C++17
0 / 100
3046 ms14380 KiB
#include "prize.h" #include <bits/stdc++.h> using namespace std; const int MAXN = 200 * 1000 + 23; vector<int> vec[MAXN]; bitset<MAXN> mark; int look = 0, javab = -1, n, sum[MAXN]; set<int> s, lft; vector<int> osk(int x) { if (mark[x]) return vec[x]; mark[x] = true; lft.erase(x); return vec[x] = ask(x); } bool go() { int dw = 0, up = n, l = 0, r = 0; while (up - dw > 1) { int mid = (dw + up) >> 1; if (mark[mid] && vec[mid][0] + vec[mid][1] < look) {//opt if tle auto tmp = lft.lower_bound(mid); if (*tmp < dw) tmp++; mid = *tmp; } vector<int> v = osk(mid); s.insert(v[0] + v[1]); if (v[0] + v[1] == 0) return javab = mid, true; if (v[0] + v[1] < look) return false; if (look < v[0] + v[1]) { look = v[0] + v[1]; for (int i = 1; i <= n; i++) if (mark[i]) sum[i] = sum[i - 1] + 1; } int ll = v[0] - l - (sum[mid] - sum[dw]), rr = v[1] - r - (sum[up] - sum[mid]); if (ll < rr) dw = mid; else up = mid; } } int find_best(int N) { n = N; for (int i = 0; i < n; i++) lft.insert(i); while (!go()); return javab; } //int main() {}

Compilation message (stderr)

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