Codeforce 611C New Year and Domino（DP+容斥）

C. New Year and Domino

They say “years are like dominoes, tumbling one after the other”. But would a year fit into a grid? I don’t think so.

Limak is a little polar bear who loves to play. He has recently got a rectangular grid with h rows and w columns. Each cell is a square, either empty (denoted by ‘.’) or forbidden (denoted by ‘#’). Rows are numbered 1 through h from top to bottom. Columns are numbered 1 through w from left to right.　
　　Also, Limak has a single domino. He wants to put it somewhere in a grid. A domino will occupy exactly two adjacent cells, located either in one row or in one column. Both adjacent cells must be empty and must be inside a grid.
　　Limak needs more fun and thus he is going to consider some queries. In each query he chooses some rectangle and wonders, how many way are there to put a single domino inside of the chosen rectangle?

Input
The first line of the input contains two integers h and w (1 ≤ h, w ≤ 500) – the number of rows and the number of columns, respectively.
　　The next h lines describe a grid. Each line contains a string of the length w. Each character is either ‘.’ or ‘#’ — denoting an empty or forbidden cell, respectively.
　　The next line contains a single integer q (1 ≤ q ≤ 100 000) — the number of queries.
　　Each of the next q lines contains four integers r1i, c1i, r2i, c2i (1 ≤ r1i ≤ r2i ≤ h, 1 ≤ c1i ≤ c2i ≤ w) — the i-th query. Numbers r1i and c1i denote the row and the column (respectively) of the upper left cell of the rectangle. Numbers r2i and c2i denote the row and the column (respectively) of the bottom right cell of the rectangle.

Output
Print q integers, i-th should be equal to the number of ways to put a single domino inside the i-th rectangle.

Examples
inputCopy
5 8
…#…#
.#…
##.#…
##…#.##
…
4
1 1 2 3
4 1 4 1
1 2 4 5
2 5 5 8
outputCopy
4
0
10
15
inputCopy
7 39
…
.###…###…#…###…###…###…#…###.
…#…#.#…#…#…#…#.#…#…#…
.###…#.#…#…###…###…#.#…#…###.
.#…#.#…#…#…#…#.#…#…#.#.
.###…###…#…###…###…###…#…###.
…
6
1 1 3 20
2 10 6 30
2 10 7 30
2 2 7 7
1 7 7 7
1 8 7 8
outputCopy
53
89
120
23
0
2
Note
A red frame below corresponds to the first query of the first sample. A domino can be placed in 4 possible ways.

题目思路：这道题主要提前处理好图上的到达某点与原点之间可放置木棍数，沿着二维扩展。通过容斥定理（一直这么用，没想到这是容斥）求两点数量，细节处理是每个点都向前伸展，然后再标记那些如果当前为边界，那么向前伸展的个数应减去。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define N 501

using namespace std;
int h,w,dp[N][N],f1[N][N],f2[N][N];
char a[N][N];
int main()
{
    cin>>h>>w;
    for(int i=1;i<=h;i++)scanf("%s",a[i]+1);
    for(int i=1;i<=h;i++){
        for(int j=1;j<=w;j++){
            if(a[i][j]=='.'){
                if(a[i][j+1]=='.') dp[i][j]++,f1[i][j]=1;
                if(a[i+1][j]=='.') dp[i][j]++,f2[i][j]=1;
            }
            dp[i][j]+=dp[i-1][j]+dp[i][j-1]-dp[i-1][j-1];
        }
    }
    int r1,r2,c1,c2,t;
    cin>>t;
    for(int i=1;i<=t;i++){
        scanf("%d%d%d%d",&r1,&c1,&r2,&c2);
        int sum=dp[r2][c2]-dp[r2][c1-1]-dp[r1-1][c2]+dp[r1-1][c1-1];
        for(int i=r1;i<=r2;i++) if(f1[i][c2]) sum--;
        for(int i=c1;i<=c2;i++) if(f2[r2][i]) sum--;
        printf("%d\n",sum);
    }
}