HDU 6055 Regular polygon(计算几何+思维)——2017 Multi-University Training Contest
来源:互联网 发布:淘宝加盟可靠吗 编辑:程序博客网 时间:2024/05/16 10:01
传送门
Regular polygon
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1187 Accepted Submission(s): 461
Problem Description
On a two-dimensional plane, give you n integer points. Your task is to figure out how many different regular polygon these points can make.
Input
The input file consists of several test cases. Each case the first line is a numbers N (N <= 500). The next N lines ,each line contain two number Xi and Yi(-100 <= xi,yi <= 100), means the points’ position.(the data assures no two points share the same position.)
Output
For each case, output a number means how many different regular polygon these points can make.
Sample Input
4
0 0
0 1
1 0
1 1
6
0 0
0 1
1 0
1 1
2 0
2 1
Sample Output
1
2
题目大意:
给了
解题思路:
首先因为是整数点,所以只能构成正四边形也就是正方形,首先想过暴力,复杂度
首先我们按照
有一个坑点:就是将负数点转化为正数的时候,经过计算:要加上>300 的数。
代码:
#include <bits/stdc++.h>using namespace std;const int MAXN = 605;int mp[MAXN][MAXN];struct Point{ int x, y;}p[MAXN];int cmp(Point A, Point B){ if(A.x == B.x) return A.y < B.y; return A.x < B.x;}int main(){ ///freopen("in.txt","r", stdin); int n; while(~scanf("%d", &n)){ memset(mp, 0, sizeof(mp)); for(int i=0; i<n; i++) { int x, y; scanf("%d%d", &x, &y); p[i].x = (x + 300); p[i].y = (y + 300); mp[p[i].x][p[i].y] = 1; } sort(p, p+n, cmp); int sum = 0; for(int i=0; i<n; i++){ for(int j=i+1; j<n; j++){ int dx = p[i].x - p[j].x; int dy = p[j].y - p[i].y; if(mp[p[i].x+dy][p[i].y+dx] && mp[p[j].x+dy][p[j].y+dx]) sum++; } } printf("%d\n",sum/2); } return 0;}
阅读全文
0 0
- HDU 6055 Regular polygon(计算几何+思维)——2017 Multi-University Training Contest
- HDU 6127 Hard challenge(思维+计算几何)——2017 Multi-University Training Contest
- hdu 6055 Regular polygon(判断正方形)(2017 Multi-University Training Contest
- HDU_【2017 Multi-University Training Contest 2】——1011 Regular polygon
- HDU6055 Regular polygon 2017 Multi-University Training Contest
- hdu 6055 简单计算几何,查找点的四种办法 2017 Multi-University Training Contest
- 计算几何(组合计数+向量排序)——Eureka ( HDU 5738 ) ( 2016 Multi-University Training Contest 2 1005 )
- hdu 5733 tetrahedron(2016 Multi-University Training Contest 1——几何公式题)
- hdu 5733 tetrahedron(2016 Multi-University Training Contest 1计算几何)
- 2016 Multi-University Training Contest 1 1011(HDU 5733 计算几何)
- 2016 Multi-University Training Contest 1-1011---HDU 5733 tetrahedron(计算几何)
- hdu 5742 It's All In The Mind(2016 Multi-University Training Contest 2——思维题)
- hdu 5744 Keep On Movin(2016 Multi-University Training Contest 2——回文串,思维题)
- HDU 5860 Death Sequence (递推 + 约瑟夫环 + 思维)——2016 Multi-University Training Contest 10
- (HDU 5738) <计算几何 ,在n个点中找所有共线的集合> 2016 Multi-University Training Contest 2
- HDU 3902 Swordsman 2011 Multi-University Training Contest 7 - Host by ECNU 计算几何
- hdu 4962 Closed Paths 计算几何 2014 Multi-University Training Contest 9-1003
- HDU 5733 tetrahedron (2016 Multi-University Training Contest 1 计算几何)
- 基于 VirtualEnv 安装 TensorFlow on Mac OS X
- oracle产生随机数字、随机字符串、随机日期
- 左右滑动浏览图片
- 1.5学习数据结构的意义
- Java中Date日期格式的各种转换
- HDU 6055 Regular polygon(计算几何+思维)——2017 Multi-University Training Contest
- Python数据类型之间的转换(三)
- SAP货物移动BAPI BAPI_GOODSMVT_CREATE(WMS TO SAP)
- 性能测试Jmeter
- uva 11987 Almost Union-Find (并查集删点,转移)
- MySQL与Oracle数据类型对应关系(表格形式)
- ContextLoaderListener容器初始化
- 中介者模式
- 帝国CMS列表内容list.var,首页嵌入PHP代码