Play on Words
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 1860 Accepted Submission(s): 566
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.
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.".
Sample Input
3
2
acm
ibm
3
acm
malform
mouse
2
ok
ok
Sample Output
The door cannot be opened.
Ordering is possible.
The door cannot be opened.
/*.特别注意:有两种可能
1--欧拉路径:图中可知除二端点外,其余字母的入度和出度均相等,二端点的出度和入度相差1,
2--整个图就是一个欧拉回路,此时每个端点的入度和出度均相等
代码如下:*/
#include<iostream>
#include<string>
using namespace std;
int in[27];//入度
int father[27];//根节点
int out[27];//出度
int find(int x)
{
while(father[x]!=x)
x=father[x];
return x;
}
void unite(int x,int y)
{
int t1=find(x);
int t2=find(y);
father[t1]=t2;
}
int main()
{
char ch[1002];
int T,i,n,x,y;
//freopen("a.txt","r",stdin);
scanf("%d",&T);
while(T--)
{
for(i=0;i<=26;i++)
{
father[i]=i;
in[i]=0;
out[i]=0;
}
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s",&ch);
x=ch[0]-'a';
y=ch[strlen(ch)-1]-'a';
unite(y,x);
out[y]++;
in[x]++;
}
int num1=0;
int num2=0;
int num3=0;
int m=0;
for(i=0;i<=26;i++)
{
if(in[i]==0&&out[i]==0)continue;
m++;
if(abs(in[i]-out[i])==1)num1++;
if(in[i]==out[i])num3++;
if(find(i)==i)num2++;
}
if(num2==1&&(num3==m||(num3==m-2&&num1==2)))
printf("Ordering is possible.\n");
else
printf("The door cannot be opened.\n");
}
return 0;
}