POJ 3349(Hash)

Snowflake Snow Snowflakes
Time Limit: 4000MS Memory Limit: 65536K

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.

Source


代码:




#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
using namespace std;
int n,tot,P=99991,snow[100010][6],head[100010],next[100010];
int H(int*a){
int sum=0,mul=1;
for(int i=0;i<6;i++){
sum=(sum+a[i])%P;
mul=(long long)mul*a[i]%P;
}
return(sum+mul)%P;
}
bool equal(int*a,int*b){
for(int i=0;i<6;i++)
for(int j=0;j<6;j++){
bool eq=1;
for(int k=0;k<6;k++)
if(a[(i+k)%6]!=b[(j+k)%6])eq=0;
if(eq)return 1;
eq=1;
for(int k=0;k<6;k++)
if(a[(i+k)%6]!=b[(j-k+6)%6])eq=0;
if(eq)return 1;
}
return 0;
}
bool insert(int*a){
int val=H(a);
for(int i=head[val];i;i=next[i])
if(equal(snow[i],a))return 1;
tot++;
memcpy(snow[tot],a,6*sizeof(int));
next[tot]=head[val];
head[val]=tot;
return 0;
}
int main(){
cin>>n;
for(int i=1;i<=n;i++){
int a[10];
for(int j=0;j<6;j++)scanf("%d",&a[j]);
if(insert(a)){
printf("Twin snowflakes found.");
return 0;
}
}
printf("No two snowflakes are alike.");
}

poj 3349 hash

09-02

为什么我的老是超时啊,请求大牛们帮我看看,还有什么地方优化的?rn[code=Java]rnimport java.util.Scanner;rnrnpublic class Main rn private static final int N = 100003;rn private static HashArray[] hashAray = new HashArray[100003];rn private static int[][] tables = null;rnrn public static void main(String[] args) rnrn Scanner sc = new Scanner(System.in);rn int n = sc.nextInt();rnrn tables = new int[n][6];rn boolean flag = false;rn for (int i = 0; i < n; ++i) rn int hashCode = 0;rn for (int j = 0; j < 6; ++j) rn tables[i][j] = sc.nextInt();rn hashCode += tables[i][j];rn rn if (!flag) rn hashCode %= N;rn if (hashAray[hashCode] == null) rn hashAray[hashCode] = new HashArray();rn hashAray[hashCode].index = i;rn else rn HashArray front = hashAray[hashCode];rn HashArray parents = front;rn do rn if (check(i, front.index)) rn flag = true;rn break;rn rn parents = front;rn front = front.next;rn while (front != null);rn if (!flag) rn front = new HashArray();rn front.index = i;rn front.next = parents;rn hashAray[hashCode] = front;rn rn rn rn rn if (!flag)rn System.out.println("No two snowflakes are alike.");rn elsern System.out.println("Twin snowflakes found.");rn rnrn private static boolean check(int r1, int r2) rn int[] snow1 = tables[r1];rn int[] snow2 = tables[r2];rn int j = 0, i = 0;rn int[] start = new int[6];rn int s = 0;rn for (; i < 6; ++i) rn if (snow2[i] == snow1[0]) rn start[s++] = i;rn rn rn for (i = 0; i < s; ++i) rn j = 0;rn int step2 = start[i];rn boolean flag1 = false;rn boolean flag2 = false;rn for (int step1 = start[i]; step1 < 6 && j < 6 && step2 < 6;) rn if (snow1[j] != snow2[step1] && !flag1)rn flag1 = true;rn if (snow1[j] != snow2[step2] && !flag2)rn flag2 = true;rn if (flag1 && flag2)rn break;rn j++;rn if (!flag1)rn step1 = (step1 + 1) % 6;rn if (!flag2) rn step2--;rn if (step2 == -1)rn step2 = 5;rn rn rn if (j == 6)rn return true;rn rn //rn // j = 0;rn // for (i = 0; i < s; ++i) rn // j = 0;rn // for (int step = start[i]; step < 6 && j < 6;) rn //rn // if (snow1[j] != snow2[step])rn // break;rn // j++;rn // step--;rn // if (step == -1)rn // step = 5;rn // rn // if (j == 6)rn // return true;rn // rn return false;rn rnrn private static class HashArray rn private int index;rn private HashArray next = null;rn rnrnrn[/code]

没有更多推荐了,返回首页

私密
私密原因:
请选择设置私密原因
  • 广告
  • 抄袭
  • 版权
  • 政治
  • 色情
  • 无意义
  • 其他
其他原因:
120
出错啦
系统繁忙,请稍后再试

关闭