hdoj 5480 Conturbatio (思维)

Conturbatio

Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 975    Accepted Submission(s): 439

Problem Description

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≤x1≤x2≤n,1≤y1≤y2≤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


   
   

    
    

     
     Hint
    
    
Huge input, scanf recommended.
   
   
   
    
   
   

<span style="color:#006600;">如果矩形所在的每一行或者每一列都有车攻击，就能把矩形推倒、
技巧：前缀和 </span>


  
  

 

/*
如果矩形所在的每一行或者每一列都有车攻击，就能把矩形推倒、
**前缀和** 
*/
#include<cstdio>
#include<cstring>
int main()
{
	int t,n,m,k,q;
	int x,y,x1,y1,x2,y2;
	int lx[100010],ly[100010];
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d%d%d%d",&n,&m,&k,&q);
		memset(lx,0,sizeof(lx));
		memset(ly,0,sizeof(ly));
		for(int i=0;i<k;i++)
		{
			scanf("%d%d",&x,&y);
			lx[x]=1;
			ly[y]=1;
		 } 
		 for(int i=1;i<=n;i++)
		 {
		 	lx[i]+=lx[i-1];
		 	ly[i]+=ly[i-1];
		 }
		 for(int i=0;i<q;i++)
		 {
		 	scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
		 	if(lx[x2]-lx[x1-1]==(x2-x1+1)||(ly[y2]-ly[y1-1])==(y2-y1+1))
		 		printf("Yes\n");
			else
				printf("No\n"); 
		 }
	}
	return 0;
}