POJ 3349：Snowflake Snow Snowflakes（数的Hash）

http://poj.org/problem?id=3349

Snowflake Snow Snowflakes

Time Limit: 4000MS		Memory Limit: 65536K
Total Submissions: 37609		Accepted: 9878

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<cstdio>
 #include<algorithm>
 #include <cstring>
 #include <iostream>
 using namespace std;
 #define MOD 14997
 struct node
 {
     int len[];
 }snow,f[][];
 int Hash[];

 /*
 第一道Hash
 判断两个雪花是否相同：
 分别是顺时针旋转和逆时针旋转，只要有一次是满足条件的就可以当成是一样的
 一开始MOD取了999983，结果MLE了，后来看了一下别人的才取了14997
 */
 bool check(node a,node b)
 {
     int i,j,k;
     bool flag;
     //顺时针旋转判断
     for(i=;i<;i++){
         flag=true;
         for(j=i,k=;k<;k++,j=(j+)%){
             if(a.len[j]!=b.len[k]){
                  flag=false;break;
             }
         }
         if(flag) return ;
     }
     //逆时针旋转判断
     for(i=;i<;i++){
         flag=true;
         for(j=i,k=;k<;k++,j=(j+)%){
             if(a.len[j]!=b.len[k]){
                  flag=false;break;
             }
         }
         if(flag) return ;
     }
     return ;
 }

 int main()
 {
     int n;
     int now;
     scanf("%d",&n);
     //只有一组样例就不初始化了
     bool flag=false;
     for(int i=;i<n;i++){
         now=;
         for(int j=;j<;j++){
             scanf("%d",&snow.len[j]);
             now+=snow.len[j]%MOD;
         }
         if(flag) continue;
         now%=MOD;
         if(Hash[now]>){
             for(int j=;j<=Hash[now];j++){
                 if(check(snow,f[now][j])){
                     flag=true;break;
                 }
             }
         }
         Hash[now]++;
         f[now][Hash[now]]=snow;
     }
     if(flag) printf("Twin snowflakes found.\n");
     else printf("No two snowflakes are alike.\n");
     return ;
 }

2016-06-04