POJ 2526 Center of symmetry 几何 背



#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
//英语       看博友分析      抄博友程序      几何       背
struct nod{
	double x;
	double y;
}da[20010]; 
bool cmp(nod a, nod b)
{
	if(a.x==b.x)
	{
		return a.y<b.y;
	}
	return a.x<b.x;
}
int main()
{
	int T;
	cin>>T;
	while(T--)
	{
		int n;
		cin>>n;
		for(int i=1;i<=n;i++)
		{
			cin>>da[i].x>>da[i].y;
		}
		sort(da+1,da+n+1,cmp);
		/*
		for(int i=1;i<=n;i++)
		{
			cout<<da[i].x<<" "<<da[i].y<<endl;
		}*/		
		double xx=da[1].x+da[n].x;
		double yy=da[1].y+da[n].y;
		//cout<<xx<<" "<<yy<<endl;
		int flag=0;
		for(int i=2,j=n-1;i<n;i++,j--)//i<j wa    i<=n-1 ac  可能给出奇数个点 
		{
			double tx=da[i].x+da[j].x;
			double ty=da[i].y+da[j].y;
			//cout<<tx<<" "<<ty<<endl;
			if(tx==xx && ty==yy)
			{
				
			}else
			{
				flag=1;
				break;
			}
		}
		/*
        for(int i = 2; i <= n/2; ++i) {//n ac    n/2 wa
            double x = (da[i].x+da[n-i+1].x);
            double y = (da[i].y+da[n-i+1].y);
            if(x != xx || y != yy) {
                flag = 1;
                //printf("%d\n", i);
                break;
            }
        }*/		
		if(flag==0)
		{
			//printf("V.I.P. should stay at (%.1f,%.1f).\n",xx/2.0,yy/2.0);//抄博友程序 
			printf("yes\n");
		}else
		{
			//printf("This is a dangerous situation!\n");
			printf("no\n");
		}
	}
	return 0;
}