poj Squares 2002 (STL&&枚举+转换) 统计正方形的个数

原创 2015年11月19日 11:34:08
Squares
Time Limit: 3500MS   Memory Limit: 65536K
Total Submissions: 17886   Accepted: 6845

Description

A square is a 4-sided polygon whose sides have equal length and adjacent sides form 90-degree angles. It is also a polygon such that rotating about its centre by 90 degrees gives the same polygon. It is not the only polygon with the latter property, however, as a regular octagon also has this property.

So we all know what a square looks like, but can we find all possible squares that can be formed from a set of stars in a night sky? To make the problem easier, we will assume that the night sky is a 2-dimensional plane, and each star is specified by its x and y coordinates.

Input

The input consists of a number of test cases. Each test case starts with the integer n (1 <= n <= 1000) indicating the number of points to follow. Each of the next n lines specify the x and y coordinates (two integers) of each point. You may assume that the points are distinct and the magnitudes of the coordinates are less than 20000. The input is terminated when n = 0.

Output

For each test case, print on a line the number of squares one can form from the given stars

Sample Input

4
1 0
0 1
1 1
0 0
9
0 0
1 0
2 0
0 2
1 2
2 2
0 1
1 1
2 1
4
-2 5
3 7
0 0
5 2
0

Sample Output

1
6
1
//题意:
给你n个点,让你求出这n个点能组成几个正方形。
参考博客:http://m.blog.csdn.net/blog/u013480600/39500427
 
#include<stdio.h>
#include<string.h>
#include<algorithm>
#define N 1010
using namespace std;
struct zz
{
	int x;
	int y;
	friend bool operator<(zz a,zz b)
	{
		return a.x<b.x||(a.x==b.x&&a.y<b.y);
	}
}q[N<<1],tmp;
int main()
{
	int n,i,j,k;
	while(scanf("%d",&n),n)
	{
		for(i=0;i<n;i++)
			scanf("%d%d",&q[i].x,&q[i].y);
		sort(q,q+n);
		int cnt=0;
		for(i=0;i<n;i++)
		{
			for(j=i+1;j<n;j++)
			{
				tmp.x=q[i].x+q[i].y-q[j].y;
				tmp.y=q[i].y+q[j].x-q[i].x;
				if(!binary_search(q,q+n,tmp))
					continue;
				tmp.x=q[j].x+q[i].y-q[j].y;
				tmp.y=q[j].y+q[j].x-q[i].x;
				if(!binary_search(q,q+n,tmp))
					continue;
				cnt++;
			}
		}
		printf("%d\n",cnt/2);
	}
	return 0;
}

POJ 2002 Squares(计算几何 找正方形 hash枚举)

Squares Time Limit: 3500MS   Memory Limit: 65536K Total Submissions: 13964   Accep...

POJ2002---Squares(找正方形的个数)

Squares Time Limit: 3500MS   Memory Limit: 65536K Total Submissions: 17569   Accep...

poj2002--Squares(n个点求正方形个数)

Squares Time Limit: 3500MS   Memory Limit: 65536K Total Submissions: 16615   Accep...

Poj 2002 Squares (正方形个数 Hash)

题意:平面内一堆点,问其中有多少个正方形,相同的四个点,不同顺序构成的正方形视为同一正方形。 思路:设两个点的坐标为(a1,a2),(b1,b2),若构成正方形,另两个点的坐标是:(a1-(a2-b2...

poj 2002 Squares(枚举+点hash)

Squares Time Limit: 3500MS   Memory Limit: 65536K Total Submissions: 12372   Accep...
  • fp_hzq
  • fp_hzq
  • 2012年09月14日 16:30
  • 554

【POJ】2002 - Squares(暴力枚举 & 双关键字二分查找)

题目链接:点击打开题目 Squares Time Limit: 3500MS   Memory Limit: 65536K Total Submissions: 19211   Acc...
  • wyg1997
  • wyg1997
  • 2016年10月31日 20:46
  • 184

poj 2002 Squares (哈希+正方形已知相邻两点求另外两点的坐标)

poj 2002 Squares (哈希+正方形已知相邻两点求另外两点的坐标)

poj 2002 正方形个数 (对点的hash 存储)

poj 2002 Squares题意: 给定N个点,求出这些点一共可以构成多少个正方形。 分析: 若正方形为ABCD,A坐标为(x1, y1),B坐标为(x2, y2),则很容易可以推出C和D...

POJ2002 正方形的个数(二维点的哈希)

给定N个点,求出这些点一共可以构成多少个正方形。 若正方形为ABCD,A坐标为(x1, y1),B坐标为(x2, y2),则很容易可以推出C和D的坐标。对于特定的A和B坐标,C和D可以在线段AB的左...

poj 2002 Squares 【stl二分】

764K 1375MS#include #include #include using namespace std; const int maxn=10000; paira[maxn]; int m...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:poj Squares 2002 (STL&&枚举+转换) 统计正方形的个数
举报原因:
原因补充:

(最多只允许输入30个字)