思路:
因为题目要求的是O(n2)的算法,而且是树不是图,所以思路比较随意,先找每个节点的爸爸,然后记录每个节点有多少个子孙(包括儿子的儿子),然后只有排序之后每个都一样,那树就同构,如果题目要求O(n)的话,就不能找爸爸,直接找儿子,然后深搜。
你还是看代码吧,我感觉我说的不清楚
#include <cstdio>
#include <iostream>
#include <iomanip>
#include <string>
#include <cstdlib>
#include <cstring>
#include <queue>
#include <set>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <stack>
#define INF 0x3f3f3f3f
#define IMAX 2147483646
#define LINF 0x3f3f3f3f3f3f3f3f
#define ll long long
#define ull unsigned long long
#define uint unsigned int
using namespace std;
int t, l[2], c[2][3333],fa[3333],tt, now;
char s[2][3333];
void get(int x) {
now = -1;//表示现在的爹是谁,根节点的爹是-1
memset(fa, -1, sizeof(fa));
for (int i = 0; i < l[x]; i++)
if (s[x][i] == '0') fa[i] = now, now = i;
else now = fa[now];
for (int i = 0; i < l[x]; i++) {
tt = i;
while (tt > -1)
c[x][tt]++,
tt = fa[tt];
}
sort(c[x], c[x] + l[x]);
}
int main() {
scanf("%d", &t);
while (t--) {
scanf("%s%s", s[0], s[1]);
l[0] = strlen(s[0]), l[1] = strlen(s[1]);
if (l[0] != l[1]) {
printf("different\n");
continue;
}
memset(c, 0, sizeof(c));
get(0),get(1);
bool flag = 1;
for (int i = 0; i < l[0]; i++)
if (c[0][i] != c[1][i])flag = 0;
printf("%s\n", flag ? "same" : "different");
}
return 0;
}