相同的雪花
時間限制：1000 ms | 記憶體限制：65535 KB
難度：4
描述
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.
輸入
The first line of the input will contain a single interger T(0

#include<cstring>
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
#define LL long long
#define INF 0x3f3f3f3f
const int MAXN=100005;
const int MOD=5000;
int snow[MAXN][6];
vector<int>Hash[MOD];//向量實現雜湊表的儲存
bool isSame(int a, int
 
 b) {
    for(int i=0;i<6;i++){
        if(/*順時針方向*/
            (snow[a][0] == snow[b][i] &&
            snow[a][1] == snow[b][(i+1)%6] &&
            snow[a][2] == snow[b][(i+2)%6] &&
            snow[a][3] == snow[b][(i+3)%6] &&
            snow[a][4] == snow[b][(i+4
 
)%6] &&
            snow[a][5] == snow[b][(i+5)%6])
            || /*逆時針方向*/
            (snow[a][0] == snow[b][(i+5)%6] &&
            snow[a][1] == snow[b][(i+4)%6] &&
            snow[a][2] == snow[b][(i+3)%6] &&
            snow[a][3] == snow[b][(i+2)%6] &&
            snow[a][4] == snow[b][(i+1)%6] &&
            snow[a][5] == snow[b][(i+0)%6])
            )return true;
    } return false;
}

int T,N,ok;
int t;
int main(){
    scanf("%d",&T);
    while(T--){
        ok=0;
        scanf("%d",&N);
        for(int i=0;i<MOD;i++){
            Hash[i].clear();
        }
        for(int i=0;i<N;i++){
            int tot=0;
            for(int j=0;j<6;j++){
                scanf("%d",&t);
                tot+=t;
                snow[i][j]=t;
            }
            tot%=MOD;
            Hash[tot].push_back(i);
        }
        for(int i=0;i<MOD;i++){
            if(ok)break;
            if(Hash[i].size()<2)continue;
            for(int j=0;j<Hash[i].size()-1;j++){
                for(int k=j+1;k<Hash[i].size();k++){
                    if(isSame(Hash[i][j],Hash[i][k])){
                        ok=1;break;
                    }
                }
            }
        }
        if(ok)printf("Twin snowflakes found.\n");
        else printf("No two snowflakes are alike.\n");
    }
    return 0;
}