AtCoder Grand Contest 015 C Nuske vs Phantom Thnook 二位前缀和

Description

---

给定一张n*m的网格图，每个格子可以是蓝色或者白色
已知任意两个蓝色格子之间最多只有一条简单路径，Q次询问(x1,y1,x2,y2)这个矩形内部有多少个蓝色格子的连通块
$$\begin{gathered} n,m\le 10^3 \\ Q\le 10^5 \end{gathered}$$

Solution

---

一开始没看到加粗的那句话。。最大的困难在于读题
这句话告诉我们，把蓝色格子看成点的话原图中的蓝色格子形成了若干棵树，那么我们二位前缀和记录边然后减一减就可以了

Code

---

#include <stdio.h>
#include <string.h>
#include <algorithm>
#define rep(i,st,ed) for (int i=st;i<=ed;++i)

const int N=2005;

int w[N][N],u[N][N],l[N][N];

char str[N];

int read() {
	int x=0,v=1; char ch=getchar();
	for (;ch<'0'||ch>'9';v=(ch=='-')?(-1):(v),ch=getchar());
	for (;ch<='9'&&ch>='0';x=x*10+ch-'0',ch=getchar());
	return x*v;
}

int getu(int a,int b,int c,int d) {
	return u[c][d]-u[a-1][d]-u[c][b-1]+u[a-1][b-1];
}

int getl(int a,int b,int c,int d) {
	return l[c][d]-l[a-1][d]-l[c][b-1]+l[a-1][b-1];
}

int sum(int a,int b,int c,int d) {
	return w[c][d]-w[a-1][d]-w[c][b-1]+w[a-1][b-1];
}

int main(void) {
	freopen("data.in","r",stdin);
	int n=read(),m=read(),T=read();
	rep(i,1,n) {
		scanf("%s",str+1);
		rep(j,1,m) {
			w[i][j]=str[j]-'0';
			if (w[i][j]==1&&w[i-1][j]==1) ++u[i][j];
			if (w[i][j]==1&&w[i][j-1]==1) ++l[i][j];
			u[i][j]=u[i-1][j]+u[i][j-1]-u[i-1][j-1]+u[i][j];
			l[i][j]=l[i-1][j]+l[i][j-1]-l[i-1][j-1]+l[i][j];
		}
	}
	rep(i,1,n) rep(j,1,m) w[i][j]+=w[i-1][j]+w[i][j-1]-w[i-1][j-1];
	for (;T--;) {
		int a=read(),b=read(),c=read(),d=read();
		printf("%d\n", sum(a,b,c,d)-getu(a+1,b,c,d)-getl(a,b+1,c,d));
	}
	return 0;
}