HDU 1116.Play on Words【并查集+欧拉图】【5月16】
来源:互联网 发布:车载电子狗软件 编辑:程序博客网 时间:2024/06/07 12:53
Play on Words
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7111 Accepted Submission(s): 2409
Problem Description
Some of the secret doors contain a very interesting word puzzle. The team of archaeologists has to solve it to open that doors. Because there is no other way to open the doors, the puzzle is very important for us.
There is a large number of magnetic plates on every door. Every plate has one word written on it. The plates must be arranged into a sequence in such a way that every word begins with the same letter as the previous word ends. For example, the word ``acm'' can be followed by the word ``motorola''. Your task is to write a computer program that will read the list of words and determine whether it is possible to arrange all of the plates in a sequence (according to the given rule) and consequently to open the door.
There is a large number of magnetic plates on every door. Every plate has one word written on it. The plates must be arranged into a sequence in such a way that every word begins with the same letter as the previous word ends. For example, the word ``acm'' can be followed by the word ``motorola''. Your task is to write a computer program that will read the list of words and determine whether it is possible to arrange all of the plates in a sequence (according to the given rule) and consequently to open the door.
Input
The input consists of T test cases. The number of them (T) is given on the first line of the input file. Each test case begins with a line containing a single integer number Nthat indicates the number of plates (1 <= N <= 100000). Then exactly Nlines follow, each containing a single word. Each word contains at least two and at most 1000 lowercase characters, that means only letters 'a' through 'z' will appear in the word. The same word may appear several times in the list.
Output
Your program has to determine whether it is possible to arrange all the plates in a sequence such that the first letter of each word is equal to the last letter of the previous word. All the plates from the list must be used, each exactly once. The words mentioned several times must be used that number of times.
If there exists such an ordering of plates, your program should print the sentence "Ordering is possible.". Otherwise, output the sentence "The door cannot be opened.".
If there exists such an ordering of plates, your program should print the sentence "Ordering is possible.". Otherwise, output the sentence "The door cannot be opened.".
Sample Input
32acmibm3acmmalformmouse2okok
Sample Output
The door cannot be opened.Ordering is possible.The door cannot be opened.
#include<iostream>#include<cstdio>#include<string>#include<cstring>using namespace std;const int N = 27;int T, n;int fa[N], in[N], out[N], v[N], x, y, rootx, rooty;char s[1005];int fi(int x){ if(x == fa[x]) return x; else return fa[x] = fi(fa[x]);}int main(){ scanf("%d", &T); while(T--) { memset(v, 0, sizeof(v)); memset(in, 0, sizeof(in)); memset(out, 0, sizeof(out)); for(int i = 0;i < N; ++i) fa[i] = i; scanf("%d", &n); while(n--) { scanf("%s", s); x = s[0]-'a'; y = s[strlen(s)-1]-'a'; out[x]++; in[y]++; v[x] = v[y] = 1; rootx = fi(x); rooty = fi(y); if(rootx != rooty) fa[rooty] = rootx; } bool flag = true; int cntroot = 0, cntin = 0, cntout = 0; for(int i = 0;i < N; ++i) { if(v[i] && fa[i] == i) cntroot++; } if(cntroot != 1) { cout <<"The door cannot be opened."<< endl; continue; } for(int i = 0;i < N; ++i) { if(v[i]) { if(in[i] == out[i]+1) cntin++; else if(out[i] == in[i]+1) cntout++; else if(out[i] != in[i]) { flag = false; break; } } } if(flag == false) cout <<"The door cannot be opened."<< endl; else if(cntin == cntout && (cntin == 0 || cntin == 1)) cout <<"Ordering is possible."<< endl; else cout <<"The door cannot be opened."<< endl; } return 0;}
0 0
- HDU 1116.Play on Words【并查集+欧拉图】【5月16】
- hdu 1116 Play on Words(欧拉图+并查集)
- HDU 1116 Play on Words 【并查集+欧拉图】
- HDU 1116 Play on Words 并查集
- HDU-1116 Play on Words 并查集
- HDU 1116 Play on Words (歐拉迴路 + 并查集)
- HDU 1116 Play on Words 并查集
- hdu1116 Play on Words--并查集
- Play on Words -- 并查集
- 10129 - Play on Words(*****)欧拉图,并查集
- HDU1116 Play on Words 【欧拉图】+【并查集】
- HDU 1116 Play on Words(并查集,欧拉回路)
- hdu 题目1116 Play on Words(并查集 + 欧拉路)
- hdu 1116 Play on Words 并查集+欧拉通路
- 【并查集 欧拉路径】hdu 1116 Play on Words
- hdu 1116 Play on Words(并查集+欧拉回路|| 欧拉路径)
- HDU 1116 && UVA 10129 && POJ 1386 ------ Play on Words(欧拉路径 + 并查集)
- HDU 1116 Play on Words(欧拉路径(有向图)+并查集)
- Kali Rolling 2016.1 安装无线网卡驱动
- PHP下foreach的作用域,对数组的操作影响
- Sublime Text (3) for PHP Developers
- scrollview嵌套viewpager不能上下滑动的问题
- 【JDK】:Fork-Join框架
- HDU 1116.Play on Words【并查集+欧拉图】【5月16】
- (7)别让异常逃离析构函数
- Mybatis,oracle,ORA-00933: SQL 命令未正确结束
- 使用BenchmarkSQL测试PostgreSQL(http://blog.sina.com.cn/s/blog_448574810101a276.html)
- (8)绝不在构造和析构过程中调用virtual函数
- JGP是如何工作的
- java学习之路
- 剑指Offer--044-扑克牌顺子
- UVa 1471 防线 set/LIS