第一次做这样的题，这里可以映射到很多的值，而且很可能有重复。把以把相同的对应的哈希值进行存储，大大地节省的搜索的时间。
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>
#include<vector>
#include<cmath>
#include<set>
#include<cstring>
using namespace std;
#define M 14997
#define N 15001
int snow[N][101][6];
int l[N];
int n;
int hash(int cur[])
{
int sum=0;
int i,j;
for (i=0;i<6;i++)
{
sum+=cur[i];
}
return sum%M;
}
bool cmp(int a[],int b[])
{
int i,j,k;
int cur[6];
for (i=0;i<6;i++)
cur[i]=b[i];
reverse(cur,cur+6);
for (i=0;i<6;i++)
{
rotate(a,a+1,a+6);
if (equal(a,a+6,b))
{
return true;
}
if (equal(a,a+6,cur))
{
return true;
}
}
return false;
}
int main()
{
freopen("in.txt","r",stdin);
int i,j,k;
cin>>n;
memset(l,0,sizeof(l));
int cur[44];
bool ans=false;
for (k=0;k<n;k++)
{
for (i=0;i<6;i++)
scanf("%d",cur+i);
j=hash(cur);
//if (l[j])
{
for (i=0;i<l[j];i++)
{
if (cmp(snow[j][i],cur))
{
printf("Twin snowflakes found.\n");
//cout<<k<<endl;
return 0;
}
}
}
for (i=0;i<6;i++)
snow[j][l[j]][i]=cur[i];
l[j]++;
}
printf("No two snowflakes are alike.\n");
return 0;
}
SnowflakeSnowSnowflakes
Time Limit: 4000MS | | Memory Limit: 65536K |
Total Submissions: 22367 | | Accepted: 5839 |
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 byn 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.
Source
