牛客 判断t1树中是否含有与t2树拓扑结构完全相同的子树

题目链接：https://www.nowcoder.com/practice/5a41ce17e8194e1688aa83a73137f7ee?tpId=101&tqId=33239&tPage=1&rp=1&ru=/ta/programmer-code-interview-guide&qru=/ta/programmer-code-interview-guide/question-ranking

题目大意

　　略。

分析

　　将两棵树序列化，问题就转化为找子串问题了。

代码如下

 #include <bits/stdc++.h>
 using namespace std;

 #define INIT() ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
 #define Rep(i,n) for (int i = 0; i < (int)(n); ++i)
 #define For(i,s,t) for (int i = (int)(s); i <= (int)(t); ++i)
 #define rFor(i,t,s) for (int i = (int)(t); i >= (int)(s); --i)
 #define ForLL(i, s, t) for (LL i = LL(s); i <= LL(t); ++i)
 #define rForLL(i, t, s) for (LL i = LL(t); i >= LL(s); --i)
 #define foreach(i,c) for (__typeof(c.begin()) i = c.begin(); i != c.end(); ++i)
 #define rforeach(i,c) for (__typeof(c.rbegin()) i = c.rbegin(); i != c.rend(); ++i)

 #define pr(x) cout << #x << " = " << x << "  "
 #define prln(x) cout << #x << " = " << x << endl

 #define LOWBIT(x) ((x)&(-x))

 #define ALL(x) x.begin(),x.end()
 #define INS(x) inserter(x,x.begin())
 #define UNIQUE(x) x.erase(unique(x.begin(), x.end()), x.end())
 #define REMOVE(x, c) x.erase(remove(x.begin(), x.end(), c), x.end()); // 删去 x 中所有 c
 #define TOLOWER(x) transform(x.begin(), x.end(), x.begin(),::tolower);
 #define TOUPPER(x) transform(x.begin(), x.end(), x.begin(),::toupper);

 #define ms0(a) memset(a,0,sizeof(a))
 #define msI(a) memset(a,0x3f,sizeof(a))
 #define msM(a) memset(a,-1,sizeof(a))

 #define MP make_pair
 #define PB push_back
 #define ft first
 #define sd second

 template<typename T1, typename T2>
 istream &operator>>(istream &in, pair<T1, T2> &p) {
     in >> p.first >> p.second;
     return in;
 }

 template<typename T>
 istream &operator>>(istream &in, vector<T> &v) {
     for (auto &x: v)
         in >> x;
     return in;
 }

 template<typename T>
 ostream &operator<<(ostream &out, vector<T> &v) {
     Rep(i, v.size()) out << v[i] << " \n"[i == v.size() - ];
     return out;
 }

 template<typename T1, typename T2>
 ostream &operator<<(ostream &out, const std::pair<T1, T2> &p) {
     out << "[" << p.first << ", " << p.second << "]" << "\n";
     return out;
 }

 inline int gc(){
     static const int BUF = 1e7;
     static char buf[BUF], *bg = buf + BUF, *ed = bg;

     if(bg == ed) fread(bg = buf, , BUF, stdin);
     return *bg++;
 } 

 inline int ri(){
     int x = , f = , c = gc();
     for(; c<||c>; f = c=='-'?-:f, c=gc());
     for(; c>&&c<; x = x* + c - , c=gc());
     return x*f;
 }

 template<class T>
 inline string toString(T x) {
     ostringstream sout;
     sout << x;
     return sout.str();
 }

 inline int toInt(string s) {
     int v;
     istringstream sin(s);
     sin >> v;
     return v;
 }

 //min <= aim <= max
 template<typename T>
 inline bool BETWEEN(const T aim, const T min, const T max) {
     return min <= aim && aim <= max;
 }

 typedef long long LL;
 typedef unsigned long long uLL;
 typedef vector< int > VI;
 typedef vector< bool > VB;
 typedef vector< char > VC;
 typedef vector< double > VD;
 typedef vector< string > VS;
 typedef vector< LL > VL;
 typedef vector< VI > VVI;
 typedef vector< VB > VVB;
 typedef vector< VS > VVS;
 typedef vector< VL > VVL;
 typedef vector< VVI > VVVI;
 typedef vector< VVL > VVVL;
 typedef pair< int, int > PII;
 typedef pair< LL, LL > PLL;
 typedef pair< int, string > PIS;
 typedef pair< string, int > PSI;
 typedef pair< string, string > PSS;
 typedef pair< double, double > PDD;
 typedef vector< PII > VPII;
 typedef vector< PLL > VPLL;
 typedef vector< VPII > VVPII;
 typedef vector< VPLL > VVPLL;
 typedef vector< VS > VVS;
 typedef map< int, int > MII;
 typedef unordered_map< int, int > uMII;
 typedef map< LL, LL > MLL;
 typedef map< string, int > MSI;
 typedef map< int, string > MIS;
 typedef set< int > SI;
 typedef stack< int > SKI;
 typedef deque< int > DQI;
 typedef queue< int > QI;
 typedef priority_queue< int > PQIMax;
 typedef priority_queue< int, VI, greater< int > > PQIMin;
 const double EPS = 1e-;
 const LL inf = 0x7fffffff;
 const LL infLL = 0x7fffffffffffffffLL;
 const LL mod = 1e9 + ;
 const int maxN = 5e5 + ;
 const LL ONE = ;
 const LL evenBits = 0xaaaaaaaaaaaaaaaa;
 const LL oddBits = 0x5555555555555555;

 struct TreeNode {
     int lch = , rch = , val = ;

     void clear() {
         lch = ;
         rch = ;
         val = ;
     }
 };

 int N, root, ans;
 TreeNode tree[maxN];
 string t1, t2; 

 void serialize(string &s) {
     scanf("%d%d", &N, &root);
     Rep(i, N + ) tree[i].clear();
     Rep(i, N) {
         int fa, lch, rch;
         scanf("%d%d%d", &fa, &lch, &rch);

         tree[fa].lch = lch;
         tree[fa].rch = rch;
     }

     SKI sk;
     sk.push(root);

     while(!sk.empty()) {
         int rt = sk.top(); sk.pop();

         s += toString(rt);
         if(!rt) continue;

         sk.push(tree[rt].rch);
         sk.push(tree[rt].lch);
     }
 }

 void KMP_next(const string &T, VI &nxt) {
     nxt.resize(T.size());

     int t = nxt[] = -, i = ;
     while(i < T.size() - ) {
         ( > t || T[i] == T[t]) ? nxt[++i] = ++t : t = nxt[t];
     }
 }

 bool KMP(const string &S, const string &T) {
     VI nxt;
     int i = , j = ;
     KMP_next(T, nxt);

     while(i < (int)S.size() && j < (int)T.size()) {
         if( > j || S[i] == T[j]) ++i, ++j;
         else j = nxt[j];
     }
     return j == T.size();
 }

 int main(){
     //freopen("MyOutput.txt","w",stdout);
     //freopen("input.txt","r",stdin);
     //INIT();
     serialize(t1);
     serialize(t2);

     if(KMP(t1, t2)) printf("true\n");
     else printf("false\n");
     return ;
 }