60,救
查看原帖
60,救
1481109
zhangshuran楼主2024/12/24 18:13
#include<bits/stdc++.h>
using namespace std;
#define int long long
long long n,k,t;
struct as{
	long long x,y;
}m[1005],q[1005],j[1005];
long long ans;
bool flag[1005];
signed main(){
	cin>>n>>k>>t;
	for(long long i=1;i<=n;i++){
		cin>>m[i].x>>m[i].y;
	}
	for(long long i=1;i<=k;i++){
		cin>>q[i].x>>q[i].y;
		for(long long l=1;l<=n;l++){
			if(q[i].x==m[l].x&&q[i].y==m[l].y){
				flag[l]=1;
				break;
			}
		}
	}
	for(long long i=1;i<=t;i++){
		cin>>j[i].x>>j[i].y;
		double maxx=INT_MIN*1.0;
		int f;
		for(long long l=1;l<=n;l++){
			double s=sqrt((j[i].x-j[i].y)*(j[i].x-j[i].y)+(m[l].x-m[l].y)*(m[l].x-m[l].y));
			if(s>maxx){
				maxx=s;
				f=l;
			}
		}
		if(flag[f]){
			ans++;
		}
	}
	cout<<ans;
	return 0;
}
2024/12/24 18:13
加载中...