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.
题目大意就是给定多个雪花,让你判读是否有重复一样的雪花,运用hash表的解决思路就是,判断六边长度和想等的雪花中有没有一样的雪花
一.总结
main.cpp
POJ 3349
Created by 张嘉韬 on 16/7/27.
Copyright © 2016年 张嘉韬. All rights reserved.
//
//#include <iostream>
//#include <cstring>
//#include <cstdio>
//#include <map>
//using namespace std;
//struct snow
//{
// int a[7];
// bool operator <(const snow &b) const
// {
// return a[0]<b.a[0];
// }
//};
//map <snow,int> vis;
//int form(int *temp)
//{
// snow p1,p2;
//
cout<<&p1<<endl;
cout<<&p2<<endl;
//
// p1.a[0]=p2.a[0]=-1;
// int min=99999999,minnum=0,counter=0,flag=0;
// for(int i=1;i<=6;i++)
// if(temp[i]<min) {min=temp[i],minnum=i;}
// cout<<minnum<<endl;
// for(int i=minnum;i<=6;i++) p1.a[++counter]=temp[i];
// for(int i=1;i<minnum;i++) p1.a[++counter]=temp[i];
// counter=0;
// for(int i=minnum;i>=1;i--) p2.a[++counter]=temp[i];
// for(int i=6;i>minnum;i--) p2.a[++counter]=temp[i];
//
// for(int i=1;i<=6;i++) cout<<p1.a[i]<<" ";
// cout<<"("<<vis[p1]<<")";cout<<endl;
// for(int i=1;i<=6;i++) cout<<p2.a[i]<<" ";
// cout<<"("<<vis[p2]<<")";cout<<endl;
//
// cout<<"("<<vis[p1]<<")";
// cout<<"("<<vis[p2]<<")";
// if(vis[p1]==1) flag=1;
// else vis[p1]=1;
//
// cout<<"("<<vis[p1]<<")";
// cout<<"("<<vis[p2]<<")";
// if(vis[p2]==1) flag=1;
// else vis[p2]=1;
// cout<<flag<<endl;
// return flag;
//}
//int main(int argc, const char * argv[]) {
// freopen("/Users/zhangjiatao/Documents/暑期训练/input.txt","r",stdin);
// int n;
while(scanf("%d",&n)==1)
{
// cin>>n;
// int flag=1;
// vis.clear();
// for(int i=1;i<=n;i++)
// {
// int temp[7];
// for(int j=1;j<=6;j++) cin>>temp[j];
// if(form(temp)==1) {flag=0;cout<<"Twin snowflakes found."<<endl;break;}
// }
// if(flag==1) cout<<"No two snowflakes are alike."<<endl;
}
// return 0;
//}
//
//
//
//
//#include <cstdio>
//#include <cstring>
//#include <algorithm>
//using namespace std;
//const int K = 14997;
//
//struct Node
//{
// int floor[7];
//};
//int m[15000];
//Node snow[15000][100];
//bool solve(Node x,Node y) //比较
//{
// sort(x.floor,x.floor+6);
// sort(y.floor,y.floor+6);
// for(int i=0;i<6;i++)
// {
// if(x.floor[i]!=y.floor[i])
// return false;
// }
// return true;
//}
//int main()
//{
// freopen("/Users/zhangjiatao/Documents/暑期训练/input.txt","r",stdin);
// int n;
// while(~scanf("%d",&n))
// {
// memset(m,0,sizeof(m));
// int ok=0;
// for(int i=0; i<n; i++)
// {
// int sum=0;
// Node pp;
// for(int j=0; j<6; j++)
// {
// scanf("%d",&pp.floor[j]);
// sum=(sum+pp.floor[j])%14997;
// }
// if(ok==0)
// {
// for(int j=0; j<m[sum]; j++) //按键值查找
// {
// if(solve(pp,snow[sum][j])){
// ok=1;break;
// }
// }
// snow[sum][m[sum]]=pp;
// m[sum]++;
// }
// }
// if(ok)
// printf("Twin snowflakes found.\n");
// else
// printf("No two snowflakes are alike.\n");
// }
// return 0;
//}
//
//#include <iostream>
//#include <cstdio>
//#include <algorithm>
//using namespace std;
//
//const int N = 1200010;
//const int H = 1200007;
//
//struct Node
//{
// int num[6];
// int next;
//};
//Node node[N];
//int cur;
//int hashTable[H];
//
//void initHash()
//{
// cur = 0;
// for (int i = 0; i < H; ++i) hashTable[i] = -1;
//}
//
//unsigned int getHash(int* num)
//{
// unsigned int hash = 0;
// for (int i = 0; i < 6; ++i)
// {
// hash += num[i];
// }
// return hash % H;
//}
//
//bool cmp(int* num1, int* num2)
//{
// for (int i = 0; i < 6; ++i)
// {
// if (num1[i] != num2[i]) return false;
// }
// return true;
//}
//
//void insertHash(int* num, unsigned int h)
//{
// for (int i = 0; i < 6; ++i) node[cur].num[i] = num[i];
// node[cur].next = hashTable[h];
// hashTable[h] = cur;
// ++cur;
//}
//
//bool searchHash(int* num)
//{
// unsigned h = getHash(num);
// int next = hashTable[h];
// while (next != -1)
// {
// if (cmp(num, node[next].num)) return true;
// next = node[next].next;
// }
// insertHash(num, h);
// return false;
//}
//
//int main()
//{
// int num[2][12];
// int n;
// bool twin = false;
// initHash();
// scanf("%d", &n);
// while (n--)
// {
// for (int i = 0; i < 6; ++i)
// {
// scanf("%d", &num[0][i]);
// num[0][i + 6] = num[0][i];
// }
// if (twin) continue;
// for (int i = 0; i < 6; ++i)
// {
// num[1][i + 6] = num[1][i] = num[0][5 - i];
// }
// for (int i = 0; i < 6; ++i)
// {
// if (searchHash(num[0] + i) || searchHash(num[1] + i))
// {
// twin = true;
// break;
// }
// }
// }
// if (twin) printf("Twin snowflakes found.\n");
// else printf("No two snowflakes are alike.\n");
// return 0;
//}
//
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
const int N = 1200010;
const int H = 1200007;
int cur;
struct Node
{
int num[6];
int next;
}nodes[N];
int hashtable[H];
void inithash()
{
cur=0;
for(int i=0;i<H;i++) hashtable[i]=-1;
}
int gethash(int *num)
{
int r=0;
for(int i=0;i<6;i++) r+=num[i];
return r%H;
}
int cmp(int *num1,int *num2)
{
for(int i=0;i<6;i++)
{
if(num1[i]!=num2[i]) return 0;
}
return 1;
}
void inserthash(int *num,int h)
{
cur++;
for(int i=0;i<6;i++) nodes[cur].num[i]=num[i];
nodes[cur].next=hashtable[h];
hashtable[h]=cur;
}
int hashsearch(int *num)
{
int h=gethash(num);
int next=hashtable[h];
while(next!=-1)
{
if(cmp(num,nodes[next].num)==1)return 1;
next=nodes[next].next;
}
inserthash(num,h);
return 0;
}
int main()
{
//freopen("/Users/zhangjiatao/Documents/暑期训练/input.txt","r",stdin);
int n;
cin>>n;
inithash();
int flag=0;
for(int t=1;t<=n;t++)
{
int num[2][12];
for(int i=0;i<6;i++)
{
scanf("%d", &num[0][i]);
num[0][i+6]=num[0][i];
}
if(flag==1) continue;
for(int i=0;i<6;i++)
{
num[1][i+6]=num[1][i]=num[0][5-i];
}
for(int i=0;i<6;i++)
{
if(hashsearch(num[0]+i)||hashsearch(num[1]+i))
{
flag=1;
break;
}
}
}
if (flag) printf("Twin snowflakes found.\n");
else printf("No two snowflakes are alike.\n");
return 0;
}