POJ 1386 欧拉回路

#include"iostream"
#include"stdio.h"
#include"vector"
#include"functional"
#include"string"
#include"cstring"
#include"algorithm"
#include"queue"
#include"set"
#define f1 cout<<"fuck1"<<endl;
#define f2 cout<<"fuck2"<<endl;
using namespace std;
typedef pair<int,int> pii;
typedef vector<int> vi;
const int maxn=200;
set<int>Set;
int pre[maxn];
int rk[maxn];
int in[maxn];
int out[maxn];
void init(int n)
{
    for(int i=0;i<n;i++)
        pre[i]=i;
}
int find(int x)
{
    return pre[x]==x?x:pre[x]=find(pre[x]);
}
void join(int x,int y)
{
    int fx=find(x),fy=find(y);
    if(fx!=fy)
    {
        pre[fy]=fx;
    }
}
int main()
{
    //freopen("b.in","r",stdin);
   // freopen("b.out","w",stdout);
    int ca;
    cin>>ca;
    while(ca--)
    {
        Set.clear();
        memset(in,0,sizeof(in));
        memset(out,0,sizeof(out));
        init(30);
        int i,n;
        cin>>n;
        char a[1050];
        int root;
        for(i=0;i<n;i++)
        {
            scanf("%s",a);
            int u,v;
            u=a[0]-'a';
            v=a[strlen(a)-1]-'a';
            join(u,v);
            in[v]++;
            out[u]++;
            Set.insert(u);Set.insert(v);
            root=pre[u];
        }
        int s,t;s=t=0;int flag=1;
        /*
        cout<<"root"<<":"<<root<<endl;
        for(set<int>::iterator p=Set.begin();p!=Set.end();p++)
        {
            cout<<"*p:"<<*p<<" pre:"<<pre[*p]<<endl;
            if(*p==pre[*p]) cout<<"wo kao!"<<endl;
        }
        cout<<endl;
        */
        int ans=0;
        for(set<int>::iterator p=Set.begin();p!=Set.end();p++)
        {
            if(pre[*p]==*p) {ans++;if(ans>2){ flag=0;break;}}
            if(in[*p]-out[*p]==1) t++;
            else if(out[*p]-in[*p]==1) s++;
            else if(abs(in[*p]-out[*p])>1) { flag=0;break;}
        }
        //cout<<flag<<" "<<s<<" "<<t<<" "<<ans<<endl;
        if(flag==0||s>1||t>1||(s!=t)||ans>1) cout<<"The door cannot be opened."<<endl;
        else cout<<"Ordering is possible."<<endl;
    }
}