poj 3349:Snowflake Snow Snowflakes(哈希查找,求和取余法+拉链法)
Time Limit: 4000MS | Memory Limit: 65536K | |
Total Submissions: 30529 | Accepted: 8033 |
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
#include <iostream>
#include <stdio.h> using namespace std; #define MAXPRIME 100001 struct Hashnode{
int len[];
Hashnode* next;
};
Hashnode hashtable[MAXPRIME]={}; //哈希表,拉链法解决哈希冲突 int getkey(Hashnode* p) //哈希函数,求和取余法。求一片雪花对应的key值
{
int i,key=;
for(i=;i<;i++)
key = (key + p->len[i])%MAXPRIME;
return key;
} bool clockwise(Hashnode* p,Hashnode* q) //顺时针看有没有相同的顺序
{
int i,j;
for(i=;i<;i++){
for(j=;j<;j++)
if(p->len[j]!=q->len[(i+j)%])
break;
if(j>=)
break;
}
//找到两片相同的雪花
if(i<)
return true;
else
return false;
} bool counterclockwise(Hashnode* p,Hashnode* q) //逆时针看有没有相同的顺序
{
int i,j;
for(i=;i<;i++){
for(j=;j<;j++)
if(p->len[j]!=q->len[(i+-j)%])
break;
if(j>=)
break;
}
//找到两片相同的雪花
if(i<)
return true;
else
return false;
} bool iscom(Hashnode* p) //判断这片雪花是否和之前的有一片雪花完全相同
{
int key = getkey(p);
if(hashtable[key].next==NULL){ //没有冲突
hashtable[key].next = p;
return false;
}
else{ //产生冲突
//拉链法解决冲突
Hashnode* q = &hashtable[key];
p->next = q->next;
q->next = p; q = p->next; //从p的下一个开始比较
while(q){
if(clockwise(p,q) || counterclockwise(p,q)) //顺时针或者逆时针看有一个方向有相同的顺序,说明找到了相同的雪花
return true;
q = q->next;
}
return false;
}
} int main()
{
int n,i;
bool f = false; //找没找到两片相同的雪花,默认是没有
scanf("%d",&n);
while(n--){
Hashnode* p = new Hashnode;
p->next = NULL;
for(i=;i<;i++) //读取这片雪花的6个花瓣的长度
scanf("%d",&p->len[i]);
if(iscom(p)){ //判断这片雪花是否和之前的有一片雪花相同,如果有,改变f的值。
//函数中顺便将这片花瓣的信息插入到哈希表。
f=true;
break; //没有输入完毕,中途退出也可以,省了300MS
}
}
//判断有没有找到两片一样的雪花
if(f)
printf("Twin snowflakes found.\n");
else
printf("No two snowflakes are alike.\n");
return ;
}
Freecode : www.cnblogs.com/yym2013
poj 3349:Snowflake Snow Snowflakes(哈希查找,求和取余法+拉链法)的更多相关文章
- [ACM] POJ 3349 Snowflake Snow Snowflakes(哈希查找,链式解决冲突)
Snowflake Snow Snowflakes Time Limit: 4000MS Memory Limit: 65536K Total Submissions: 30512 Accep ...
- 哈希—— POJ 3349 Snowflake Snow Snowflakes
相应POJ题目:点击打开链接 Snowflake Snow Snowflakes Time Limit: 4000MS Memory Limit: 65536K Total Submissions ...
- POJ 3349 Snowflake Snow Snowflakes(简单哈希)
Snowflake Snow Snowflakes Time Limit: 4000MS Memory Limit: 65536K Total Submissions: 39324 Accep ...
- POJ 3349 Snowflake Snow Snowflakes
Snowflake Snow Snowflakes Time Limit: 4000MS Memory Limit: 65536K Total Submissions: 27598 Accepted: ...
- POJ 3349 Snowflake Snow Snowflakes (Hash)
Snowflake Snow Snowflakes Time Limit: 4000MS Memory Limit: 65536K Total Submissions: 48646 Accep ...
- POJ 3349 Snowflake Snow Snowflakes (哈希表)
题意:每片雪花有六瓣,给出n片雪花,六瓣花瓣的长度按顺时针或逆时针给出,判断其中有没有相同的雪花(六瓣花瓣的长度相同) 思路:如果直接遍历会超时,我试过.这里要用哈希表,哈希表的关键码key用六瓣花瓣 ...
- POJ 3349 Snowflake Snow Snowflakes(哈希表)
题意:判断有没有两朵相同的雪花.每朵雪花有六瓣,比较花瓣长度的方法看是否是一样的,如果对应的arms有相同的长度说明是一样的.给出n朵,只要有两朵是一样的就输出有Twin snowflakes fou ...
- POJ - 3349 Snowflake Snow Snowflakes (哈希)
题意:给定n(0 < n ≤ 100000)个雪花,每个雪花有6个花瓣(花瓣具有一定的长度),问是否存在两个相同的雪花.若两个雪花以某个花瓣为起点顺时针或逆时针各花瓣长度依次相同,则认为两花瓣相 ...
- POJ 3349 Snowflake Snow Snowflakes(哈希)
http://poj.org/problem?id=3349 题意 :分别给你n片雪花的六个角的长度,让你比较一下这n个雪花有没有相同的. 思路:一开始以为把每一个雪花的六个角的长度sort一下,然后 ...
随机推荐
- Kali Linux渗透基础知识整理(三):漏洞利用
漏洞利用阶段利用已获得的信息和各种攻击手段实施渗透.网络应用程序漏洞诊断项目的加密通信漏洞诊断是必须执行的.顾名思义,利用漏洞,达到攻击的目的. Metasploit Framework rdeskt ...
- BZOJ 4665: 小w的喜糖
Sol DP+容斥. 这就是一个错排的扩展...可是想到容斥却仅限于种数的容斥,如果种数在一定范围内我就会做了QAQ. 但是容斥的是一定在原来位置的个数. 发现他与原来的位置无关,可以先把每个同种的糖 ...
- 【GoLang】golang 如何像Java 一样通过类名反射对象?
结论: golang不支持解析string然后执行. golang的反射机制只能存在于已经存在的对象上面. 不知道后续的版本有没有规划,现在只能先加载注册,然后实现类似Java工厂模式的反射. 代码示 ...
- JavaScript高级程序设计学习笔记--基本概念
1.语句 ECMAScript中的语句以一个分号结尾:如果省略分号,则由解析器确定语句的结尾,如下例所示: var sum=a+b //即使没有分号也是有效的语句--推荐 var diff=a-b; ...
- Android 运行时权限处理
引言 Android 6.0 (API 23) 开始引入了运行时权限检查 (Permissions at Run Time),用户不需要在安装时同意授予应用权限,而是在应用运行时动态去申请所需要的权限 ...
- 【linux】nohup运行守护进程
来源:http://www.cnblogs.com/allenblogs/archive/2011/05/19/2051136.html nohup 命令 用途:不挂断地运行命令. 语法:nohup ...
- 完美解决:Could not retrieve mirrorlist http://mirrorlist.centos.org/?release=6&arch=x
如题: 原因:没有配置resolv.conf 解决方法: 到/etc目录下配置resolv.conf加入nameserver IP,如: nameserver 8.8.8.8nameserver 8. ...
- 甲鱼od18篇笔记
模态对话框和非模态对话框 一:模态对话框是调用DialogBoxParam API 函数来实现的 二:非模态对话框是调用Crea ...
- Delphi 2010 Can't load package C:\Programme\Afalinasoft\Add-in Express 2\d5units\adxwizardd5.bpl.
"Can't load package C:\Programme\Afalinasoft\Add-in Express 2\d5units\adxwizardd5.bpl. Componen ...
- 2048控制台程序:一份帝国理工C++作业
#include <fstream> #include <vector> #include <iostream> #include <string> u ...