POJ1386 Play on Words

 

Time Limit: 1000MS

Memory Limit: 10000KB

64bit IO Format: %I64d & %I64u

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.

Source

Central Europe 1999

 

欧拉道路问题。这题欧拉回路或者欧拉道路都算成立。

建好图以后先判一下连通性，如果图不连通，肯定不成立。

↑DFS BFS 并查集都可以

然后是判欧拉路径。

　　如果是欧拉回路，那么所有点的入度等于出度。

　　如果是欧拉路径，那么只有两个点的入度不等于出度，其一是起始点，出度比入度大1，另一个是结束点，入度比出度大1

 

之前一直WA，不知怎么改着改着就对了。

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
const int mxn=1000;
bool vis[mxn];
int n;
int fa[mxn];
int in[mxn],out[mxn];
void init(int n){
    for(int i=1;i<=n;i++)fa[i]=i;
}
int find(int x){
    if(fa[x]==x)return x;
    else return fa[x]=find(fa[x]);
}
char s[1100];
int main(){
    int T;
    scanf("%d",&T);
    while(T--){
        memset(vis,0,sizeof vis);
        memset(in,0,sizeof in);
        memset(out,0,sizeof out);
        scanf("%d",&n);
        init(28);
        int i,j;
        for(i=1;i<=n;i++){
            scanf("%s",s);
            int u=s[0]-'a'+1;
            int v=s[strlen(s)-1]-'a'+1;
            in[v]++;out[u]++;
            vis[u]=vis[v]=1;
            int x=find(u),y=find(v);
            if(x!=y)fa[y]=x;
        }
        int st=0,ed=0;bool flag=0;
        int cnt=0;
        for(i=1;i<=26;i++){
            if(vis[i] && find(i)==i){
                cnt++;
            }
            if(out[i]!=in[i]){//出度不等于入度时判定 
                if(out[i]==in[i]+1){
                    if(!st)st=i;
                    else flag=1;
                }
                else if(in[i]==out[i]+1){
                    if(!ed)ed=i;
                    else flag=1;
                }
                else flag=1;
            }
        }
        if(cnt!=1){//非连通特判 
            printf("The door cannot be opened.\n");
            continue;
            }
        if(flag==1)printf("The door cannot be opened.\n");
        else printf("Ordering is possible.\n");
    }
    return 0;
}