Snowflake Snow Snowflakes（POJ3349）（哈希）

本文链接：https://blog.csdn.net/weixin_43438700/article/details/98067209

本文介绍了一种用于检测雪片是否完全相同的算法。通过分析雪片的六臂长度，该算法能够判断是否存在两个可能完全一样的雪片。输入包含多个雪片的数据，每个雪片由六个长度值表示。算法会检查所有雪片，如果找到一对具有相同对应臂长的雪片，则认为可能存在完全相同的雪片。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Snowflake Snow Snowflakes
Time Limit: 4000MS Memory Limit: 65536K
Total Submissions: 53447 Accepted: 13800
Description

You may have heard that no two snowflakes are alike. Your task is to write a program to determine whether this is really true. Your program will read information about a collection of snowflakes, and search for a pair that may be identical. Each snowflake has six arms. For each snowflake, your program will be provided with a measurement of the length of each of the six arms. Any pair of snowflakes which have the same lengths of corresponding arms should be flagged by your program as possibly identical.

Input

The first line of input will contain a single integer n, 0 < n ≤ 100000, the number of snowflakes to follow. This will be followed by n lines, each describing a snowflake. Each snowflake will be described by a line containing six integers (each integer is at least 0 and less than 10000000), the lengths of the arms of the snow ake. The lengths of the arms will be given in order around the snowflake (either clockwise or counterclockwise), but they may begin with any of the six arms. For example, the same snowflake could be described as 1 2 3 4 5 6 or 4 3 2 1 6 5.

Output

If all of the snowflakes are distinct, your program should print the message:
No two snowflakes are alike.
If there is a pair of possibly identical snow akes, your program should print the message:
Twin snowflakes found.

Sample Input

2
1 2 3 4 5 6
4 3 2 1 6 5
Sample Output

Twin snowflakes found

#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
const int SIZE=100010;
int snow[SIZE][6],head[SIZE],tot,n,p=99991;
int nextt[SIZE];
int H(int *x){
    int sum=0,vv=1;
    for(int i=0;i<6;i++){
        sum=(sum+x[i])%p;
        vv=((long long)vv*x[i])%p;
    }
    return (sum+vv)%p;

}
bool equal(int *a,int *b){
    for(int i=0;i<6;i++)
        for(int j=0;j<6;j++)
    {
            bool eq=1;
            for(int k=0;k<6;k++)
                if(a[(i+k)%6]!=b[(j+k)%6])eq=0;
            if(eq) return 1;
            eq=1;
            for(int k=0;k<6;k++)
                if(a[(i+k)%6]!=b[(j-k+6)%6])eq=0;
            if(eq) return 1;

    }
    return 0;
}
bool insert(int *x){
    int val=H(x);
    for(int i=head[val];i;i=nextt[i]){
        if(equal(snow[i],x))return 1;

    }
    ++tot;
    memcpy(snow[tot],x,6*sizeof(int));
    nextt[tot]=head[val];
    head[val]=tot;
    return 0;
}
int a[SIZE][6];
int main(){
    scanf("%d",&n);
    tot=0;

    for(int i=0;i<n;i++)
        for(int j=0;j<6;j++)
            scanf("%d",&a[i][j]);
    for(int i=0;i<n;i++){
        if(insert(a[i])){
            cout<<"Twin snowflakes found."<<endl;
            return 0;
        }

        }
    cout<<"No two snowflakes are alike."<<endl;

    return 0;
}