P4169 [Violet]天使玩偶/SJY摆棋子

// luogu-judger-enable-o2
#include<cstdio> 
#include<iostream>
using namespace std;
const int maxn=1e7+10;
const int inf=2e7+7;
struct node
{
    int x,y,id,ans,time;
}a[maxn],b[maxn],tt[maxn];;
int flag;
int len,x,y;
int n,q;
struct XX
{
    int c[maxn];
    int  lowbit(int x)
    {
        return x&(-x);
    }
    void update(int x,int w)
    {
        for(;x<=len;x+=lowbit(x))
        {
            c[x]=max(w,c[x]);
        }
    }
    int sum(int x)
    {
        int res=0;
        for(;x;x-=lowbit(x))
        {
            res=max(res,c[x]);
        }
        if(res)
        {
            return res;
        }
        else
        return -inf;
    }
    void clear(int x)
    {
        for(;c[x];x+=lowbit(x))
        {
            c[x]=0;
        }
    }
}XX;
void CDQ(int l,int r)
{
    if(l == r) return;
    int mid =(l+r)>>1;
    CDQ (l,mid);
    CDQ(mid+1,r);
    int t1=l;
    int t2=mid+1;
    int k=l;
    while(t2<=r)
    {
        while(t1<=mid&&b[t1].x<=b[t2].x)
        {
            if(b[t1].time==1)
            {
                XX.update(b[t1].y,b[t1].x+b[t1].y);
             } 
             tt[k++]=b[t1++];
        }
        if(b[t2].time==2)
        {
            a[b[t2].id].ans=min(a[b[t2].id].ans,b[t2].x+b[t2].y-XX.sum(b[t2].y));    
        }
        tt[k++]=b[t2++];
    }
    for(int i=l;i<=t1-1;i++)
    {
        if(b[i].time==1)
        {
            XX.clear(b[i].y);
        }
    }
    
    while(t1<=mid)
    {
        tt[k++]=b[t1++];
    }
    for(int i=l;i<=r;i++)
    {
        b[i]=tt[i];
    }
}
void solve(int x1,int y1)
{
    for(int i=1;i<=n+q;i++)
    {
        b[i]=a[i];
        if(x1)
        {
            b[i].x=len-b[i].x;
        }
        if(y1)
        {
            b[i].y=len-b[i].y;
        }
    }
    CDQ(1,n+q);
}
int main()
{
    scanf("%d%d",&n,&q);
    for(int i=1;i<=n;i++)
    {
        scanf("%d%d",&x,&y);
        a[i].time=1;
        a[i].id=i;
        a[i].x=++x;
        a[i].y=++y;
        len=max(len,max(x,y));
    }
    for(int i=n+1;i<=n+q;i++)
    {
        scanf("%d%d%d",&flag,&x,&y);
        a[i].time=flag;
        a[i].id=i;
        a[i].x=++x;
        a[i].y=++y;
        a[i].ans=inf;
        len=max(len,max(x,y));
    }
    len++;
    solve(0,0);
    solve(0,1);
    solve(1,0);
    solve(1,1);
    for(int i=n+1;i<=n+q;i++)
    {
        if(a[i].time ==2)
        {
            printf("%d
",a[i].ans);
        }
    }
    return 0;
 }