就是把判断图是不是欧拉通路:判断欧拉通路的,用并查集判断连通性(虽然本题是有向图,但是可以把它看成是无向图),除了起点和终点,其他点入度等出度,起点abs(出度-入度)==1,终点abs(出度-入度)==1;
#include<cstdio>
#include<algorithm>
#include<string.h>
#include<functional>
#include<cmath>
#include<iostream>
#include<vector>
using namespace std;
int num[100002];
int father[26];
int find(int x)
{
return x==father[x]?x:father[x]=find(father[x]);
}
int main()
{
int t,n,len;
scanf("%d",&t);
char str[1001];
while(t--)
{
int in[26]={0};
int out[26]={0};
//memset(xx,0,sizeof(xx));
memset(vis,0,sizeof(vis));
scanf("%d",&n);
for(int i=0;i<26;i++)
father[i]=i;
con=0;
int sum=0;
for(int i=0;i<n;++i)
{
scanf("%s",str);
len=strlen(str);
//M[str[0]-'a'].push_back(str[len-1]-'a');
int xx=find(str[0]-'a'),yy=find(str[len-1]-'a');
if(xx!=yy)
{
father[yy]=xx;
}
in[str[0]-'a']++;
out[str[len-1]-'a']++;
}
/* for(int i=0;i<26;++i)
cout<<" father: "<<father[i]<<" ";*/
int dota;
int ok=0;
for(int i=0;i<26;i++)
if(out[i])
{
dota=find(i);break;
}
for(int i=0;i<26;i++)
{
if(out[i]&&dota!=find(i))
{
ok=1;break;
}
}
for(int i=0;i<26;++i)
if(in[i]!=out[i]&&abs(in[i]-out[i])!=1)
{
ok=1;break;
}
// cout<<endl<<"con ="<<con<<endl;
if(ok)
printf("The door cannot be opened.\n");
else
printf("Ordering is possible.\n");
}
return 0;
}