Codeforces A. Orchestra

 Orchestra

Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit  Status  Practice  CodeForces 635A

Description

Paul is at the orchestra. The string section is arranged in an r × c rectangular grid and is filled with violinists with the exception of nviolists. Paul really likes violas, so he would like to take a picture including at least k of them. Paul can take a picture of any axis-parallel rectangle in the orchestra. Count the number of possible pictures that Paul can take.

Two pictures are considered to be different if the coordinates of corresponding rectangles are different.

Input

The first line of input contains four space-separated integers r, c, n, k (1 ≤ r, c, n ≤ 10, 1 ≤ k ≤ n) — the number of rows and columns of the string section, the total number of violas, and the minimum number of violas Paul would like in his photograph, respectively.

The next n lines each contain two integers x_i and y_i (1 ≤ x_i ≤ r, 1 ≤ y_i ≤ c): the position of the i-th viola. It is guaranteed that no location appears more than once in the input.

Output

Print a single integer — the number of photographs Paul can take which include at least k violas.

Sample Input

Input

2 2 1 1
1 2

Output

4

Input

3 2 3 3
1 1
3 1
2 2

Output

1

Input

3 2 3 2
1 1
3 1
2 2

Output

4

 Note

We will use '*' to denote violinists and '#' to denote violists.

In the first sample, the orchestra looks as follows 

*#
**

Paul can take a photograph of just the viola, the 1 × 2 column containing the viola, the 2 × 1 row containing the viola, or the entire string section, for 4 pictures total.
In the second sample, the orchestra looks as follows 

#*
*#
#*

Paul must take a photograph of the entire section.
In the third sample, the orchestra looks the same as in the second sample.

解体思路:首先求出每一个i*j矩形的含有#的个数,用二维数组存储,注意计算时会有重叠部分,需要去处,接着只要暴力判断,遍历所有两对点,判断该两对点组成的矩形所含#数,通过画图可以知道是d[x][y]-d[x][j-1]-(d[i-1][y]-d[i-1][j-1])

代码如下：

#include<stdio.h>
#include<string.h>
int d[15][15];
int main(){
	int r,c,n,k,i,j,sum,x,y;
	int a,b;
	while(scanf("%d%d%d%d",&r,&c,&n,&k)!=EOF){
		memset(d,0,sizeof(d));
		sum=0;
		for(i=1;i<=n;i++){
			scanf("%d%d",&a,&b);
			d[a][b]=1;
		}
		if(k>r*c){
			printf("0\n");
		}
        else if(k==r*c){
        	printf("1\n");
        }
        else{
        	for(i=1;i<=r;i++){
        		for(j=1;j<=c;j++){
        		d[i][j]+=d[i][j-1];	
        		d[i][j]+=d[i-1][j];
        		d[i][j]-=d[i-1][j-1];
				}
        	}//计算了每一个i*j矩形的含有#的个数 
           for(i=1;i<=r;i++){
           	for(j=1;j<=c;j++){
           		for(x=i;x<=r;x++){
           			for(y=j;y<=c;y++){
           				int uu=d[x][y]-d[x][j-1]-(d[i-1][y]-d[i-1][j-1]);//两两对点组成的矩形所含有的#数，需要用到切割
			            if(uu>=k){
			            	sum++;
			            } 
           			}
           		}
           	}
           }
            	printf("%d\n",sum);
        }
	}
	return 0;
}