poj1386
来源:互联网 发布:ios编程教程 编辑:程序博客网 时间:2024/06/14 10:13
http://poj.org/problem?id=1386
Play on Words
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 10808 Accepted: 3675
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 <string.h>#include <stdio.h>using namespace std;int p[29];int find(int x){ if(p[x]>=0) { p[x]=find(p[x]); return p[x]; } return x;}void unio(int a,int b){ int x=find(a); int y=find(b); if(x==y) return; int xx=p[x]; int yy=p[y]; if(xx<yy) { p[y]=x; p[x]+=yy; } else { p[x]=y; p[y]+=xx; }}int main(){ int t,n; char str[1050]; int in[29],out[29],used[29]; cin>>t; while(t--) { for(int i=0; i<26; i++) { in[i]=0; used[i]=0; p[i]=-1; out[i]=0; } scanf("%d",&n); for(int i=0; i<n; i++) { scanf("%s",str); int len=strlen(str); int x=str[0]-'a'; int y=str[len-1]-'a'; used[x]=1; used[y]=1; in[y]++; out[x]++; unio(x,y); } int cas=0; for(int i=0; i<26; i++) { if(used[i]&&p[i]<0) cas++; } //cout<<cas<<endl; if(cas>1) { printf("The door cannot be opened.\n"); continue; } int j; int p=0,q=0; for(j=0; j<26; j++) { if(used[j]&&in[j]!=out[j]) { if(in[j]-out[j]==1) q++; else if(out[j]-in[j]==1) p++; else break; } } if(j<25) printf("The door cannot be opened.\n"); else if((p==0&&q==0)||(q==1&&p==1)) printf("Ordering is possible.\n"); else printf("The door cannot be opened.\n"); } return 0;}
0 0
- poj1386
- poj1386
- poj1386判欧拉路
- hdu1116&&poj1386
- poj1386(Play on Words)
- poj1386 Play on Words
- poj1386 Play on Words
- POJ1386 Play on Words
- Poj1386 Play on Words
- poj1386 Play on words
- poj1386 Paly onWords
- poj1386&poj2513 欧拉回路
- poj1386(欧拉回路)
- poj1386 Play on Words【欧拉图】
- poj1386 Play on Words (欧拉回路)
- hdu1116&poj1386 并查集加欧拉路径的判断
- POJ1386 Play on Words 欧拉路径
- [POJ1386]Play on Words 做题笔记
- codeforces 567D 二分
- STUN检测NAT类型
- C#中值类型和引用类型的区别深度分析
- 双色球 Java
- 为了美好的明天,而改变自己
- poj1386
- 指针 学习笔记
- 如何通过Html网页调用本地安卓app?
- jsp的select控件,怎么用EL表达式自动选中
- Hadoop hdfs 介绍 二
- 值得看看的文章
- 固定滚动JS源码
- 坚持坚持,再大的困难也就过去了
- Android 水波纹点击效果(Ripple Effect)