雪花POJ3349

雪花POJ3349

思路

题干在这：POJ3349
数据比较大，就先用Hash离散一下，再逐项比对。两个雪花我是暴力比对的，还能用最小表示法优化。本题数据多，注意cin会超时，使用scanf。

ac代码

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#define MAX 100010
#define P 99991
using namespace std;
int snow[MAX][6] = { 0 };
int head[MAX] = { 0 };
int nextp[MAX] = { 0 };
int tot = 1;
int Hash(int a[]) {
	int add = 0, mul = 1;
	for (int i = 0; i < 6; i++) {
		add = (add + a[i]) % P;
		mul = long long(mul) * long long(a[i] % P) % P;
	}
	return (add + mul) % P;
}
bool equal(int a[], int snow[]) {
	for (int i = 0; i < 6; i++) {
		bool same = 1;
		for (int j = 0; j < 6; j++) {
			if (a[j] != snow[(i + j) % 6]) {
				same = 0;
				break;
			}
		}
		if (same)
			return 1;
		same = 1;
		for (int j = 0; j < 6; j++) {
			if (a[j] != snow[(6 + i - j) % 6]) {
				same = 0;
				break;
			}
		}
		if (same)
			return 1;
	}
	return 0;
}
int insert(int a[]) {
	int val = Hash(a);
	for (int i = head[val]; i != 0; i = nextp[i]) {
		if (equal(a, snow[i]))
			return 1;
	}
	memcpy(snow[tot], a, 6 * sizeof(int));
	nextp[tot] = head[val];
	head[val] = tot;
	tot++;
	return 0;
}
int main() {
	int n;
	cin >> n;
	int a[6];
	for (int i = 1; i <= n; i++) {
		scanf_s("%d%d%d%d%d%d", a, a + 1, a + 2, a + 3, a + 4, a + 5);
		if (insert(a)) {
			puts("Twin snowflakes found.");
			return 0;
		}
	}
	puts("No two snowflakes are alike.");
	return 0;
}