2019牛客多校第七场E-Find the median(线段树+离散化区间)

传送门

#include<bits/stdc++.h>
using namespace std;

#define fi first
#define se second
typedef long long ll;
typedef pair<int,int> P;

const int INF=0x3f3f3f3f;
const int MAX_N=400000+5;
const int S=(1<<22);

int n,m;
ll dat0[S],dat1[S];
int L[MAX_N+1],R[MAX_N+1];
int b[MAX_N*2+1];

P get(int i){
    if(i%2)return P(b[(i+1)/2],b[(i+1)/2]);
    return P(b[i/2]+1,b[i/2+1]-1);
}

void add(int x,int y,int k=1,int l=1,int r=m*2-1){
    if(x<=l&&y>=r)dat1[k]++;
    else if(x<=r&&y>=l){
        //ll ans=min(get(y).se,get(r).se)-max(get(x).fi,get(l).fi)+1;
        ll ans=get(min(y,r)).se-get(max(x,l)).fi+1;
        dat0[k]+=ans;
        add(x,y,k*2,l,(l+r)/2);
        add(x,y,k*2+1,(l+r)/2+1,r);
    }
}

int query(ll p,ll ans=0,int k=1,int l=1,int r=m*2-1){
    ans+=dat1[k];
    if(l==r){
        if(l%2)return b[(l+1)/2];
        return get(l).fi+(p-1)/ans;
    }
    ll cnt=get((l+r)/2).se-get(l).fi+1;
    ll h=(ans+dat1[k*2])*cnt+dat0[k*2];
    if(p<=h)return query(p,ans,k*2,l,(l+r)/2);
    return query(p-h,ans,k*2+1,(l+r)/2+1,r);
}

void solve(){
    for(int i=1;i<=n;i++){
        b[i]=L[i];b[i+n]=R[i];
    }
    sort(b+1,b+2*n+1);
    m=1;
    for(int i=2;i<=2*n;i++){
        if(b[i]!=b[m])b[++m]=b[i];
    }
    ll sum=0;
    for(int i=1;i<=n;i++){
        int x=lower_bound(b+1,b+m+1,L[i])-b;
        int y=lower_bound(b+1,b+m+1,R[i])-b;
        add(x*2-1,y*2-1);
        sum+=(R[i]-L[i]+1);
        printf("%d\n",query((sum+1)/2));
    }
}

int main(){
    scanf("%d",&n);
    ll x1,x2,a1,b1,c1,m1;
    ll y1,y2,a2,b2,c2,m2;
    scanf("%lld%lld%lld%lld%lld%lld",&x1,&x2,&a1,&b1,&c1,&m1);
    scanf("%lld%lld%lld%lld%lld%lld",&y1,&y2,&a2,&b2,&c2,&m2);
    L[1]=min(x1,y1)+1;R[1]=max(x1,y1)+1;
    L[2]=min(x2,y2)+1;R[2]=max(x2,y2)+1;
    for(int i=3;i<=n;i++){
        ll x,y;
        x=(a1*x2+b1*x1+c1)%m1;
        y=(a2*y2+b2*y1+c2)%m2;
        L[i]=min(x,y)+1;R[i]=max(x,y)+1;
        x1=x2;x2=x;
        y1=y2;y2=y;
    }
    solve();
    return 0;
}