75分求助,WA#3
查看原帖
75分求助,WA#3
254389
_短笛无腔_楼主2021/8/21 15:09
#include<bits/stdc++.h>
using namespace std;
long long m,n,sx1[2002],sx2[2002],sy1[2002],sy2[2002],s1[2002],s2[2002];
int main(){
	cin>>m>>n;
	for(long long i=1;i<=m;i++)cin>>sx1[i]>>sy1[i]>>sx2[i]>>sy2[i];
	for(long long i=1;i<=n;i++){
		cin>>s1[i]>>s2[i];
		bool flag=true;
		long long sum=1,latest;
		for(long long j=1;j<=m;j++){
			if((s1[i]>=sx1[j]&&s1[i]<=sx2[j])&&(s2[i]>=sy1[j]&&s2[i]<=sy2[j])){
				if(flag){
					flag=false;
					cout<<"YES";
				}
				else{
					sum++;
					latest=j;
				}
			}
		}
		if(!flag){
			cout<<' '<<sum<<' '<<latest<<endl;
		}
		if(flag)cout<<"NO"<<endl;
	}
	return 0;
}

rt

2021/8/21 15:09
加载中...