POJ 2002 Squares -- Hash

Squares

Time Limit: 3500MS		Memory Limit: 65536K
Total Submissions: 15891		Accepted: 6016

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

Rocky Mountain 2004

题意：给n（n<=1000）个点，计算其中所有点能够组成的不同正方形的个数，正方形位置或大小不同即为 不同。

做法：因为n<1000，所以枚举两个点，将其作为正方形的两个对角顶点，用数学知识算出来另两个对角顶点，判断另两个是否在点集里即可。判断的时候为了高效查找，可以用hash，将二维点映射成一维，便于判断，可以用邻接表存hash的结果。

具体见代码：

#include<iostream>
#include<algorithm>
using namespace std;
const int mod=1313131;
struct node{
	int x,y;
}p[1005];
struct edge{
	int u,v,next;
}e[mod];
int head[mod],ind;
void init()
{
	memset(head,-1,sizeof(head));
	ind = 0;
}
int My_hash(int x,int y)
{
	return (x*x+y*y)%mod;
}
void add(int x,int y)
{
	int key=My_hash(x,y);
	e[ind].u = x;
	e[ind].v = y;
	e[ind].next = head[key];
	head[key] = ind++;
}
bool Search(int x,int y)
{
	int key = My_hash(x,y);
	for (int i = head[key]; i !=-1 ; i=e[i].next)
	{
		if(e[i].u == x && e[i].v == y)
			return true;
	}
	return false;
}
int solve(int n)
{
	int ans = 0;
	for (int i = 0; i < n; i++)
	{
		for (int j = i+1; j < n; j++)
		{
	        int x1 = p[i].x - (p[i].y - p[j].y);  
                int y1 = p[i].y + (p[i].x - p[j].x);  
                int x2 = p[j].x - (p[i].y - p[j].y);  
                int y2 = p[j].y + (p[i].x - p[j].x);  
                if(Search(x1,y1) && Search(x2,y2)) ans++;  
		}
	}
	for(int i=0;i<n;i++)  
        {  
            for(int j=i+1;j<n;j++)  
            {  
            int x1 = p[i].x + (p[i].y - p[j].y);  
            int y1 = p[i].y - (p[i].x - p[j].x);  
            int x2 = p[j].x + (p[i].y - p[j].y);  
            int y2 = p[j].y - (p[i].x - p[j].x);  
            if(Search(x1,y1) && Search(x2,y2)) ans++;  
            }  
        }  
	ans /= 4;
	return ans;
}
int main()
{
	int n;
	while(cin>>n,n)
	{
		init();
		for (int i = 0; i < n; i++)
		{
			cin>>p[i].x>>p[i].y;
			add(p[i].x,p[i].y);
		}
		cout<<solve(n)<<endl;
	}
	return 0;
}