首页 > 代码库 > (判断欧拉回路)poj 1368
(判断欧拉回路)poj 1368
Play on Words
| Time Limit: 1000MS | Memory Limit: 10000K | |
| Total Submissions: 10056 | Accepted: 3447 |
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<cstring>#include<cmath>#include<algorithm>#include<cstdlib>#include<string>#include<vector>using namespace std;vector<int> e[27];int tt,n,in[27],out[27],vis[27];char s[100010];void dfs(int x){ vis[x]=1; for(int i=0;i<e[x].size();i++) if(vis[e[x][i]]==0) dfs(e[x][i]);}bool ok(int x){ dfs(x); for(int i=0;i<26;i++) if(vis[i]==0&&e[i].size()!=0) return false; return true;}int main(){ scanf("%d",&tt); while(tt--) { memset(in,0,sizeof(in)); memset(out,0,sizeof(out)); memset(vis,0,sizeof(vis)); int len,a,b; scanf("%d",&n); for(int i=0;i<27;i++) e[i].clear(); for(int i=0;i<n;i++) { scanf("%s",s); len=strlen(s); a=s[0]-‘a‘,b=s[len-1]-‘a‘; out[a]++,in[b]++; e[a].push_back(b); e[b].push_back(a); } if(!ok(a)) { printf("The door cannot be opened.\n"); continue; } bool flag=false; int j; for(j=0;j<26;j++) { if(in[j]!=out[j]) { if(in[j]<out[j]) { if(in[j]-out[j]==-1&&flag==0) { flag=1; } else { break; } } } } if(j<26) printf("The door cannot be opened.\n"); else printf("Ordering is possible.\n"); } return 0;}注意连通性
(判断欧拉回路)poj 1368
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。