Submission #597868

#TimeUsernameProblemLanguageResultExecution timeMemory
597868yanndevThe Big Prize (IOI17_prize)C++17
90 / 100
107 ms5140 KiB
#include "prize.h" #include <bits/stdc++.h> using namespace std; vector<int> ans[200042]; vector<int> query(int i) { if (ans[i].empty()) return ans[i] = ask(i); return ans[i]; } int find_best(int n) { int mxVal = 0; for (int i = 0; i < min(n, 500); i++) { auto x = query(i); mxVal = max(mxVal, x[0] + x[1]); } for (int i = 0; i < n; i++) { vector<int> a = query(i); if (a[0] == 0 && a[1] == 0) return i; if (a[0] + a[1] < mxVal) continue; int l = i; int r = n; while (l < r) { int m = (l + r + 1) / 2; vector<int> b = ask(m); if (b[0] == a[0] && b[1] == a[1]) l = m; else r = m - 1; } //cout << "poor range " << i << ' ' << l << '\n'; i = l; } return -1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...