poj 2002 Squares Hash

原创 2015年07月08日 22:52:30
Squares
Time Limit: 3500MS   Memory Limit: 65536K
Total Submissions: 17327   Accepted: 6575

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

Source


问1000个点能构成多少个正方形
可以枚举两个顶点,再判断另外两个点上有没有点,已知正方形的两个顶点就能判断出另外的两个顶点。hash就行辣

#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <string.h>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
using namespace std;
#define Max 1010
#define Maxn 20010
#define MOD 20007
int xn[Maxn],ynn[Maxn];
struct pt
{
	int x,y;
	int next;
}p[Max];
int hashtable[Maxn];
int n;
int stx,sty;
int gethash(int a,int b)
{
	int temp=a*a+b*b;
	return temp%MOD;
}
void inserthash(int a,int b,int cnt)
{
	int h=gethash(a,b);
	p[cnt].next=hashtable[h];
	hashtable[h]=cnt;
}
bool searchhash()
{
	int h=gethash(stx,sty);
	int next=hashtable[h];
	while(next!=-1)
	{
		if(p[next].x==stx&&p[next].y==sty) return true;
		next=p[next].next;
	}
	return false;
}
int main()
{
	while(cin>>n)
	{
		memset(hashtable,-1,sizeof(hashtable));
		if(n==0) break;
		int tx,ty;
		for(int i=1;i<=n;i++)
		{
			cin>>tx>>ty;
			inserthash(tx,ty,i);
			p[i].x=tx;
			p[i].y=ty;
		}
		int res=0;
		for(int i=1;i<=n;i++)
		{
			for(int j=1;j<=n;j++)
			{
				int flag=0;
				if(p[i].x==p[j].x&&p[i].y==p[j].y) continue;
				int xx=p[i].x-p[j].x;
				int yy=p[i].y-p[j].y;
				stx=p[i].x+yy;
				sty=p[i].y-xx;
				if(searchhash()) flag=1;
				if(flag)
				{
					stx=p[j].x+yy;
					sty=p[j].y-xx;
					if(searchhash()) {res++;}
				}
				flag=0;
				stx=p[i].x-yy;
				sty=p[i].y+xx;
				if(searchhash()) flag=1;
				if(flag)
				{
					stx=p[j].x-yy;
					sty=p[j].y+xx;
					if(searchhash()) {res++;}
				}
			}
		}
		cout<<res/8<<endl;
	}
	return 0;
}






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

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

poj2002——Squares(hash)

DescriptionA square is a 4-sided polygon whose sides have equal length and adjacent sides form 90-de...

POJ 2002 Squares hash+链地址法处理冲突

Squares Description A square is a 4-sided polygon whose sides have equal length and adjacent sides ...

POJ2002 Squares(hash)

给出N个点,问这些点能组成多少个正方形,N小于1000,显然的,思路是,先确定正方形的两个顶点,然后在点集中查找另外两个顶点 至于查找,有两种做法,一个是二分,一个是hash,很明显,has...

POJ 2002 Squares -- Hash

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

poj 2002 Squares(枚举+点hash)

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

poj 2002 Squares(hash)

意义给你n个点的坐标,问你可以围成多少个正方形。思路 可以得出 temp.x = p[i].x + (p[i].y - p[j].y); temp.y = p[i].y + (p[j].x - ...

POJ 2002 Squares 计算集合 点的hash

题目大意:给出平面上的n个点,问能组成多少个正方形。 思路:一开始看时间3秒半,就想用set水过,然而失败了。没办法手写hash吧。观察坐标的范围, CODE: #inclu...

POJ 2002 Squares hash/计算几何

题意: 给出一些坐标点,求出能构成的正方形的个数。 题解:此题也可用二分查找。 #include using namespace std; #define prime 9973 struct...
  • Tsaid
  • Tsaid
  • 2011年07月30日 11:26
  • 452

POJ 2002 Squares (Hash)

题意:给你二维平面点集 让你找出其中能组成多少个正方形 思路:对每一个点进行哈希 枚举两个点做为正方形的一条边 然后再求另外两个点 看看原点集中是否存在这两个点 由于枚举的是每条边 则一个正方形会被...
  • s_h_r
  • s_h_r
  • 2015年06月16日 13:10
  • 207
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:poj 2002 Squares Hash
举报原因:
原因补充:

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