相应POJ题目:点击打开链接

Snowflake Snow Snowflakes
Time Limit: 4000MS   Memory Limit: 65536K
Total Submissions: 33595   Accepted: 8811

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.

题意:

一片雪花有6片叶子,给出n片雪花,下面每行6个数字。分别代表每片叶子长度。问是否存在有2片雪花形态是同样的。

形态同样的定义:例如以下图,2 3 4 5 6 1 和 4 5 6 1 2 3 和 3 2 1 6 5 4 都是形态同样的雪花,即是同一片雪花。

即是一片雪花能够从某一个数開始顺时针或逆时针数。

思路:

把一片雪花的全部长度相加 mod 一个大质数(100w左右)作为键值key,那就仅仅有key同样的雪花才有可能是形态同样的。

而key同样的雪花会映射到哈希表的同一个槽,那我们用链表把key值同样的在同一个槽连起来。仅仅有key相等的时候就一个个比較key值那条链的雪花是否存在形态同样的,假设有就标记,以后就仅仅是读入数据不比較;假设没有就把雪花增加链表。

也能够採用开方性寻址的方法。思路是一样的。比較雪花形态是否相等要分顺时针和逆时针

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <algorithm>
#include <map>
#include <iostream>
using namespace std;
#define N 100007
const int prime = 999983; typedef struct
{
int key;
int arm[7];
}Point; Point *slot[prime+10]; bool Check(Point *p, Point *q) //p是新的,q是旧的
{
int i, j;
//顺时针
for(j = 0; j < 6; j++){
for(i = 0; i < 6; i++)
if(q->arm[i] != p->arm[(i+j)%6]) break;
if(6 == i) return true;
}
//逆时针
for(j = 0; j < 6; j++){
for(i = 0; i < 6; i++){
if(q->arm[i] != p->arm[(12-i-j)%6]) break;
}
if(6 == i) return true;
}
return false;
} int Hash(int k)
{
/*
char s[20];
sprintf(s, "%d", k);
int i, h = 0, a = 232;
for(i = 0; i < strlen(s); i++)
h = (a * h + s[i] - '0') % prime;
*/
return (k<<2);
} bool Try_to_insert(Point *p)
{
int k = p->key;
if(NULL == slot[k]){ //有空槽
slot[k] = p;
return true;
}
while(slot[k])
{
if(Check(p, slot[k])) return false;
k = (k + Hash(k)) % prime;
}
slot[k] = p;
return true;
} int main()
{
//freopen("in.txt","r",stdin);
int i, j, n, flag = 0;
Point *p;
scanf("%d", &n);
for(i = 0; i < n; i++){
p = (Point *)malloc(sizeof(Point));
p->key = 0;
for(j = 0; j < 6; j++){
scanf("%d", &p->arm[j]);
p->key = (p->key + p->arm[j]) % prime;
}
if(flag) continue;
if(!Try_to_insert(p)) flag = 1;
}
if(flag) printf("Twin snowflakes found.\n");
else printf("No two snowflakes are alike.\n");
return 0;
}

