UVa-10129

题目

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

Input：

3
2
acm
ibm
3
acm
malform
mouse
2
ok
ok

Output：

The door cannot be opened.
Ordering is possible.
The door cannot be opened.

【解析】

题目的大致意思其实就是给我几个单词判断能不能组成一个序列，使得每一个单词和上一个单词的最后一个字母相同，输入中可以用重复的单词。比如样例2当中，acm和malform，acm中的m和malform中的第一个m是相同的所以可以接下去。后面一次类推。这道题可以把它看成是一个欧拉路径，除了起点和终点，其余各个点的进和出的次数要相同，也就是说除了起点和终点，其余的点度数都要是偶数。如果一个无向图是连通的，最多只有两个奇数点，从一个奇数点出发，另一个奇数点终止。此处附上刘汝佳老师的代码思路。

#include<cstdio>
#include<cstring>
#include<vector>
using namespace std;
int pa[256];
int find(int x)
{
    return pa[x]!=x?pa[x]=find(pa[x]):x;//并查集找根结点
}
int used[256], deg[256];
int main() {
  int T;
  scanf("%d", &T);
  while(T--) {
    int n;
    char word[1010];
    scanf("%d", &n);
    memset(used, 0, sizeof(used));
    memset(deg, 0, sizeof(deg));
    for(int ch = 'a'; ch <= 'z'; ch++)
        pa[ch] = ch; // 初始化并查集,把每一个点的根结点都设置成自己
    int cc = 26; // 字母总的个数
    for(int i = 0; i < n; i++) {
      scanf("%s", word);
      char c1 = word[0], c2 = word[strlen(word)-1];
      deg[c1]++;//这里其实就是判断是否除了起始点和终点其余的点度数是不是偶数
      deg[c2]--;
      used[c1] = used[c2] = 1;
      int s1 = find(c1), s2 = find(c2);
      if(s1 != s2)
        {
            pa[s1]=s2;/*比如说我们输入的是acm malforc,fousk,
            这里26是减了3，cc变成了23，但是出现的单词数有a,m,c,f,k
            有5个如果能连起来的时候则是四个，然后下面减去未出现的要
            减去22个，最后cc剩下1如果cc剩下的不是1，那就不可能构成
            欧拉路径了,这里如果是acm,malform,mouse，只需要减去两个，因为有一个地方首尾都是m
            它们的pa[m]相同，所以这个例子在这里只用减去2*/
            cc--;
        }
    }//意思就是cc减去的那部分+1就等于输入的单词序列首尾不同字母的个数如果满足这个条件就成立了一部分了
    vector<int> d;
    for(int ch = 'a'; ch <= 'z'; ch++) {
      if(!used[ch])
      {
          cc--;
       }
      else if(deg[ch] != 0)
        d.push_back(deg[ch]);//如果最后又剩下的就是初始点和终点肯定要是这两个奇数点了
    }
    bool flag=false;
    if(cc == 1 && (d.empty() || (d.size() == 2 && (d[0] == 1 || d[0] == -1))))//要么都是偶数点，要么就有两个奇数点
        flag= true;
    if(flag)
    printf("Ordering is possible.\n");
    else
    printf("The door cannot be opened.\n");
  }
  return 0;
}