HDU 5533(计算几何+暴力)
来源:互联网 发布:linux如何安装win7 编辑:程序博客网 时间:2024/05/19 09:17
问题描述:
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 nstars.
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
330 01 11 040 00 11 01 150 00 10 22 22 0Sample Output
NOYESNO题目题意:题目给我们n个点,问这n点能否构成一个正n变形。
题目分析:我们暴力去找这个n个点之间最短的距离(这是边长),然后去暴力遍历每个点能否找到与其他点之间的距离为最短距离,每个点都有,注意重复。通过画图我发现,如果找到一条边等于最短距离,我们把它的俩个端点的标记++,那么它是正多形,最后它的每个点的标记为4.
代码如下:
#include<iostream>#include<cstdio>#include<cmath>#include<cstring>#define ll long longusing namespace std;const int maxn=105;struct note{ ll x,y;}point[maxn];int vis[maxn];ll get_dis(int a,int b)//距离的平方,不影响{ return (point[a].x-point[b].x)*(point[a].x-point[b].x)+(point[a].y-point[b].y)*(point[a].y-point[b].y);}int n;bool check(){ for (int i=1;i<=n;i++) { if (vis[i]!=4)//不为4肯定不是 return false; } return true;}int main(){ int t; scanf("%d",&t); while (t--) { scanf("%d",&n); memset (point,0,sizeof (point)); for (int i=1;i<=n;i++) scanf("%lld%lld",&point[i].x,&point[i].y); ll minlen=100000000000; for (int i=1;i<=n;i++) { for (int j=1;j<=n;j++) { if (i==j) continue; ll len=get_dis(i,j); minlen=min(minlen,len); } } ll ans=0; memset(vis,0,sizeof (vis)); for (int i=1;i<=n;i++) { for (int j=1;j<=n;j++) { if (i==j) continue; if (get_dis(i,j)==minlen) { vis[i]++; vis[j]++; } } } if (check()) printf("YES\n"); else printf("NO\n"); } return 0;}
- HDU 5533(计算几何+暴力)
- hdu 3952 计算几何 暴力
- HDU 4445(计算几何+暴力)
- hdu 6055 计算几何+暴力
- HDU 5533 Dancing Stars on Me 计算几何瞎暴力
- hdu3902计算几何。。暴力
- hdu 1077 Catching Fish 计算几何+暴力枚举
- HDU 4454 Stealing a Cake(暴力计算几何)
- HDU 3156 Repair Depots DLX 计算几何 二分 暴力
- HDU 5533 简单计算几何
- FZU2148计算几何,暴力搜索
- HDU5533-计算几何|暴力-G
- hdu 5839 三维几何 (暴力
- hdu 5128 The E-pang Palace(计算几何:暴力枚举)
- hdu 5128 The E-pang Palace (计算几何+暴力枚举)
- hdu 5128 The E-pang Palace(计算几何,暴力枚举)
- 2014广州亚洲现场赛/hdu 5128 The E-pang Palace(计算几何:暴力枚举)
- hdu 3952 计算几何
- 批处理中for循环的自增自减问题
- 【安全牛学习笔记】AIRRACK-NG(二)
- bzoj 3111: [Zjoi2013]蚂蚁寻路(DP)
- Redis 集合(Set)介绍与基本操作
- codeforces 852I Dating(DFS序,LCA,莫队)
- HDU 5533(计算几何+暴力)
- 第十二章 与Spring集成(三) Shiro权限注解
- C++学习札记
- Unity_设计模式_状态模式_05
- HDU4866-Shooting
- RabbitMQ原理
- 顺序表应用7:最大子段和之分治递归法
- Windows平台异常处理 开发中何时利用异常处理模块
- maven项目环境搭建