Snowflake Snow Snowflakes(查找)

http://poj.org/problem?id=3349

题意：给出n组数据，每组数据有六个数，这n组数据中若有两组数据不管是从某个数顺时针读还是逆时针读都相同，输出“Twin snowflakes found.”，否则，输出

"No two snowflakes are alike."

思路：将每组数据求和对大素数取余，将sum相同的放在同一个邻接表中，然后从邻接表中查找符合条件的数据。

#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <vector>
using namespace std;

const int p=99983;
const int N=1000001;
int arr[N][7];
struct node
{
    int sum;
    int id;
};
vector<node>v[N];//将每组数据的sum相同放在v[sum]邻接表里;

int s_ee(int n,int m)//顺时针查找
{
    int i,j;
    for (i = 0; i < 6; i ++)
    {
        if(arr[n][i]==arr[m][0])
        {
            for (j = 0; j < 6; j ++)
            {
                if (arr[n][(i+j)%6]!=arr[m][j])
                    break;
            }
            if (j >= 6)
                return 1;
        }
    }
    return  0;
}
int ee_s(int n,int m)//逆时针查找
{
    int i,j;
    for (i = 0; i < 6; i ++)
    {
        if (arr[n][i]==arr[m][5])
        {
            for (j = 0; j < 6; j ++)
            {
                if (arr[n][(i+j)%6]!=arr[m][5-j])
                    break;
            }
            if (j >= 6)
                return 1;
        }
    }
    return 0;
}
int main()
{
    int n,flag = 0 ,sum ;
    scanf("%d",&n);
    for (int i = 0; i <= N; i ++)
        v[i].clear();//初始化vector
    for (int i = 0; i < n; i ++)
    {
        sum = 0;
        for (int j = 0; j < 6; j ++)
        {
            scanf("%d",&arr[i][j]);
            sum += arr[i][j];
        }
        int t = sum%p;
        if (!flag)//没有找到相同的两组
        {
            for (int j = 0; j < v[t].size(); j ++)
            {
                if ((s_ee(v[t][j].id,i))||ee_s(v[t][j].id,i))
                {
                    flag = 1;
                    break;
                }
            }
            if (!flag)
            {
                v[t].push_back((node){sum,i});//放到邻接表里
            }
        }
    }
    if (flag)
        printf("Twin snowflakes found.\n");
    else
        printf("No two snowflakes are alike.\n");
    return 0;
}