poj-2002 枚举&哈希

给定N个点，求出这些点一共可以构成多少个正方形。

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

可列方程：

可以得出  ;知道两点求出其余两点
x3 = node[i].x + (node[i].y - node[j].y); 
y3 = node[i].y + (node[j].x - node[i].x); 
和 
x4 = node[j].x + (node[i].y - node[j].y); 

y4 = node[j].y + (node[j].x - node[i].x); 

或者

 

x3 = node[i].x - (node[i].y - node[j].y);

y3 = node[i].y + (node[i].x - node[j].x);

x4 = node[j].x - (node[i].y - node[j].y);

y4 = node[j].y + (node[i].x - node[j].x);

然后枚举两点就行

利用哈希表；

代码：

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>
using namespace std;
const int mul = 27;
const int mod = 5013;
int nexts[5025], last[5025];
struct point {
	int x;
	int y;
}node[5025];
bool M_Z(int va, int x, int y)
{
	int pre = last[va];
	while (pre != -1)
	{
		if (node[pre].x == x && node[pre].y == y)
		{
			return true;
		}
		pre = nexts[pre];
	}
	return false;
}
int main()
{
	int n;
	int x, y, pre;
	while (~scanf("%d", &n) && n != 0)
	{
		int ans = 0;
		memset(nexts, -1, sizeof(nexts));
		memset(last, -1, sizeof(last));
		for (int i = 0; i < n; i++)
		{
			scanf("%d%d", &x, &y);
			pre = ((x*mul + y) % mod + mod) % mod;
			node[i].x = x;
			node[i].y = y;
			nexts[i] = last[pre];
			last[pre] = i;
		}
		for(int i=0;i<n;i++)
			for (int j = i + 1; j < n; j++)
			{
				int x3, y3, x4, y4;
				x3 = node[i].x + (node[i].y - node[j].y);
				y3 = node[i].y - (node[i].x - node[j].x);
				x4 = node[j].x + (node[i].y - node[j].y);
				y4 = node[j].y - (node[i].x - node[j].x);
				if (M_Z((((x3*mul + y3) % mod + mod) % mod), x3, y3)&& M_Z((((x4*mul + y4) % mod + mod) % mod), x4, y4))
				{
					ans++;
				}
				x3 = node[i].x - (node[i].y - node[j].y);
				y3 = node[i].y + (node[i].x - node[j].x);
				x4 = node[j].x - (node[i].y - node[j].y);
				y4 = node[j].y + (node[i].x - node[j].x);
				if (M_Z((((x3*mul + y3) % mod + mod) % mod), x3, y3) && M_Z((((x4*mul + y4) % mod + mod) % mod), x4, y4))
				{
					ans++;
				}
			}
		cout << ans/4 << endl;
	}
	return 0;
}