Nuske vs Phantom Thnook（前缀和+联通性）

Nuske vs Phantom Thnook（前缀和+联通性）

题目描述

Nuske has a grid with N rows and M columns of squares. The rows are numbered 1 through N from top to bottom, and the columns are numbered 1 through M from left to right. Each square in the grid is painted in either blue or white. If S _i,j is 1, the square at the i-th row and j-th column is blue; if S _i,j is 0, the square is white. For every pair of two blue square a and b, there is at most one path that starts from a, repeatedly proceeds to an adjacent (side by side) blue square and finally reaches b, without traversing the same square more than once.

Phantom Thnook, Nuske’s eternal rival, gives Q queries to Nuske. The i-th query consists of four integers x_i,1, y_i,1, x_i,2 and y_i,2 and asks him the following: when the rectangular region of the grid bounded by (and including) the x_i,1-th row, x_i,2-th row, y_i,1-th column and y_i,2-th column is cut out, how many connected components consisting of blue squares there are in the region?

Process all the queries.

Constraints
1≤N,M≤2000
1≤Q≤200000
S_i,j is either 0 or 1.
S_i,j satisfies the condition explained in the statement.
1≤x_i,1≤x_i,2≤N(1≤i≤Q)
1≤y_i,1≤y_i,2≤M(1≤i≤Q)

输入

The input is given from Standard Input in the following format:

N M Q
S_1,1..S_1,M
:
S_N,1..S_N,M
x_1,1 y_i,1 x_i,2 y_i,2
:
x_Q,1 y_Q,1 x_Q,2 y_Q,2

输出

For each query, print the number of the connected components consisting of blue squares in the region.

样例输入 Copy

3 4 4
1101
0110
1101
1 1 3 4
1 1 3 1
2 2 3 4
1 2 2 4

样例输出 Copy

3
2
2
2

提示

In the first query, the whole grid is specified. There are three components consisting of blue squares, and thus 3 should be printed.
In the second query, the region within the red frame is specified. There are two components consisting of blue squares, and thus 2 should be printed. Note that squares that belong to the same component in the original grid may belong to different components.

思路：因为一个点走到另一个点最多只有一条路，所以一个联通的块，n个点，n-1条边。

只需前缀求点数和边数。用点数减去边数。边数通过求x,y方向上面的边。求x，时，y是不会变的。同理求y也是。

#pragma GCC optimize(3 , "Ofast" , "inline")

#include <bits/stdc++.h>

#define rep(i , a , b) for(register ll i=(a);i<=(b);i++)
#define rop(i , a , b) for(register ll i=(a);i<(b);i++)
#define per(i , a , b) for(register ll i=(a);i>=(b);i--)
#define por(i , a , b) for(register ll i=(a);i>(b);i--)

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll , ll> pi;
template<class T>
inline void read (T &x) {
    x = 0;
    int sign = 1;
    char c = getchar ();
    while (c < '0' || c > '9') {
        if ( c == '-' ) sign = - 1;
        c = getchar ();
    }
    while (c >= '0' && c <= '9') {
        x = x * 10 + c - '0';
        c = getchar ();
    }
    x = x * sign;
}
const int maxn = 2e3 + 10;
const int inf = int (1e9);
const ll INF = ll(1e18);

int n,m,q;
char e[maxn][maxn];
int s1[maxn][maxn];
int s2[maxn][maxn];
int s3[maxn][maxn];

int main () {
    read(n);read(m);read(q);
    rep(i,1,n) {
        scanf("%s",e[i]+1);
    }
    rep(i,1,n) {
        rep(j,1,m) {
            if(e[i][j]=='1') s1[i][j]=1;
            s1[i][j]+=s1[i-1][j]+s1[i][j-1]-s1[i-1][j-1];
        }
    }
    rep(i,1,n) {
        rep(j,1,m) {
            if(e[i][j]=='1'&&e[i-1][j]=='1') s2[i][j]=1;
            else s2[i][j]=0;
            if(e[i][j]=='1'&&e[i][j-1]=='1') s3[i][j]=1;
            else s3[i][j]=0;
            s2[i][j]+=s2[i-1][j]+s2[i][j-1]-s2[i-1][j-1];
            s3[i][j]+=s3[i-1][j]+s3[i][j-1]-s3[i-1][j-1];
        }
    }
    rep(i,1,q) {
        int x1,y1,x2,y2;
        read(x1);read(y1);read(x2);read(y2);
        int ans1 = s1[x2][y2]-s1[x2][y1-1]-s1[x1-1][y2]+s1[x1-1][y1-1];
        int ans2 = s2[x2][y2]-s2[x2][y1-1]-s2[x1][y2]+s2[x1][y1-1];
        int ans3 = s3[x2][y2]-s3[x2][y1]-s3[x1-1][y2]+s3[x1-1][y1];
        printf("%d\n",ans1-ans2-ans3);
    }
    return 0;
}