【有向图欧拉回路判断】Play on Words

Play on Words

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 10740		Accepted: 3644

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.

题目大意：输入N个字符串，处理这些字符串，相同的字符可以头尾相接，能否把N个字符串全部接成一串。

解法：
　　因为要连个两个字符串只和他头尾字母有关，所以，我们可以把每个字符串看作一条边，每一个连接点当作一个点
这条边的起点是这字符串首字母，终点就是这字符串的尾字母，然后根据这N条边，以及所连接点构成了一幅图，
然后就是求这幅图能否构成欧拉路径、

代码:2015.8.13

 1 #include <iostream>
 2 #include <stdio.h>
 3 #include <string.h>
 4 #include <algorithm>
 5 using namespace std;
 6 #define Max 1010
 7 #define M 30
 8 char Str[Max];
 9 int EDG_Count;/*统计边数*/
10 int ID[M];/*并查集判断是否为同一幅图*/
11 int InD[M];/*入度*/
12 int OuD[M];/*出度*/
13 int Find(int x)
14 {
15     if(x!=ID[x])ID[x]=Find(ID[x]);
16     return ID[x];
17 }
18 void Cread()
19 {
20     for(int i=0;i<26;i++)
21     {
22         ID[i]=i;
23         InD[i]=OuD[i]=0;
24     }EDG_Count=0;
25 }
26 void Add(int a,int b)
27 {
28     int A=Find(a);
29     int B=Find(b);
30     if(A!=B){ID[A]=B;EDG_Count++;}
31 }
32 
33 void Update(char str[])
34 {
35     int Len=strlen(str);
36     int a=str[0]-'a';
37     int b=str[Len-1]-'a';
38     Add(a,b);
39     OuD[a]++;InD[b]++;
40 }
41 
42 int main()
43 {
44     int T,N,i,sign1,sign2,sign3,Count;
45     scanf("%d",&T);
46     while(T--)
47     {
48         scanf("%d",&N);
49         Cread();
50         for(i=1;i<=N;i++)
51         {
52             scanf(" %s",Str);
53             Update(Str);
54         }
55         sign1=sign2=sign3=Count=0;
56         for(i=0;i<26;i++)
57         {
58             if(InD[i]||OuD[i])Count++;
59             if(InD[i]==OuD[i]+1)sign1++;
60             if(InD[i]==OuD[i]+1)sign2++;
61             if(InD[i]&&InD[i]==OuD[i])sign3++;
62         }
63         if(EDG_Count!=Count-1)/*是否构成一幅图*/
64             {printf("The door cannot be opened.\n");continue;}
65         if(sign1==sign2&&sign1==1&&sign3==Count-2)/*链的情况*/
66             printf("Ordering is possible.\n");
67         else if(sign1==sign2&&sign1==0&&sign3==Count) /*环的情况*/
68             printf("Ordering is possible.\n");
69         else
70             printf("The door cannot be opened.\n");
71     }
72     return 0;
73 }

View Code

 

转载于:https://www.cnblogs.com/Wurq/articles/4727336.html