C - Snowflake Snow Snowflakes
POJ - 3349You 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.
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.
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.
2 1 2 3 4 5 6 4 3 2 1 6 5Sample Output
Twin snowflakes found.
思路 :用数字哈希的思路,记录每一次输入花时的所有顺时针状态和逆时针状态,以便下一次输入进行对比;
比如 输入:1 2 3 4 5 6
那么据题可得:
顺时针 { 2 3 4 5 6 1 ,3 4 5 6 1 2 ,4 5 6 1 2 3 ,5 6 1 2 3 4 ,6 1 2 3 4 5 },
逆时针 {6 5 4 3 2 1 ,5 4 3 2 1 6 ,4 3 2 1 6 5 , 3 2 1 6 5 4 ,2 1 6 5 4 3 ,1 6 5 4 3 2 } 都满足。
代码:
#include <stdio.h>
#include <cstring>
using namespace std;
const int maxn = 1202020;
const int mod = 1200007;
int ip;
int head[maxn];
struct qwe{
int num[6];
int next;
}mark[maxn];
void insert_hash(int *num,int h){
for(int i=0;i<6;i++){
mark[ip].num[i] = num[i];
// cout<<num[i]<<" ";
}
//cout<<endl;
mark[ip].next=head[h];
head[h] = ip;
ip++;
}
int get_hash(int *num){
int h=0;
for(int i=0;i<6;i++){
h+=num[i];
}
return h%mod;
}
bool compare(int *a,int *b){
for(int i=0;i<6;i++){
if(a[i]!=b[i]) return false;
}
return true;
}
bool search_hash(int *num){
int h = get_hash(num);
for(int i=head[h];i!=-1;i=mark[i].next){
if(compare(num,mark[i].num)){
return true;
}
}
insert_hash(num,h);
return false;
}
int main(){
memset(head,-1,sizeof(head));
int n;
ip = 0;
//cin>>n;
scanf("%d",&n);
int num[2][15];
int flag = 0;
while(n--){
for(int i=0;i<6;i++){
//cin>>num[0][i];
scanf("%d",&num[0][i]);
num[0][i+6]=num[0][i];
}
for(int i=0;i<6;i++){
num[1][i] = num[1][i+6] = num[0][5-i];
}
if(flag) continue;
for(int i=0;i<6;i++){
if(search_hash(num[0]+i)||search_hash(num[1]+i)) //相当于循环链表的开头
{
flag = 1;
break;
}
}
}
if(flag) printf("Twin snowflakes found.\n");
else printf("No two snowflakes are alike.\n");
return 0;
}