题目
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=6850
思路
可以看这个大佬的博客,写的很清晰 代码也很简短->大佬博客
代码
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<cctype>
#include<ctime>
#include<iostream>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<set>
#include<vector>
#include<iomanip>
#include<list>
#include<bitset>
#include<sstream>
#include<fstream>
#include<complex>
#include<algorithm>
#if __cplusplus >= 201103L
#include <unordered_map>
#include <unordered_set>
#endif
#define int long long
using namespace std;
const int INF = 0x3f3f3f3f;
struct sut{
int a,b,len;
}aa[4000010];
int x[2020],y[2010];
bool vis[2010];
bool cmp(sut a,sut b){
return a.len<b.len;
}
signed main(){
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int t;
cin>>t;
while(t--){
int n;
cin>>n;
memset(vis,0,sizeof vis);
for(int i=1;i<=n;i++){
cin>>x[i]>>y[i];
}
int cnt=0;
for(int i=1;i<=n;i++){
for(int j=i+1;j<=n;j++){
cnt++;
aa[cnt]=sut{i,j,(x[i] - x[j])*(x[i] - x[j]) + (y[i] - y[j])*(y[i] - y[j])};
}
}
sort(aa+1,aa+cnt+1,cmp);
for(int i=cnt;i>=1;i--){
if(!vis[aa[i].a]&&!vis[aa[i].b]){
vis[aa[i].a]=1;
vis[aa[i].b]=1;
}
}
if(vis[1]) cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
return 0;
}