基本就是加边删边维护连通性的问题了
用并查集维护按时间分治做两遍就好了
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<vector>
using namespace std;
inline char nc(){
static char buf[100000],*p1=buf,*p2=buf;
if (p1==p2) { p2=(p1=buf)+fread(buf,1,100000,stdin); if (p1==p2) return EOF; }
return *p1++;
}
inline void read(int &x){
char c=nc(),b=1;
for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}
const int M=10005;
const int N=205;
struct modi{
int x,y,r;
}Stk[N*N]; int pnt;
int fat[N*N],rank[N*N];
inline int Fat(int u){
return u==fat[u]?u:Fat(fat[u]);
}
inline int Merge(int x,int y){
x=Fat(x); y=Fat(y); if (x==y) return 0;
if (rank[x]>rank[y]) swap(x,y);
Stk[++pnt].x=x; Stk[pnt].y=y; Stk[pnt].r=0;
if (rank[x]==rank[y]) rank[y]++,Stk[pnt].r=1;
fat[x]=y; return 1;
}
inline void Back(int t){
for (;pnt>t;pnt--){
fat[Stk[pnt].x]=Stk[pnt].x;
if (Stk[pnt].r) rank[Stk[pnt].y]--;
}
}
struct abcd{
int x,y,l,r;
abcd() { }
abcd(int x,int y,int l,int r):x(x),y(y),l(l),r(r) { }
};
typedef vector<abcd> Vec;
int n,m; int xs[M],ys[M];
int MMap[N][N],Map[N][N],vst[N][N];
int ans1[M],ans2[M],*ans;
int cnt;
const int dx[]={0,0,1,-1};
const int dy[]={1,-1,0,0};
#define P(x,y) (((x)-1)*n+(y))
inline void Modify(int x,int y){
vst[x][y]=1; fat[P(x,y)]=P(x,y);
for (int k=0;k<4;k++){
int sx=x+dx[k],sy=y+dy[k];
if (sx>n || sy>n || sx<1 || sy<1) continue;
if (vst[sx][sy])
if (Merge(P(x,y),P(sx,sy)))
cnt--;
}
}
inline void Solve(int l,int r,const Vec &vec){
int tmp=pnt;
Vec lv,rv; int mid=(l+r)>>1;
for (int i=0;i<(int)vec.size();i++)
if (vec[i].l<=l && r<=vec[i].r)
cnt++,Modify(vec[i].x,vec[i].y);
else{
if (vec[i].l<=mid) lv.push_back(vec[i]);
if (vec[i].r>mid) rv.push_back(vec[i]);
}
if (l==r)
ans[l]=cnt;
else
Solve(l,mid,lv),Solve(mid+1,r,rv);
cnt+=pnt-tmp;
Back(tmp);
for (int i=0;i<(int)vec.size();i++)
if (vec[i].l<=l && r<=vec[i].r)
cnt--,vst[vec[i].x][vec[i].y]=0,fat[P(vec[i].x,vec[i].y)]=0;
}
int last[N][N];
inline void Work(){
for (int i=1;i<=n;i++) for (int j=1;j<=n;j++) if (Map[i][j]) last[i][j]=0; else last[i][j]=-1;
Vec vec;
for (int i=1;i<=m;i++){
if (last[xs[i]][ys[i]]!=-1)
vec.push_back(abcd(xs[i],ys[i],last[xs[i]][ys[i]],i-1)),last[xs[i]][ys[i]]=-1;
else
last[xs[i]][ys[i]]=i;
}
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
if (last[i][j]!=-1)
vec.push_back(abcd(i,j,last[i][j],m)),last[i][j]=-1;
Solve(0,m,vec);
}
int main(){
freopen("t.in","r",stdin);
freopen("t.out","w",stdout);
read(n);
for (int i=1;i<=n;i++) for (int j=1;j<=n;j++) read(MMap[i][j]);
read(m);
for (int i=1;i<=m;i++) read(xs[i]),read(ys[i]);
for (int i=1;i<=n;i++) for (int j=1;j<=n;j++) Map[i][j]=MMap[i][j];
ans=ans1; Work();
for (int i=1;i<=n;i++) for (int j=1;j<=n;j++) Map[i][j]=MMap[i][j]^1;
ans=ans2; Work();
for (int i=1;i<=m;i++)
printf("%d %d\n",ans1[i],ans2[i]);
return 0;
}