# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
619182 | SlavicG | The Big Prize (IOI17_prize) | C++17 | 3035 ms | 292 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "prize.h"
#include "bits/stdc++.h"
using namespace std;
map<int, vector<int>> mp;
int ans = -1;
vector<int> query(int i) {
if(mp.count(i)) return mp[i];
vector<int> paiu = ask(i);
mp[i] = paiu;
if(paiu[0] + paiu[1] == 0) ans = i;
return paiu;
}
void rec(int l, int r) {
if(ans != -1) return;
if(l >= r) return;
if(ans != -1) return;
if(query(r)[0] == query(l)[0] && query(r)[1] == query(l)[1]) return;
if(ans != -1) return;
int mid = l + r >> 1;
if(query(mid)[0] + query(mid)[1] == 0) {
ans = mid;
return;
}
rec(l, mid - 1);
if(ans != -1) return;
rec(mid, r);
if(ans != -1) return;
}
int find_best(int n) {
ans = -1;
mp.clear();
rec(0, n - 1);
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |