uva 10129 Play on Words(欧拉道路)
2013-08-01 00:05
429 查看
Play on Words
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.
Input Specification
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 thenumber 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 Specification
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.".
Sample Input
32acmibm3acmmalformmouse2okok
Output for the Sample Input
The door cannot be opened.Ordering is possible.The door cannot be opened.
题目大意:词语接龙,判断所有的词是否的连成一个串。
解题思路:欧拉路的问题,满足 1、所有点的出度与入度的绝对值和不能大于2;
2、所有点是联通的
#include<stdio.h> #include<string.h> #define N 1005 int num[30]; int get_fa(int x){ return num[x] != x?get_fa(num[x]):x;} int abt(int k){ return k > 0?k:-k;} int main(){ int n, t, bo; int f[30], e[30]; char word ; scanf("%d" ,&t); while (t--){ // Init. memset(f, 0, sizeof(f)); memset(e, 0, sizeof(e)); bo = 0; for (int i = 0; i < 26; i++) num[i] = i; // Read. scanf("%d%*c", &n); for (int i = 0; i < n; i++){ gets(word); int a = word[0] - 'a'; int b = word[strlen(word) - 1] - 'a'; f[a]++; e[b]++; num[get_fa(a)] = get_fa(b); } // Find. int god; for (int i = 0; i < 26; i++) if ((f[i] || e[i]) && i == get_fa(i)){ god = i; break; } for (int i = 0; i < 26; i++){ bo += abt(f[i] - e[i]); if ((e[i] || f[i]) && god != get_fa(i)) bo +=10; } if (bo > 2) printf("The door cannot be opened.\n"); else printf("Ordering is possible.\n"); } return 0;}
相关文章推荐
- Uva 10129 - Play on Words 单词接龙 欧拉道路应用
- UVa 10129 Play On Words【欧拉道路 并查集 】
- UVA - 10129 Play on Words(有向欧拉道路存在性)
- Uva 10129 - Play on Words 单词接龙 欧拉道路应用
- UVa 10129 - Play on Words(欧拉道路)
- uva10129 Play On words (有向欧拉道路存在性)
- UVa 10129 - Play on Words, 欧拉道路
- UVA 10129 Play on Words(欧拉道路)
- UVa 10129 - Play on Words 欧拉道路
- UVA-10129 Play on Words (判断欧拉道路的存在性)
- UVA 10129-Play on Words(欧拉通路)
- uva 10129 Play On Words(单词)求欧拉回路或欧拉通路
- 10129 - Play on Words(欧拉道路<有向图>)
- UVa 10129 Play on Words 欧拉通路
- Play on Words 单词 UVA 10129 (欧拉+dfs)
- UVa 10129 (并查集 + 欧拉路径) Play on Words
- HDU 1116 && UVA 10129 && POJ 1386 ------ Play on Words(欧拉路径 + 并查集)
- UVa--10129 Play on Words(欧拉通路)
- UVA 10129 Play on Words (欧拉通路)
- UVA - 10129 Play on Words (欧拉路径+dfs)