Play on Words

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个单词，每个单词的首尾可不可以全部连接起来形成一条线或者成环

解法： 就是求欧拉回路，并且只有一条，联通分量为一，即判断首节点入度比出度小1，尾节点入度比出度大1，当然首尾也可以相等的

<span style="font-size:18px;">#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
#include<queue>
#include<vector>
using namespace std;
int in[30],out[30],vis[30],father[30];//记录入度，记录出度，标记i出没出现，判断是不是在一条通路上
int find(int a)
{
    if(a!=father[a])
        return father[a]=find(father[a]);
    return father[a];
}
int main()
{
    int t,n,i,m;
    char ch[1001];
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        memset(in,0,sizeof(in));
        memset(out,0,sizeof(out));
        memset(vis,0,sizeof(vis));
        for(i=1;i<=26;i++)
            father[i]=i;
        for(i=1;i<=n;i++)
        {
            scanf("%s",ch);
            m=strlen(ch);
            int x=ch[0]-'a'+1;
            int y=ch[m-1]-'a'+1;
            father[x]=father[y]=find(x);//把所有点的祖先节点全部变为头结点
            out[x]++;
            in[y]++;
            vis[x]=vis[y]=1;
        }
        int flag=0;
        for(i=1;i<=26;i++)//如果祖先节点只有一个，说明只有一条通路，或则就有多条
        {
            if(vis[i]==1&&father[i]==i)
                flag++;
        }
        if(flag>1)
        {
            printf("The door cannot be opened.\n");
            continue;
        }
        int a,b,c;
        a=0;
        b=0;
        c=0;
        for(i=1;i<=26;i++)
        {
            if(vis[i]==1&&out[i]!=in[i])//判断首尾节点个数
            {
                if(out[i]+1==in[i])
                    a++;//首节点
                else if(out[i]==in[i]+1)
                    b++;//尾节点
                else
                    c++;//若c>0，说明不可能联通了
            }
        }
        if(c>0)
        {
            printf("The door cannot be opened.\n");
            continue;
        }
       if(a==1&&b==1)
        printf("Ordering is possible.\n");
       else if(a==0&&b==0)//说明首节点等于尾节点
        printf("Ordering is possible.\n");
       else
        printf("The door cannot be opened.\n");
    }
    return 0;
}
</span>