poj-3349 SnowflakeSnowSnowflakes

原创 2012年03月28日 23:14:59
                                                                A - SnowflakeSnowSnowflakes
Crawling in process...Crawling failedTime Limit:4000MS    Memory Limit:65536KB    64bit IO Format:%I64d & %I64u

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表的应用,先定义一个较大的数,求出每组数据的总和,若和取模这个较大数,若结果相同就放在同一个hash表中,在比较这些组中每个数字是否相同。
#include<vector>
using namespace std;
int d[100001][6];
const int MAXVALUE=99991;
vector<int> hash[MAXVALUE];
bool isSame(int a,int b)
{
    int i; 
    for(i=0;i<6;i++)
    {
        if( ( d[a][0]==d[b][i] && 
        d[a][1]==d[b][(i+1)%6] && 
        d[a][2]==d[b][(i+2)%6] && 
        d[a][3]==d[b][(i+3)%6] && 
        d[a][4]==d[b][(i+4)%6] && 
        d[a][5]==d[b][(i+5)%6]) || (

        d[a][0]==d[b][i] && 
        d[a][1]==d[b][(i+5)%6] && 
        d[a][2]==d[b][(i+4)%6] && 
        d[a][3]==d[b][(i+3)%6] && 
        d[a][4]==d[b][(i+2)%6] && 
        d[a][5]==d[b][(i+1)%6]))
        return true;
    }
    return false;
}
int main()
{
    int n;
    int i,j;
    scanf("%d",&n);
    for(i=0;i<n;++i)
    {
        int sum=0;
        for(j=0;j<6;++j)
        {
            scanf("%d",&d[i][j]);
            sum+=d[i][j];
        }
        sum%=MAXVALUE;
        for(j=0;j<hash[sum].size();++j)
        {
            if(isSame(hash[sum][j],i))
            {
                printf("%s\n","Twin snowflakes found.");
                exit(0);
            }
        }
        hash[sum].push_back(i);
    }
    printf("%s\n","No two snowflakes are alike.");
    return 0;
}

POJ 3349 Snowflake Snow Snowflakes

哈希

[ACM] POJ 3349 Snowflake Snow Snowflakes(哈希查找,链式解决冲突)

Snowflake Snow Snowflakes Time Limit: 4000MS   Memory Limit: 65536K Total Submission...

***POJ 3349 Snowflake Snow Snowflakes(哈希)

第一次学习哈希,基本模仿题解写的 思路:首先这题时间比较紧,所以只能用加法求余来构造哈希表,然后容易出现冲突,所以冲突之后还需要判断是否为同种。 并且雪花有顺逆时针,所以需要两种时针方向,每种时针...

poj3349~差点超时的哈希表

这……ganj

POJ 3349

本题哈希,但judge的时间还是很长,哎; #include #include #define maxn 100003 struct s{ int arms[6]; int amo...

poj3349 哈希函数

poj3349 只要用上hash就没问题了,还有主要要用scanf,否则会超时。wa了无数次,是因为cmp函数还写好,细节决定成败。本来以为找k只要找出第一次相等的那个就行了其实这样是错误的 这样的话...
  • wuyanyi
  • wuyanyi
  • 2011年07月09日 19:08
  • 790

POJ 3349 Snowflake Snow Snowflakes(hash)

Snowflake Snow Snowflakes Time Limit: 4000MS   Memory Limit: 65536K Total Submission...

POJ 3349 简单hash

题意: 给出n个雪花,每一个雪花由6个数字表示,现在问你n个雪花中有相同的吗?ps:雪花的6个数字给出的顺序不定,有的是正序有的是逆序 例如:1 2 3 4 5 6和 4 3 2 1 6 5表示...

POJ 3349 Snowflake Snow Snowflakes (hash)

题意: 有n片雪花,每个雪花有6条边长度(顺时针或者逆时针不定)。问你是否有相同的两片雪花,即长度能够一一对应。 思路: 喵了一下别人的思路。大概就是把所给你的每片雪花总共12种情况全算出来(顺时针6...

poj.3349

这道题目题意很好理解就是在n个元素(每个元素有6个整数组成)中找是否有两个元素相同,这里的相同是指:顺时针或逆时针相同。具体看题目。那么常规的思想就是暴力了,将每个元素与其余n-1个元素比较判断。在这...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:poj-3349 SnowflakeSnowSnowflakes
举报原因:
原因补充:

(最多只允许输入30个字)