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;
typedef long long ll;
int n;
pair<int, vector<int>> differentRight(int a, vector<int> inf)
{
int b = n - 1;
int res = -1;
vector<int> rinf;
a++;
while (a <= b)
{
int mid = (a + b) / 2;
vector<int> cinf = ask(mid);
if (cinf == inf)
{
a = mid + 1;
} else
{
res = mid;
rinf = cinf;
b = mid - 1;
}
}
return {res, rinf};
}
int find_best(int N) {
n = N;
if (n <= 5000)
{
int res = -1;
for (int i = 0; i < n; i++)
{
vector<int> v = ask(i);
if (v[0] == 0 && v[1] == 0) res = i;
}
return res;
}
int ca = 0;
vector<int> inf = ask(0);
vector<int> needed = {0, 0};
while(inf != needed)
{
auto p1 = differentRight(ca, inf);
ca = p1.first;
inf = p1.second;
}
return ca;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |