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一下,然后 ...
随机推荐
- POJ 1995 快速幂模板
http://poj.org/problem?id=1995 简单的快速幂问题 要注意num每次加过以后也要取余,否则会出问题 #include<iostream> #include< ...
- dp重拾-01背包--HDU 2602
Many years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like ...
- gcc编译时对'xxxx'未定义的引用问题
gcc编译时对’xxxx’未定义的引用问题 gcc编译时对’xxxx’未定义的引用问题 原因 解决办法 gcc 依赖顺序问题 在使用gcc编译的时候有时候会碰到这样的问题,编译为.o(obj) 文件没 ...
- dango foreign key 指定被引用模型的字段
用 to_field pool_no = models.ForeignKey('SimCardPool', verbose_name=u'卡池编号', db_column='pool_no', to_ ...
- supervisor的配置
看了下文档,比较多.http://www.supervisord.org/ 抱着试试又不会怀孕的心态,trying,碰了几鼻子灰,记录如下, 方便大家 1. 安装 easy_install super ...
- typedef使用大全(转)
typedef使用大全(转) 一.数组typedef到处都是,但是能够真正懂得typedef使用的不算太多.对于初学者而言,看别人的源码时对到处充斥的typedef往往不知所错,而参考书又很少,所以在 ...
- Oracle: SQL组合不同字段作为一个查询条件
前端程序传过来的值是有三个字段组合之后的结果,后端程序处理,并且将查询的数据反馈给前端. PS:不能直接使用字段RPT_NO的,因为在这条记录中RPT_NO恰好等于其他三个字段的组合值. 正确的做法是 ...
- Struts2学习笔记《一》
(一)struts2中JSP页面数据与Action对应的三种方式 1.属性驱动,及页面中带有name属性的值传递过来action中,struts2会将值直接映射到getter.setter接收器中 此 ...
- Print Common Nodes in Two Binary Search Trees
Given two Binary Search Trees, find common nodes in them. In other words, find intersection of two B ...
- 【leetcode】Next Permutation
Next Permutation Implement next permutation, which rearranges numbers into the lexicographically nex ...