# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
597842 | yanndev | 커다란 상품 (IOI17_prize) | C++17 | 0 ms | 0 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;
int find_best(int n) {
for (int i = 0; i < n; i++) {
vector<int> a = ask(i);
if (a[0] == 0 && a[1] == 0)
return i;
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
}
}