Submission #434811

#TimeUsernameProblemLanguageResultExecution timeMemory
434811dutchThe Big Prize (IOI17_prize)C++17
100 / 100
58 ms328 KiB
#include <bits/stdc++.h> using namespace std; #include "prize.h" int ans, val; void search(int l, int r, int lx, int rx){ if(l > r || ans >= 0 || lx + rx == val) return; int m1 = (l + r) / 2, m2 = m1 + 1, x, y, cnt = 0; vector<int> q = {0, 0}; while(1){ if((y = m1-l > r-m2)) x = m1--; else x = m2++; q = ask(x); if(q[0] + q[1] == 0) return void(ans = x); if(q[0] + q[1] < val) ++cnt; else break; if(cnt == val - lx - rx) return; } q[!y] += cnt; search(l, m1, lx, q[1]); search(m2, r, q[0], rx); } int find_best(int n){ ans = val = -1; for(int i=1; i<n; i+=i){ vector<int> q = ask(i-1); val = max(val, q[0] + q[1]); q = ask(n-i); val = max(val, q[0] + q[1]); } search(0, n-1, 0, 0); return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...