UVA 10328Coin Toss

Coin Toss

Time Limit:3000MS     Memory Limit:0KB     64bit IO Format:%lld & %llu

Submit  Status  Practice  UVA 10328  uDebug

Description

先挂在这，回头来补，没太看懂.....题在图片里，右上角...

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn = 100010;
int T,n,m,Q,R,a,b,sx,sy,ex,ey;
int x[maxn],y[maxn];
int xx[maxn],yy[maxn];

int main(){
	scanf("%d",&T);
	while(T--){
		memset(xx,0,sizeof(xx));	memset(yy,0,sizeof(yy));
		scanf("%d%d%d%d",&n,&m,&R,&Q);
		for(int i=0; i<R; ++i){
			scanf("%d%d",&a,&b);
			xx[a] = 1;	yy[b] = 1;
		}
		
		for(int i = 2; i <= n; ++ i)
        	xx[i] += xx[i-1];
   		for(int j = 2; j<= m; ++ j)
        	yy[j] += yy[j-1];
		
		
		for(int t=0; t<Q; ++t){
			scanf("%d%d%d%d",&sx,&sy,&ex,&ey);
			if(xx[ex]-xx[sx-1] == ex - sx + 1 || yy[ey]-yy[sy-1] == ey - sy + 1)
				printf("Yes\n");
			else
				printf("No\n");
		}	
	}
	
	return 0;
}