Play on Words

可知只有一个祖先，且最多只有两个点的入度，出度不一样，且差值为1.

#include<string.h>
#include<stdio.h>
using namespace std;
const int MAX = 105;
int in[MAX],out[MAX],pre[MAX];

int find(int x)
{
    return x==pre[x]?x:pre[x]=find(pre[x]);
}
void Join(int x, int y)
{
    int fx = find(x);
    int fy = find(y);
    if(fx != fy)pre[x]=y;
}
int  judge()
{
    int cnt=0;
    for(int i=0; i<27; i++)
        if((in[i] || out[i]) && pre[i]==i ) cnt++;
    if(cnt!=1) 	return 0;
    int x=0,y=0;
    for(int i=0; i<27; i++)
    {
        if(in[i]==out[i]+1) x++;
        else if(in[i]+1==out[i]) y++;
        else if(in[i]!=out[i]) return 0;
    }
    if(x && y && x+y>2) return 0;
    return 1;
}

int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int n;
        scanf("%d", &n);
        for(int i=0; i<27; i++)
        {
            in[i]=0;
            out[i]=0;
            pre[i]=i;
        }
        for(int i=0;i<n;i++)
        {
            char  s[1002];
            scanf("%s",s);
            out[s[0]-'a']++;
            in[s[strlen(s)-1]-'a']++;
            Join(s[0]-'a',s[strlen(s)-1]-'a');
        }
        if(judge())
            printf("Ordering is possible.\n");
        else
            printf("The door cannot be opened.\n");
    }
    return 0;
}