zoukankan      html  css  js  c++  java
  • POJ3349 Snowflake Snow Snowflakes

    Time Limit: 4000MS   Memory Limit: 65536K
    Total Submissions: 39075   Accepted: 10232

    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.

    Source

     
     
    加法取余HASH。如果遇到hash值相同的雪花,那么从6个不同的点开始,正序、倒序比较各一次,看两片雪花是否完全相同。
     1 /**/
     2 #include<iostream>
     3 #include<cstdio>
     4 #include<cmath>
     5 #include<cstring>
     6 #include<algorithm>
     7 #include<vector>
     8 using namespace std;
     9 const int p=1e6+7;
    10 const int mxn=100500;
    11 int s[mxn][6];
    12 int h;
    13 bool flag=0;
    14 vector<int>hash[p];
    15 int n;
    16 bool pd(int x,int y){
    17     for(int i=0;i<6;i++){
    18         int sx=0,sy=i;
    19 //        printf("
    cmp: %d %d
    ",sx,sy);
    20         while(s[x][sx]==s[y][sy] && sx<6){
    21             sx++;sy=(sy+1)%6;
    22 //            printf("%d %d
    ",s[x][sx],s[y][sy]);
    23         }
    24         if(sx==6){
    25             flag=1;
    26             return 1;
    27         }
    28     }
    29     for(int i=0;i<6;i++){
    30         int sx=0,sy=i;
    31 //        printf("
    cmp2: %d %d
    ",sx,sy);
    32         while(s[x][sx]==s[y][sy] && sx<6){
    33             sx++;sy=((sy-1)+6)%6;
    34 //            printf("%d %d
    ",s[x][sx],s[y][sy]);
    35         }
    36         if(sx==6){
    37             flag=1;
    38             return 1;
    39         }
    40     }
    41     return 0;
    42 }
    43 int main(){
    44     scanf("%d",&n);
    45     int i,j;
    46     for(int t=1;t<=n;t++){
    47         h=0;
    48         for(i=0;i<6;i++){
    49             scanf("%d",&s[t][i]);
    50             h+=s[t][i];
    51             h%=p;
    52         }
    53 //        if(flag)continue;
    54         if(!hash[h].empty()){
    55             for(i=0;i<hash[h].size();i++){
    56                 if(pd(t,hash[h][i])) break;
    57             }
    58         }
    59         if(flag){
    60             printf("Twin snowflakes found.
    ");
    61             return 0;
    62         }
    63         hash[h].push_back(t);
    64     }
    65     printf("No two snowflakes are alike.
    ");
    66     return 0;
    67 }
  • 相关阅读:
    JVM调优-Java中的对象
    Spring MVC如何接收浏览器传递来的请求参数--request--形参--实体类封装
    Navicat for MySQL 64位破解版
    Idea详细配置
    数据库--悲观锁【收藏,待尝试】
    性能问题分析
    java 反射机制之 getDeclaredMethod()获取方法,然后invoke执行实例对应的方法
    Mysql show indexes 查看索引状态
    基于(Redis | Memcache)实现分布式互斥锁
    彻底解决每次打开visio都提示windows正在配置visio的问题
  • 原文地址:https://www.cnblogs.com/SilverNebula/p/5837739.html
Copyright © 2011-2022 走看看