UVa 10129 - Play on Words

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 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 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

3

2

acm

ibm

3

acm

malform

mouse

2

ok

ok

Output for the Sample Input

The door cannot be opened.

Ordering is possible.

The door cannot be opened.

 这道题目很能锻炼人的思维，并查集，欧拉路的判断，这些都是很基本的算法，这道题目就是用这种方法，但是在看解题报告之前却不会做，正确的解题时把字符串的头字母和尾字母看成是两个点这个字符串则看成是路，这样这个问题就转换长了欧拉路的判断

#include <iostream>
#include <memory.h>
#include <string>
using namespace std;
int status[30];
int in[30],out[30];
int a[30];
int main()
{
	void f(int x,int y);
	int i,n,s,t,l;
	int x,y,s2,s3;
	string s1;
	cin>>t;
	while(t--)
	{
		cin>>n;
		memset(status,0,sizeof(status));
		memset(in,0,sizeof(in));
		memset(out,0,sizeof(out));
		for(i=0;i<=25;i++)
		{
			a[i]=i;
		}
		while(n--)
		{
			cin>>s1;
			l=s1.size();
			x=s1[0]-'a'; y=s1[l-1]-'a';
			status[x]=1; status[y]=1;
			in[y]++; out[x]++; 
			f(x,y);
		}
		s=0;
		for(i=0;i<=25;i++)
		{
			if(status[i]==1&&a[i]==i)
			{
				s+=1;
			}
		}
		if(s==1)
		{
			s2=0;  s3=0;
			for(i=0;i<=25;i++)
			{
				if(status[i]==1)
				{
					if(in[i]==out[i])
					{
						;
					}else if(in[i]-out[i]==1)
					{
						s2+=1;
						if(s2>1)
						{
							break;
						}
					}else if(in[i]-out[i]==-1)
					{
						s3++;
						if(s3>1)
						{
							break;
						}
					}else
					{
						break;
					}
				}
			}
			if(i==26)
			{
				cout<<"Ordering is possible."<<endl;
			}else
			{
				cout<<"The door cannot be opened."<<endl;
			}
		}else
		{
			cout<<"The door cannot be opened."<<endl;
		}
	}
	return 0;
}
int find(int x)
{
	int k1,k2;
	k1=x;
	while(k1!=a[k1])
	{
		k1=a[k1];
	}
	while(x!=a[x])
	{
		k2=a[x];
		a[x]=k1;
		x=k2;
	}
	return k1;
}
void f(int x,int y)
{
	x=find(x);
	y=find(y);
	if(x!=y)
	{
		a[x]=y;
	}
}