Play on Words UVA10129

Play on Words

Some of the secret doors contain avery 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 alarge 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 asequence (according to the given rule) and consequently to open the door.

Input Specification

The input consists ofTtest cases. The number of them (T) is given on the first line of the input file. Each test case begins with a line containing asingle integer numberNthat indicates the number of plates (1 <= N <= 100000). Then exactlyNlines follow, each containing asingle 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 asequence 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 thesentence "Ordering is possible.". Otherwise, output thesentence "The door cannot be opened.".

Sample Input

32acmibm3acmmalformmouse2okok

Output for the Sample Input

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

又是一道可以建模成欧拉图的问题，看题目第一感觉就是搜索或者递归，但是没有想到建模成欧拉图，对欧拉的图的判断还是太不清楚了，要多练练。

#include<iostream>
#include<cstring>
#include<string>

using namespace std;

int tag,m;
int in[30],out[30];
int grid[30][30],vis[30][30];

void dfs(int k)
{
    for(int i=0;i<26;i++)
    {
        if(grid[k][i]&&vis[k][i]==0)
        {
            vis[k][i]=1;
            dfs(i);
        }
    }
}

int main()
{
    int n;
    cin>>n;
    while(n--)
    {
        memset(in,0,sizeof(in));
        memset(out,0,sizeof(out));
        memset(grid,0,sizeof(grid));
        memset(vis,0,sizeof(vis));
        int i,j;
        string str;
        cin>>m;
        for(i=0;i<m;i++)
        {
            cin>>str;
            int x=str[0]-'a';
            int y=str[str.size()-1]-'a';
            out[x]++;
            in[y]++;
            grid[x][y]=1;
            grid[y][x]=1;
        }
        tag=1;
        if(m>1)
        {
            for(i=0;i<26;i++)
            {
                if(in[i]-out[i]>1||out[i]-in[i]>1)
                {
                    tag=0;
                    break;
                }
            }
            for(i=0;i<26;i++)
            {
                if(out[i]>0)
                {
                    dfs(i);
                    break;
                }
            }
            for(i=0;i<26;i++)
            {
                for(j=0;j<26;j++)
                {
                    if(grid[i][j]&&vis[i][j]==0)
                    {
                        tag=0;
                    }
                }
            }
        }
        if(tag) cout<<"Ordering is possible."<<endl;
        else cout<<"The door cannot be opened."<<endl;
    }
    return 0;
}