luogu_P2824 [HEOI2016/TJOI2016]排序

#include<iostream>
#include<cstdio>

#define ri register int
#define u long long

namespace opt {

    inline u in() {
        u x(0),f(1);
        char s(getchar());
        while(s<‘0‘||s>‘9‘) {
            if(s==‘-‘) f=-1;
            s=getchar();
        }
        while(s>=‘0‘&&s<=‘9‘) {
            x=(x<<1)+(x<<3)+s-‘0‘;
            s=getchar();
        }
        return x*f;
    }

}

using opt::in;

#define NN 100005
#define MM 100005

namespace xds {

    struct node {
        u l,r,sum,add;
    } a[NN<<2];

    u b[NN];

    void build(const u &rt,const u &l,const u &r) {
        a[rt].l=l,a[rt].r=r,a[rt].add=-1;
        if(l==r) {
            a[rt].sum=b[l];
            return;
        }
        u mid(l+r>>1),_x(rt<<1),_y(rt<<1|1);
        build(_x,l,mid);
        build(_y,mid+1,r);
        a[rt].sum=a[_x].sum+a[_y].sum;
    }

    void pushdown(const u &rt) {
        if(a[rt].add!=-1) {
            u _x(rt<<1),_y(rt<<1|1);
            a[_x].sum=(a[_x].r-a[_x].l+1)*a[rt].add;
            a[_y].sum=(a[_y].r-a[_y].l+1)*a[rt].add;
            a[_x].add=a[rt].add,a[_y].add=a[rt].add;
            a[rt].add=-1;
        }
    }

    void update(const u &rt,const u &l,const u &r,const u &x) {
        if(a[rt].l>=l&&a[rt].r<=r) {
            a[rt].sum=(a[rt].r-a[rt].l+1)*x;
            a[rt].add=x;
            return;
        }
        pushdown(rt);
        u _x(rt<<1),_y(rt<<1|1);
        if(l<=a[_x].r) update(_x,l,r,x);
        if(r>=a[_y].l) update(_y,l,r,x);
        a[rt].sum=a[_x].sum+a[_y].sum;
    }

    u query(const u &rt,const u &l,const u &r) {
        if(a[rt].l>=l&&a[rt].r<=r) return a[rt].sum;
        pushdown(rt);
        u _x(rt<<1),_y(rt<<1|1),_re(0);
        if(l<=a[_x].r) _re+=query(_x,l,r);
        if(r>=a[_y].l) _re+=query(_y,l,r);
        return _re;
    }

}

namespace mainstay {

    struct node {
        u k,l,r;
    } a[MM];

    u N,M,K,c[NN];

    u check(const u &x) {
        for(ri i(1); i<=N; ++i) xds::b[i]=c[i]<=x;
        xds::build(1,1,N);
        for(ri i(1); i<=M; ++i) {
            u _t(xds::query(1,a[i].l,a[i].r));
            if(!_t||_t==a[i].r-a[i].l+1) continue;
            if(a[i].k) {
                xds::update(1,a[i].r-_t+1,a[i].r,1);
                xds::update(1,a[i].l,a[i].r-_t,0);
            } else {
                xds::update(1,a[i].l,a[i].l+_t-1,1);
                xds::update(1,a[i].l+_t,a[i].r,0);
            }
        }
        return xds::query(1,K,K);
    }

    inline void solve() {
        N=in(),M=in();
        for(ri i(1); i<=N; ++i) c[i]=in();
        for(ri i(1); i<=M; ++i) a[i].k=in(),a[i].l=in(),a[i].r=in();
        K=in();
        u _l(1),_r(N),ans;
        while(_l<=_r) {
            u mid(_l+_r>>1);
            if(check(mid)) _r=mid-1,ans=mid;
            else _l=mid+1;
        }
        std::cout<<ans;
    }

}

int main() {

    //freopen("x.txt","r",stdin);
    std::ios::sync_with_stdio(false);
    mainstay::solve();

}