BestCoder Round #57 (div.2) HDU5480 Conturbatio 前缀和

Conturbatio

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

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.
   
   
   
    
  
  

 

Source

BestCoder Round #57 (div.2)

出题人：可以发现如果一个矩阵被全部攻击到，很显然要么是因为它的每一行都有车，

或者每一列都有车。所以只需要记录一下哪些行和哪些列有车，对于每个询问只需要

做一个前缀和就可以知道答案了。

#include
   
   
    
    
#include
    
    
     
     
#include
     
     
      
      
using namespace std;
const int N=100005;
int xx[N],yy[N];
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        memset(xx,0,sizeof(xx));
        memset(yy,0,sizeof(yy));
        int n,m,k,q,i,x,y,x1,y1,maxn=0,mixn=N;
        scanf("%d%d%d%d",&n,&m,&k,&q);
        for(i=0; i