nyoj-130-相同的雪花(hash)

题目链接

/*
    Name:NYOJ-130-相同的雪花
    Copyright:
    Author:
    Date: 2018/4/14 15:13:39
    Description:
    将雪花各个分支上的值加起来，hash
*/
#include <iostream>
#include <vector>
#include <cstdio>
#include <cstring>
using namespace std;
const int MAXN = 1e5+;
int snowflakes[MAXN][];
vector<int> snow[];//hash
int Like(int x,int y)//判断两片雪花是否相同
{
    for(int i=;i<;i++)
    {
        if((snowflakes[x][]==snowflakes[y][i]&&snowflakes[x][]==snowflakes[y][(i+)%]&&snowflakes[x][]==snowflakes[y][(i+)%]&&snowflakes[x][]==snowflakes[y][(i+)%]&&snowflakes[x][]==snowflakes[y][(i+)%]&&snowflakes[x][]==snowflakes[y][(i+)%])///顺时针方向判断两个雪花是否相同
         ||(snowflakes[x][]==snowflakes[y][(i+)%]&&snowflakes[x][]==snowflakes[y][(i+)%]&&snowflakes[x][]==snowflakes[y][(i+)%]&&snowflakes[x][]==snowflakes[y][(i+)%]&&snowflakes[x][]==snowflakes[y][(i+)%]&&snowflakes[x][]==snowflakes[y][i]))///逆时针方向判断两个雪花是否相同
            return ;
    }
    return ;
}
int main()
{
//    freopen("in.txt", "r", stdin);
    int t;
    cin>>t;
    while (t--) {
        memset(snow, , sizeof(snow));
        int n;
        cin>>n;
        for (int i=; i<n; i++) {
            int sum = ;
            for (int j=; j<; j++) {
                int tmp;
                cin>>tmp;
                snowflakes[i][j] = tmp;
                sum += tmp;
            }
            sum = sum % ;//防止越界
            snow[sum].push_back(i);
        }
        int flag =  ;
        for (int i=; i<; i++) {
            if (flag) break;
            if (snow[i].size() < ) continue;
            for (int j=; j<snow[i].size()-; j++) {
                for (int k=j+; k<snow[i].size(); k++) {
                    if (Like(snow[i][j], snow[i][k])) {
                        flag = ;
                        break;
                    }

                }
            }
        }
        if(flag)printf("Twin snowflakes found.\n");
            else printf("No two snowflakes are alike.\n");
    }
    return ;
}