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<iostream>
#include<vector>
#include<algorithm>
#define ep emplace
#define eb emplace_back
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef pair<int,int>pi;
typedef pair<ll,ll>pl;
const int inf=1e9+7;
const ll INF=1e18;
const int mx=200010;
struct seg
{
struct node
{
int sum;
int mxl;
node(int v=0):sum(v),mxl(v){}
node(int sum,int mxl):sum(sum),mxl(mxl){}
node operator+(const node&x)
{
return node(sum+x.sum,max(mxl,sum+x.mxl));
}
}t[mx*4];
void init(int n,int s,int e,vector<int>&v)
{
if(s==e)
{
t[n]=node(v[s]);
return;
}
int m=s+(e-s)/2;
init(n*2,s,m,v);
init(n*2+1,m+1,e,v);
t[n]=t[n*2]+t[n*2+1];
return;
}
int query(int n,int s,int e,int S,int E,int lft)
{
if(s>E||S>e)
return 0;
if(S<=s&&e<=E&&t[n].mxl+lft<0)
return t[n].sum+lft;
if(s==e)
return s;
int m=s+(e-s)/2;
int lf=query(n*2,s,m,S,E,lft);
if(lf>0)
return lf;
return query(n*2+1,m+1,e,S,E,lf);
}
}st;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n,r;
cin>>n>>r;
r=(r-n*2)%n+n*2;
int s;
cin>>s;
vector<int>v(n*2-1);
for(int&t:v)
{
cin>>t;
t=t>s?1:0;
}
vector<int>memo(n+1,inf);
auto getpos=[&](int start)->int
{
if(s==1)
return 1;
if(memo[start]!=inf)
return memo[start];
vector<int>cnt(n+1,0);
for(int i=1;i<start;i++)
cnt[i]=v[i*2-2]+v[i*2-1]-1;
cnt[start]=v[start*2-2]-1;
for(int i=start;i++<n;)
cnt[i]=v[i*2-3]+v[i*2-2]-1;
cnt[1]++;
vector<int>prfs(1,0);
for(int i=0;i++<n;)
prfs.eb(prfs.back()+cnt[i]);
vector<int>tm(n+1,inf);
for(int i=0;i++<n;)
{
if(cnt[i]<(i==start?0:1)+(i==1?1:0))
{
tm[1]=i-1;
break;
}
}
st.init(1,1,n,cnt);
for(int i=1;i++<n;)
{
int fi=st.query(1,1,n,i,n,0);
if(fi>0)
tm[i]=fi-i;
else
{
int se=st.query(1,1,n,1,i-1,fi);
if(se>0)
{
tm[i]=n-i+se;
if(se<=tm[1]&&prfs[se]+fi==0)
tm[i]++;
}
}
}
int cur=start,cc=start;
for(int t=0;t<r;t++)
{
if(t>=tm[cc])
cur--,cc--;
if(cc==0)
cc=n;
}
return memo[start]=cur;
};
{
int pos=getpos(n);
while((pos-1)%n!=0)
pos--;
int s=1,e=n;
while(s<e)
{
int m=s+(e-s)/2;
if(getpos(m)<pos)
s=m+1;
else
e=m;
}
pos=getpos(s);
e=n;
for(int i=s;i++<n;)
if(memo[i]!=inf&&memo[i]>pos)
e=min(e,i-1);
for(int i=s;i++<n;)
if(memo[i]==pos)
s=i;
while(s<e)
{
int m=s+(e-s+1)/2;
if(getpos(m)==pos)
s=m;
else
e=m-1;
}
cout<<s<<endl;
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |