#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
const int MX=200010;
bool up[MX];
int L[MX], R[MX], sum, n, ans=-1;
void my_ask(int i){
if(L[i]>=0) return;
vi now=ask(i);
L[i]=now[0], R[i]=now[1];
}
void search(int s, int e, int lc, int mc, int rc){
if(s>e || mc<=0) return;
int m=(s+e)/2;
for(int i=m; i<=e; i++){
my_ask(i);
if(L[i]+R[i]==0){ ans=i; return; }
if(L[i]+R[i]==sum){
search(s,m-1, lc, L[i]-(i-m)-lc, R[i]+i-m);
search(i+1,e, L[i], R[i]-rc, rc);
return;
}
}
for(int i=m; i>=s; i--){
my_ask(i);
if(L[i]+R[i]==0){ ans=i; return; }
if(L[i]+R[i]==sum){
search(s,i-1, lc, L[i]-lc, R[i]);
return;
}
}
}
void solve(){
int b=0;
for(; b*b<=n; b++);
for(int i=0; i*b<n; i++){
my_ask(i*b);
sum=max(sum, L[i*b]+R[i*b]);
}
for(int i=0; i*b<n; i++){
for(int j=i; j<n; j++){
my_ask(j);
if(L[j]+R[j]==sum){
int e=min(n-1, i*b+b-1); my_ask((e==n-1 ? e : e+1));
int l=L[j], r=R[(e==n-1 ? e : e+1)] + (e!=n-1 && L[e+1]+R[e+1]!=sum);
search(j, e, l, sum-l-r, r);
}
}
}
}
int find_best(int _n){
n=_n;
for(int i=0; i<n; i++) L[i]=R[i]=-1;
solve();
assert(ans>=0 && L[ans]==0 && R[ans]==0);
return ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
125 ms |
1784 KB |
Incorrect |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
61 ms |
1972 KB |
Incorrect |
2 |
Halted |
0 ms |
0 KB |
- |