POJ 2002 哈希

#include <iostream>
#include <cstdio>
#include<cstring>
using namespace std;
const int prime = 100007;
int Hash[prime + 5];
int Next[prime + 5];
int n, X1, X2, Y1, Y2;
struct Point
{
	int x, y;
} P[1005];
void insert(int x, int y, int index)
{
	int h = (x * x + y * y) % prime;
	int u = Hash[h];
	while (u)
	{
		u = Next[u];
	}
	Next[index] = Hash[h];
	Hash[h] = index;
}

bool find(int x, int y)
{
	int h = (x * x + y * y) % prime;
	int u = Hash[h];
	while (u)
	{
		if (P[u].x == x && P[u].y == y)return true;
		u = Next[u];
	}
	return false;
}
int main(int argc, char const *argv[])
{
	while (~scanf("%d", &n) && n)
	{
		memset(Hash, 0, sizeof(Hash));
		memset(Next, 0, sizeof(Next));
		for (int i = 1; i <= n; i++)
		{
			scanf("%d%d", &P[i].x, &P[i].y);
			insert(P[i].x, P[i].y, i);
		}
		int ans = 0;
		for (int i = 1; i < n; i++)
			for (int j = i + 1; j <= n; j++)
			{
				X1 = P[i].x + (P[i].y - P[j].y);
				Y1 = P[i].y - (P[i].x - P[j].x);
				X2 = P[j].x + (P[i].y - P[j].y);
				Y2 = P[j].y - (P[i].x - P[j].x);
				if (find(X1, Y1) && find(X2, Y2))ans++;
				X1 = P[i].x - (P[i].y - P[j].y);
				Y1 = P[i].y + (P[i].x - P[j].x);
				X2 = P[j].x - (P[i].y - P[j].y);
				Y2 = P[j].y + (P[i].x - P[j].x);
				if (find(X1, Y1) && find(X2, Y2))ans++;
			}
		printf("%d\n", ans / 4);
	}
	return 0;
}

先枚举两个点，通过数学公式得到另外2个点，使得这四个点能够成正方形。然后检查散点集中是否存在计算出来的那两个点，若存在，说明有一个正方形。

恩，n*n*logn的时间复杂度不行，必须用哈希，果然过了。