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>
#define P pair<int,int>
using namespace std;
const int maxn = 200100;
bool visited[maxn];
int q[maxn][2];
int max_sum, ind;
P query(int i) {
if(visited[i]) return {q[i][0], q[i][1]};
visited[i] = true;
vector<int>curr = ask(i);
q[i][0] = curr[0];
q[i][1] = curr[1];
return {q[i][0], q[i][1]};
}
int sum(int i) {
query(i);
return q[i][0] + q[i][1];
}
void solve(int l, int r) {
//cout<<l<<" "<<r<<"\n";
if(l > r || ind != -1) return;
P ql = query(l);
P qr = query(r);
if(ql.first + ql.second == 0) {
ind = l;
return;
}
if(qr.first + qr.second == 0) {
ind = r;
return;
}
if(ql.second == 0 || qr.first == 0) return;
if(l == r) return;
if(ql.first + ql.second != max_sum) {
solve(l+1, r);
return;
}
if(qr.first + qr.second != max_sum) {
solve(l, r-1);
return;
}
int between = qr.first - ql.first;
if(between == 0) return;
int mid = (l + r) / 2;
solve(l, mid);
solve(mid+1, r);
}
int find_best(int n) {
ind = -1;
int b = sqrt(n) + 1;
b = min(n, b);
for(int i=0;i-b<n;i+=b) {
int x = min(i, n-1);
if(sum(x) == 0) return x;
max_sum = max(max_sum, sum(x));
} //max_sum = 1;
for(int l=0;l<n;l+=b) {
if(ind != -1) return ind;
int r = min(n-1, l+b-1);
solve(l, r);
}
return ind;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |