HDU_5533_Dancing Stars on Me

Dancing Stars on Me

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)
Total Submission(s): 2002    Accepted Submission(s): 1168

Problem Description

The sky was brushed clean by the wind and the stars were cold in a black sky. What a wonderful night. You observed that, sometimes the stars can form a regular polygon in the sky if we connect them properly. You want to record these moments by your smart camera. Of course, you cannot stay awake all night for capturing. So you decide to write a program running on the smart camera to check whether the stars can form a regular polygon and capture these moments automatically.

Formally, a regular polygon is a convex polygon whose angles are all equal and all its sides have the same length. The area of a regular polygon must be nonzero. We say the stars can form a regular polygon if they are exactly the vertices of some regular polygon. To simplify the problem, we project the sky to a two-dimensional plane here, and you just need to check whether the stars can form a regular polygon in this plane.

 

Input

The first line contains a integer T indicating the total number of test cases. Each test case begins with an integer n, denoting the number of stars in the sky. Following n lines, each contains 2 integers xi,yi, describe the coordinates of n stars.

1≤T≤300
3≤n≤100
−10000≤xi,yi≤10000
All coordinates are distinct.

 

Output

For each test case, please output "`YES`" if the stars can form a regular polygon. Otherwise, output "`NO`" (both without quotes).

 

Sample Input

3
3
0 0
1 1
1 0
4
0 0
0 1
1 0
1 1
5
0 0
0 1
0 2
2 2
2 0

 

Sample Output

NO
YES
NO

 

Source

2015ACM/ICPC亚洲区长春站-重现赛（感谢东北师大）

 

• 给出n个二维坐标点判断能够构成正多边形
• 考虑正多边形顶点在同一个圆上
• 任意挑3个点找外心，得到一组圆心和半径
• 先对于每个点检测和圆心的距离
• 然后如果距离都相等那就判断每两个相邻点的距离也应该相等
• n的范围不大n^2复杂度判相邻即可

 #include <iostream>
 #include <string>
 #include <cstdio>
 #include <cstring>
 #include <algorithm>
 #include <climits>
 #include <cmath>
 #include <vector>
 #include <queue>
 #include <stack>
 #include <set>
 #include <map>
 using namespace std;
 typedef long long           LL ;
 typedef unsigned long long ULL ;
 const int    maxn = 1e2 +    ;
 const int    inf  = 0x3f3f3f3f ;
 const int    npos = -         ;
 const int    mod  = 1e9 +     ;
 const int    mxx  =  +     ;
 const double eps  = 1e-       ;
 const double PI   = acos(-1.0) ;

 struct node{
     double x, y;
     node(double a=0LL, double b=0LL){
         x=a; y=b;
     }
 };
 node vex[maxn], center;
 node CircumCenter(node a, node b, node c){
     double a1=b.x-a.x, b1=b.y-a.y, c1=(a1*a1+b1*b1)/;
     double a2=c.x-a.x, b2=c.y-a.y, c2=(a2*a2+b2*b2)/;
     double d=a1*b2-a2*b1;
     return node(a.x+(c1*b2-c2*b1)/d,a.y+(a1*c2-a2*c1)/d);
 }
 double dis2(node a, node b){
     return pow(a.x-b.x,)+pow(a.y-b.y,);
 }
 bool oneLine(node a, node b, node c){
     return ((b.y-a.y)/(b.x-a.x))==((c.y-a.y)/(c.x-a.x));
 }
 int T, n, ans;
 double R, D[maxn][maxn];
 int main(){
     // freopen("in.txt","r",stdin);
     // freopen("out.txt","w",stdout);
     while(~scanf("%d",&T)){
         while(T--){
             ans=;
             scanf("%d",&n);
             for(int i=;i<=n;i++)
                 scanf("%lf %lf",&vex[i].x,&vex[i].y);

             if(oneLine(vex[],vex[],vex[]))
                 ans=;

             if(ans){
                 center=CircumCenter(vex[],vex[],vex[]);
                 R=dis2(center,vex[]);
                 for(int i=;i<=n;i++)
                     if(dis2(vex[i],center)!=R){
                         ans=; break;
                     }
             }

             if(ans){
                 for(int i=;i<=n;i++){
                     D[i][i]=0.0;
                     for(int j=i+;j<=n;j++)
                         D[i][j]=D[j][i]=dis2(vex[i],vex[j]);
                     sort(D[i]+,D[i]++n);
                 }
                 for(int i=;i<=n;i++)
                     if(!(D[i][]==D[i][] && D[i][]==D[i-][])){
                         ans=; break;
                     }
             }
             puts(ans?"YES":"NO");
         }
     }
     return ;
 }