版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/leekerian/article/details/87291584
空树是同构的这,,,
#include <iostream>
#include <cstring>
using namespace std;
int l[111],r[111];
char t[111];
int l1[111],r1[111];
char t1[111];
int main()
{
int n;
cin>>n;
memset(l,0,sizeof(l));
memset(r,0,sizeof(r));
for(int i=0;i<n;i++)
{
getchar();
char a,b,c;
cin>>a>>b>>c;
t[i]=a;
if(b=='-') l[i]=-1;
else l[i]=b-'0';
if(c=='-') r[i]=-1;
else r[i]=c-'0';
}
int m;
cin>>m;
if(!n&&!m){printf("Yes\n");return 0;}
for(int i=0;i<m;i++)
{
getchar();
char a,b,c;
cin>>a>>b>>c;
t1[i]=a;
if(b=='-') l1[i]=-1;
else l1[i]=b-'0';
if(c=='-') r1[i]=-1;
else r1[i]=c-'0';
}
int ok=1;
int ok2=0;
for(int i=0;i<m;i++)
{
int okk=1;
for(int j=0;j<m;j++)
{
if(t[j]==t1[i])
{
ok2=1;
if(t1[l1[i]]!=t[l[j]]&&t1[l1[i]]!=t[r[j]])
{
okk=0;
break;
}
if(t1[r1[i]]!=t[l[j]]&&t1[r1[i]]!=t[r[j]])
{
okk=0;
break;
}
}
}
if(!okk)
{
ok=0;
break;
}
}
if(ok&&ok2)
printf("Yes\n");
else printf("No\n");
return 0;
}