poj-3349 SnowflakeSnowSnowflakes
来源:互联网 发布:淘宝店铺简介范文大全 编辑:程序博客网 时间:2024/06/05 04:29
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 byn 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
21 2 3 4 5 64 3 2 1 6 5
Sample Output
Twin snowflakes found.
这是对hash表的应用,先定义一个较大的数,求出每组数据的总和,若和取模这个较大数,若结果相同就放在同一个hash表中,在比较这些组中每个数字是否相同。
#include<vector>using namespace std;int d[100001][6];const int MAXVALUE=99991;vector<int> hash[MAXVALUE];bool isSame(int a,int b){ int i; for(i=0;i<6;i++) { if( ( d[a][0]==d[b][i] && d[a][1]==d[b][(i+1)%6] && d[a][2]==d[b][(i+2)%6] && d[a][3]==d[b][(i+3)%6] && d[a][4]==d[b][(i+4)%6] && d[a][5]==d[b][(i+5)%6]) || ( d[a][0]==d[b][i] && d[a][1]==d[b][(i+5)%6] && d[a][2]==d[b][(i+4)%6] && d[a][3]==d[b][(i+3)%6] && d[a][4]==d[b][(i+2)%6] && d[a][5]==d[b][(i+1)%6])) return true; } return false;}int main(){ int n; int i,j; scanf("%d",&n); for(i=0;i<n;++i) { int sum=0; for(j=0;j<6;++j) { scanf("%d",&d[i][j]); sum+=d[i][j]; } sum%=MAXVALUE; for(j=0;j<hash[sum].size();++j) { if(isSame(hash[sum][j],i)) { printf("%s\n","Twin snowflakes found."); exit(0); } } hash[sum].push_back(i); } printf("%s\n","No two snowflakes are alike."); return 0;}
- poj-3349 SnowflakeSnowSnowflakes
- OPJ-3349 SnowflakeSnowSnowflakes 解题报告(hash) 两片相同的雪花
- A - SnowflakeSnowSnowflakes解题报告
- A - SnowflakeSnowSnowflakes解题报告(黄杰)
- POJ 3349
- POJ 3349
- poj 3349
- poj 3349
- poj 3349
- POJ 3349
- POJ--3349
- poj.3349
- poj.3349
- poj-3349
- poj 3349
- POJ 3349
- poj 3349
- POJ 3349
- C++中虚继承防止二义性
- jQuery源码分析12: jQuery.query
- 添加滑块
- Android开发给TextView添加点击事件
- 忘字心中过,人生不复来 2011-10-02 16:09:02
- poj-3349 SnowflakeSnowSnowflakes
- 实验报告 6-2
- 《那些被延迟的快乐,它们永远不会来》——读后感
- 关于C++中的前置声明
- 乔布斯做管理的十条戒律
- 数据库设计三大范式应用实例剖析
- 关于C++中的前置声明
- poj-1840 Eqs
- 怎样获得虚函数指针