Q - Conturbatio （前缀和）

There are many rook on a chessboard, a rook can attack the row and column it belongs, including its own place.

There are also many queries, each query gives a rectangle on the chess board, and asks whether every grid in the rectangle will be attacked by any rook?
Input
The first line of the input is a integer T, meaning that there are T test cases.

Every test cases begin with four integers n,m,K,Q.
K is the number of Rook, Q is the number of queries.

Then K lines follow, each contain two integers x,y describing the coordinate of Rook.

Then Q lines follow, each contain four integers x1,y1,x2,y2 describing the left-down and right-up coordinates of query.

1≤n,m,K,Q≤100,000.

1≤x≤n,1≤y≤m.

1≤x₁≤x₂≤n,1≤y₁≤y₂≤m.
Output
For every query output “Yes” or “No” as mentioned above.

Sample Input
2
2 2 1 2
1 1
1 1 1 2
2 1 2 2
2 2 2 1
1 1
1 2
2 1 2 2

Sample Output
Yes
No
Yes

题目大意：
车能攻击直线上的棋子，在一个n*m的棋盘上，给出k个车的位置，然后给出q组测试数据，每组给出矩阵的左下角坐标x₁、y₁,和右上角坐标x₂、y₂。求是否矩阵内的格子都可以被车攻击到

解题思路：
矩阵内的格子都可以被车攻击到的必要条件是每一行都有车或者每一列都有车，可以根据前缀的思想解这道题。注意输入用scanf,cin会超时。

完整代码：

#include<iostream>
using namespace std;
int main()
{
	int t,n,m,k,q;
	cin>>t;
	while(t--){
		int row[100010]={0},col[100010]={0};
		cin>>n>>m>>k>>q;
		while(k--){
			int x,y;
			scanf("%d%d",&x,&y);
			row[y]=1;
			col[x]=1;
		}
		for(int i=1;i<=n;i++){	//求分段前缀和 
			if(col[i]){
				col[i]+=col[i-1];
			}
		}
		for(int i=1;i<=m;i++){
			if(row[i]){
				row[i]+=row[i-1];
			}
		}
		while(q--){
			int x1,y1,x2,y2;
			scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
			if(x2-x1+1<=col[x2]||y2-y1+1<=row[y2]){		//判断必要条件是否成立 
				cout<<"Yes"<<endl;
			}else{
				cout<<"No"<<endl;
			}
		}
	}
}