哈希—— POJ 3349 Snowflake Snow Snowflakes的更多相关文章

  1. POJ 3349 Snowflake Snow Snowflakes(简单哈希)

    Snowflake Snow Snowflakes Time Limit: 4000MS   Memory Limit: 65536K Total Submissions: 39324   Accep ...

  2. poj 3349:Snowflake Snow Snowflakes(哈希查找,求和取余法+拉链法)

    Snowflake Snow Snowflakes Time Limit: 4000MS   Memory Limit: 65536K Total Submissions: 30529   Accep ...

  3. [ACM] POJ 3349 Snowflake Snow Snowflakes(哈希查找,链式解决冲突)

    Snowflake Snow Snowflakes Time Limit: 4000MS   Memory Limit: 65536K Total Submissions: 30512   Accep ...

  4. POJ 3349 Snowflake Snow Snowflakes

    Snowflake Snow Snowflakes Time Limit: 4000MS Memory Limit: 65536K Total Submissions: 27598 Accepted: ...

  5. POJ 3349 Snowflake Snow Snowflakes (Hash)

    Snowflake Snow Snowflakes Time Limit: 4000MS   Memory Limit: 65536K Total Submissions: 48646   Accep ...

  6. POJ 3349 Snowflake Snow Snowflakes(哈希)

    http://poj.org/problem?id=3349 题意 :分别给你n片雪花的六个角的长度,让你比较一下这n个雪花有没有相同的. 思路:一开始以为把每一个雪花的六个角的长度sort一下,然后 ...

  7. POJ 3349 Snowflake Snow Snowflakes (哈希表)

    题意:每片雪花有六瓣,给出n片雪花,六瓣花瓣的长度按顺时针或逆时针给出,判断其中有没有相同的雪花(六瓣花瓣的长度相同) 思路:如果直接遍历会超时,我试过.这里要用哈希表,哈希表的关键码key用六瓣花瓣 ...

  8. POJ 3349 Snowflake Snow Snowflakes(哈希表)

    题意:判断有没有两朵相同的雪花.每朵雪花有六瓣,比较花瓣长度的方法看是否是一样的,如果对应的arms有相同的长度说明是一样的.给出n朵,只要有两朵是一样的就输出有Twin snowflakes fou ...

  9. POJ - 3349 Snowflake Snow Snowflakes (哈希)

    题意:给定n(0 < n ≤ 100000)个雪花,每个雪花有6个花瓣(花瓣具有一定的长度),问是否存在两个相同的雪花.若两个雪花以某个花瓣为起点顺时针或逆时针各花瓣长度依次相同,则认为两花瓣相 ...

随机推荐

  1. 洛谷 P1177 【模板】快速排序 【快速排序/multiset排序】

    题目描述 利用快速排序算法将读入的N个数从小到大排序后输出. 快速排序是信息学竞赛的必备算法之一.对于快速排序不是很了解的同学可以自行上网查询相关资料,掌握后独立完成.(C++选手请不要试图使用STL ...

  2. Codeforces 868A Bark to Unlock【字符串+二维string输入输出+特判】

    A. Bark to Unlock time limit per test 2 seconds memory limit per test 256 megabytes input standard i ...

  3. order by 中利用 case when 排序

    order by case when a.ShopNumber in(1,2,3) then 0 else 1 end

  4. oracle tablespace usage status

    select a.tablespace_name, a.bytes / 1024 / 1024 "Sum MB", (a.bytes - b.bytes) / 1024 / 102 ...

  5. [BZOJ 1913] signaling 信号覆盖

    Link:https://www.lydsy.com/JudgeOnline/problem.php?id=1913 TIP:(注意,这题只能输出6位才能过,7位都不行wtf?) Algorithm: ...

  6. 【最近公共祖先】【线段树】URAL - 2109 - Tourism on Mars

    Few people know, but a long time ago a developed state existed on Mars. It consisted of n cities, nu ...

  7. 【二分答案】【Heap-Dijkstra】bzoj2709 [Violet 1]迷宫花园

    显然最短路长度随着v的变化是单调的,于是可以二分答案,据说spfa在网格图上表现较差. #include<cstdio> #include<cstring> #include& ...

  8. NPOI读取Excel2003,2007

    using System; using System.Collections.Generic; using System.Data; using System.IO; using System.Lin ...

  9. 在sublime执行自定义脚本

    [背景] 一般项目都会有一个预处理的脚本, 在发布,或者预览效果的时候,往往要先执行脚本. 想法来自editplus 习惯了editplus的同学,都知道,可以配置自定义执行的脚本. 一般我会把它配置 ...

  10. [转] matlab调用opencv函数的配置

    原文地址百度账户 aleasa123 方式1 1.  首先保证vs2010能正确调用opencv函数, 2.  Matlab中选择编译器,操作如下: 打开matlab2012,输入mex –setup ...