A1310. 矩形计算(钟沛林) 二维莫队

-歪，110，我要报警。

这转移真tm难写

#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;

const int N=205;
const int M=100005;
const int NM=40005;
int n,m,Q,ans,cnt,tot;
int b[N][N],belong[N][N],id[N][N];
bool vis[N][N];
int num[NM];
int ANS[M];
struct node
{
    int x,y,z;
}a[NM];
struct query
{
    int x1,x2,y1,y2,id;
}q[M];

inline int read()
{
    int a=0,f=1; char c=getchar();
    while (c<'0'||c>'9') {if (c=='-') f=-1; c=getchar();}
    while (c>='0'&&c<='9') {a=a*10+c-'0'; c=getchar();}
    return a*f;
}

inline bool operator<(node a,node b)
{
    return a.z<b.z;
}

inline bool operator<(query a,query b)
{
    return belong[a.x1][a.y1]==belong[b.x1][b.y1]?id[a.x2][a.y2]<id[b.x2][b.y2]:belong[a.x1][a.y1]<belong[b.x1][b.y1];
}

inline void add(int x,int y)
{
    if (!vis[x][y])
    {
        vis[x][y]=1;
        ans+=2*(num[b[x][y]]++)+1;
    }
}   

inline void del(int x,int y)
{
    if (vis[x][y])
    {
        vis[x][y]=0;
        ans-=2*(--num[b[x][y]])+1;
    }
}

inline void ADD(int x1,int y1,int x2,int y2)
{
    for (int i=x1;i<=x2;i++)
        for (int j=y1;j<=y2;j++)
            add(i,j);
}

inline void DEL(int x1,int y1,int x2,int y2)
{
    for (int i=x1;i<=x2;i++)
        for (int j=y1;j<=y2;j++)
            del(i,j);
}

inline void modify(query a,query b)
{
    int t;
    t=min(a.x1-1,b.x2); ADD(b.x1,b.y1,t,b.y2);
    t=max(a.x2+1,b.x1); ADD(t,b.y1,b.x2,b.y2);
    t=min(a.y1-1,b.y2); ADD(b.x1,b.y1,b.x2,t);
    t=max(a.y2+1,b.y1); ADD(b.x1,t,b.x2,b.y2);
    t=min(b.x1-1,a.x2); DEL(a.x1,a.y1,t,a.y2);
    t=max(b.x2+1,a.x1); DEL(t,a.y1,a.x2,a.y2);
    t=min(b.y1-1,a.y2); DEL(a.x1,a.y1,a.x2,t);
    t=max(b.y2+1,a.y1); DEL(a.x1,t,a.x2,a.y2);
}

int main()
{
    n=read(); m=read();
    for (int i=1;i<=n;i++)
        for (int j=1;j<=m;j++)
            id[i][j]=++cnt,a[cnt]=(node){i,j,read()};
    sort(a+1,a+cnt+1);
    b[a[1].x][a[1].y]=++tot;
    for (int i=2;i<=cnt;i++)
        if (a[i].z!=a[i-1].z) 
            b[a[i].x][a[i].y]=++tot;
        else b[a[i].x][a[i].y]=tot;
    int NN=sqrt(n),MM=sqrt(m);
    for (int i=1;i<=n;i++)
        for (int j=1;j<=m;j++)
            belong[i][j]=(i-1)/NN*MM+(j-1)/MM;
    Q=read();
    for (int i=1;i<=Q;i++)
    {
        q[i].x1=read(); q[i].y1=read(); q[i].x2=read(); q[i].y2=read(); q[i].id=i;
        if (q[i].x1>q[i].x2) swap(q[i].x1,q[i].x2);
        if (q[i].y1>q[i].y2) swap(q[i].y1,q[i].y2);
    }
    sort(q+1,q+Q+1);
    ADD(q[1].x1,q[1].y1,q[1].x2,q[1].y2);
    ANS[q[1].id]=ans;
    for (int i=2;i<=Q;i++)
    {
        modify(q[i-1],q[i]);
        ANS[q[i].id]=ans;
    }
    for (int i=1;i<=Q;i++)
        printf("%d\n",ANS[i]);
    return 0;
}