3349 hash 链表

http://acm.pku.edu.cn/JudgeOnline/problem?id=3349

题意为判断是后有相同的雪花，雪花的花瓣可能是顺时针，或逆时针描述，故对hash值相同的还要进行比较，相同则推出，否则把该雪花加到该hash对应的链表上

 

code:(时间复杂度还是太高了)

 

1. #include<iostream>
2. using namespace std;
4. struct node
5. {
6.     int flag;
7.     int a[6];
8.     node *next;
10. }hash[150006];
12. int fac(int tt[]);
13. int comp(int a[],int b[]);
14. int main()
15. {
17.     freopen("in.txt","r",stdin);
18.     int t[6];
19.     int n,i,sum,j;
20.     int flag(1);
23.     for( i=0; i<100001; i++)
24.     {
25.         hash[i].flag=0;
26.         hash[i].next=NULL;
27.     }
28.     cin>>n;
29.     for( i=0; i<n; i++)
30.     {
31.         for( j=0; j<6; j++)
32.             scanf("%d",&t[j]);
33.         sum=fac(t);
34.         if(!hash[sum].flag)
35.         {   
36.             hash[sum].flag=1;
37.             memcpy(hash[sum].a,t,sizeof(t));
38.             
39.         }   
40.         else
41.         {   
42.             node temp=hash[sum];
43.             node temp1;
44.             temp1.flag=0;
45.             temp1.next=NULL;
46.             memcpy(temp1.a,t,sizeof(t));
47.             while(1)
48.             {
49.                 if(comp(temp.a,t))
50.                 {
51.                     cout<<"Twin snowflakes found."<<endl;
52.                     exit(-1);
53.                 }
54.                 if(temp.next==NULL)
55.                     break;
56.                 temp=*temp.next;
57.             }
58.             temp.next=&temp1;
59.         }
60.     }
61.     cout<<"No two snowflakes are alike."<<endl;
62.             
63.             
67.     return 0;
68. }
70. int fac(int tt[])
71. {
73.     __int64 sum(0);
74.     int i;
75.     for( i=0; i<6; i++)
76.         sum+=tt[i];
79.     return sum%149997;
80. }
81. int comp(int a[],int b[])
82. {
83.     int i,j,t;
84.     for( i=0; i<6; i++)
85.         if(a[i]==b[0])
86.         {
87.             if(i==6)
88.                 return 0;
89.             for( j=1; j<6; j++)//往前
90.             {
91.                 if((i+j)>=6)
92.                     t=(i+j)-6;
93.                 else
94.                     t=i+j;
95.                 if(a[t]==b[j])
96.                     continue;
97.                 else
98.                     break;
99.             }
100.             if(j==6)
101.                 return 1;
102.             for( j=1; j<6; j++)//往后
103.             {
104.                 if(i-j<0)
105.                     t=i-j+6;
106.                 else
107.                     t=i-j;
108.                 if(a[t]==b[j])
109.                     continue;
110.                 else
111.                     break;
112.             }
113.             if(j==6)
114.                 return 1;
115.         }
116.     
118.     return 0;
122. }