zoukankan      html  css  js  c++  java
  • HDU

    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.

    InputThe first line contains a integer TT indicating the total number of test cases. Each test case begins with an integer nn, denoting the number of stars in the sky. Following nn lines, each contains 22 integers xi,yixi,yi, describe the coordinates of nn stars.

    1T3001≤T≤300
    3n1003≤n≤100
    10000xi,yi10000−10000≤xi,yi≤10000
    All coordinates are distinct.
    OutputFor 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
    思路:多边形中,n个点对任意其他点的距离,总共有n/2种不同的长度,利用这个规则,可直接求。
    #include <cstdio>
    #include <iostream>
    #include <string>
    #include <cstring>
    #include <cmath>
    #include <algorithm>
    #include <queue>
    #include <map>
    #include <vector>
    using namespace std;
    
    int t, n, x[100+8], y[100+8];
    map<int, int>len;
    
    int main()
    {
        scanf("%d", &t);
        while(t--)
        {
            scanf("%d", &n);
            len.clear();//一定要记得清空,不然size会改变,插入的时候也会继续往后插
            int ii = 0;
            for(int i = 0; i<n; i++)
                scanf("%d%d", &x[i], &y[i]);
            for(int i = 0; i<n; i++)
                for(int j = i+1; j<n; j++)
                    len[(x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j])] = 1;
            if(len.size() == n/2)printf("YES
    ");
            else printf("NO
    ");
        }
        return 0;
    }
  • 相关阅读:
    Mysql开启日志
    amfphp传递负数的bug
    linux /var/spool/clientmqueue 目录占大量空间
    WinXP SSH连接不上虚拟机的解决方法
    批量数据替换助手V1.0版发布
    也谈反射的应用场景
    反射+特性打造简洁的AJAX调用
    文本处理之利器正则表达式闪亮登场
    关于缩略图的生成与访问策略的一些经验分享
    装饰模式个人的一些理解
  • 原文地址:https://www.cnblogs.com/RootVount/p/10908440.html
Copyright © 2011-2022 走看看