HDU 5533 Dancing Stars on Me (暴力模拟+思维)
来源:互联网 发布:华东理工大学知乎事件 编辑:程序博客网 时间:2024/05/08 06:22
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.
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.
All coordinates are distinct.
330 01 11 040 00 11 01 150 00 10 22 22 0
NOYESNO
题解:
题意:
给你n个点,问你是否可以组成一个正n变形。。。
思路:
本来是个挺好的题,懒得看英文搜题意的时候不小心瞄了一眼题解。。然后这题就被无情得ac了(捂脸),暴力遍历所有边,因为多边形的边是最短的,所以只要找到最短的边,看所有边里面长度与最短边相同的边是否有n个就好了
代码:
#include<iostream>#include<cstring>#include<stdio.h>#include<math.h>#include<string>#include<stdio.h>#include<queue>#include<stack>#include<map>#include<vector>#include<deque>#include<algorithm>#define ll long long#define INF 100861111#define M (t[k].l+t[k].r)/2#define lson k*2#define rson k*2+1using namespace std;struct node{ ll x,y;}a[105];ll b[5005];int main(){ int test,i,j,n,ans; scanf("%d",&test); while(test--) { scanf("%d",&n); for(i=0;i<n;i++) { scanf("%lld%lld",&a[i].x,&a[i].y); } ans=0; for(i=0;i<n;i++) { for(j=i+1;j<n;j++) { b[ans]=(a[i].x-a[j].x)*(a[i].x-a[j].x)+(a[i].y-a[j].y)*(a[i].y-a[j].y); ans++; } } sort(b,b+ans); int num=1; for(i=1;b[i]==b[0]&&num!=n;i++) num++; if(num==n) printf("YES\n"); else printf("NO\n"); }}
阅读全文
0 0
- HDU 5533 Dancing Stars on Me (暴力模拟+思维)
- HDU 5533 Dancing Stars on Me 计算几何瞎暴力
- hdu 5533 Dancing Stars on Me
- hdu 5533 Dancing Stars on Me
- HDU 5533 Dancing Stars on Me
- hdu 5533 Dancing Stars on Me
- HDU 5533:Dancing Stars on Me【数学】
- HDU 5533 Dancing Stars on Me
- HDU 5533 Dancing Stars on Me [数学]
- HDU 5533 Dancing Stars on Me
- HDU-5533 Dancing stars on me
- hdu 5533 Dancing Stars on Me(水)
- HDU 5533 Dancing Stars on Me(凸包)
- HDU 5533 Dancing Stars on Me(数学+水题)
- HDU 5533 Dancing Stars on Me (凸包)
- HDU Dancing Stars on Me
- Dancing Stars on Me HDU
- HDU杭电5533 Dancing Stars on Me
- 2017 ACM-ICPC 亚洲区(乌鲁木齐赛区)网络赛 D. Hack Portals(区间DP)
- 网络与信息安全研究方向
- 《Linux操作系统编译构建指南》
- 出现错误:ERROR: no such package '@protobuf//src/google/protobuf': Could not find handler for bind rule /
- .std::string转utf8字符串
- HDU 5533 Dancing Stars on Me (暴力模拟+思维)
- bzoj3672 [ NOI2014 ] -- 树上CDQ分治 + 斜率优化DP
- Math类
- 分布式文件系统HDFS
- 网络设备吞吐量
- python--leetcode657. Judge Route Circle
- 报错:“The content of element type "package" must match "(result-types?,interceptors?,default-intercept
- BufferedReader和BufferedWriter读写中文乱码的解决方法
- RecyclerView详解