# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
668120 | finn__ | 커다란 상품 (IOI17_prize) | C++17 | 1483 ms | 296 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 <bits/stdc++.h>
#include "prize.h"
using namespace std;
int find_best(int n)
{
int ans_max = 0;
for (size_t i = 0; i * i < n; i++)
{
vector<int> ans = ask(i);
ans_max = max(ans_max, ans[0] + ans[1]);
if (!ans[0] && !ans[1])
return i;
}
int i = -1, found = 0;
while (1)
{
int a = i + 1, b = n - 1;
while (a < b)
{
int mid = (a + b) / 2;
vector<int> ans = ask(mid);
if (!ans[0] && !ans[1])
return mid;
if (ans[0] + ans[1] == ans_max)
{
if (ans[0] == found)
a = mid + 1;
else
b = mid;
}
else
b = mid;
}
found++;
i = a;
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |