HDU5533 Dancing Stars on Me 数学国庆咸鱼

最新推荐文章于 2017-03-22 21:04:25 发布

原创最新推荐文章于 2017-03-22 21:04:25 发布 · 370 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

------------解题报告------------- 同时被 2 个专栏收录

208 篇文章

订阅专栏

-------数学／物理题-----

21 篇文章

订阅专栏

本文介绍了一种通过编程自动捕捉天空中星星形成的正多边形瞬间的方法。使用距离算法和比较逻辑，程序能判断星星是否构成特定几何形状并记录下来。

Dancing Stars on Me

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

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

Sample Output

  
   NO
YES
NO

Source

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

给你很多个点，问你这些点能不能构成正多变形

每个点找离它最近的店作为变长，最后判断有没有n－1条相等的边

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <set>
#include <map>
#include <vector>
#include <queue>
#include <cmath>
using namespace std;

const int maxn=1010;
const long long INF=1e11;
const double eps=1e-8;
pair<double,double> save[maxn];
double bian[maxn][maxn];

double distance(int i,int j){
    return sqrt((save[i].first-save[j].first)*(save[i].first-save[j].first)+(save[i].second-save[j].second)*(save[i].second-save[j].second));
}

int main(){
    int t,n,i,j;
    scanf("%d",&t);
    while(t--){
        double minn = INF;
        scanf("%d",&n);
        for(i = 1; i <= n; i++){
            scanf("%lf%lf",&save[i].first,&save[i].second);
        }
        for(i = 1; i <= n; i++){
            for(j = i+1; j <= n; j++){
                bian[i][j] = distance(i,j);
                minn = min(minn,bian[i][j]);
            }
        }
        int num = 0;
        for(i = 1; i <= n; i++){
            for(j = i+1; j <= n; j++){
                if(minn == bian[i][j]){
                    num++;
                }
            }
        }
        if(num == n)
            printf("YES\n");
        else
            printf("NO\n");
    }
    return 0;
}