[poj 3349] Snowflake Snow Snowflakes 解题报告（hash表）

题目链接：http://poj.org/problem?id=3349

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.

题目大意：

给出n个长度为6的圆，问你是否存在两个圆是一样的

题解：

考虑到n的取值范围，直接比较果断的TLE

那么我们考虑先把每个数列hash，然后建立hash表，对于hash值相同的元素在当前的链表里暴力比较就好了

构造$hash(a_1,a_2...a_6)=\sum_{i=1}^{6}a_i+\prod_{i=1}^{6}a_i$

AC代码

#include<algorithm>

#include<cstring>

#include<cstdio>

#include<iostream>

const int N=1e5+;

const int P=1e5+;

int n,tot;

int head[N],snow[N][],next[N];

int H(int *a)

{

    int sum=,re=;

    for (int i=;i<;i++)

    {

        sum=(sum+a[i])%P;

        re=1ll*re*a[i]%P;

    }

    return (sum+re)%P;

}

bool equal(int *a,int *b)

{

    for (int i=;i<;i++)

        for (int j=;j<;j++)

        {

            bool flag=true;

            for (int k=;k<;k++) if (a[(i+k)%]!=b[(j+k)%]) flag=false;

            if (flag) return true;

            flag=true;

            for (int k=;k<;k++) if (a[(i+k)%]!=b[(j-k+)%]) flag=false;

            if (flag) return true;

        }

    return false;

}

bool insert(int *a)

{

    int val=H(a);

    for (int i=head[val];i;i=next[i])

    {

        if (equal(snow[i],a)) return true;

    }

    ++tot;

    for (int i=;i<;i++) snow[tot][i]=a[i];

    next[tot]=head[val];

    head[val]=tot;

    return false;

}

int main()

{

    int a[];

    scanf("%d",&n);

    for (int i=;i<=n;i++)

    {

        for (int j=;j<;j++) scanf("%d",a+j);

        if (insert(a))

        {

            puts("Twin snowflakes found.");

            return ;

        }

    }

    puts("No two snowflakes are alike.");

    return ;

}

巴特西

[poj 3349] Snowflake Snow Snowflakes 解题报告（hash表）

题目链接：http://poj.org/problem?id=3349

Description

Input

Output

题目大意：

题解：

最新文章

热门文章

巴特西

[poj 3349] Snowflake Snow Snowflakes 解题报告 （hash表）

题目链接：http://poj.org/problem?id=3349

Description

Input

Output

题目大意：

题解：

最新文章

热门文章

[poj 3349] Snowflake Snow Snowflakes 解题报告（hash表）