POJ1635 树的最小表示法（判断同构）

Some major cities have subway systems in the form of a tree, i.e. between any pair of stations, there is one and only one way of going by subway. Moreover, most of these cities have a unique central station. Imagine you are a tourist in one of these cities and you want to explore all of the subway system. You start at the central station and pick a subway line at random and jump aboard the subway car. Every time you arrive at a station, you pick one of the subway lines you have not yet travelled on. If there is none left to explore at your current station, you take the subway line back on which you first came to the station, until you eventually have travelled along all of the lines twice,once for each direction. At that point you are back at the central station. Afterwards, all you remember of the order of your exploration is whether you went further away from the central station or back towards it at any given time, i.e. you could encode your tour as a binary string, where 0 encodes taking a subway line getting you one station further away from the central station, and 1 encodes getting you one station closer to the central station. 

Input

On the first line of input is a single positive integer n, telling the number of test scenarios to follow.Each test scenario consists of two lines, each containing a string of the characters '0' and '1' of length at most 3000, both describing a correct exploration tour of a subway tree system.

Output

exploration tours of the same subway tree system, or the text "different" if the two strings cannot be exploration tours of the same subway tree system.

Sample Input

2
0010011101001011
0100011011001011
0100101100100111
0011000111010101

Sample Output

same
different

题意：有根树，然后0表示访问儿子，1表示返回父亲。
题解：只需要将每个节点的子树大小求出，排序，判断是否一样就可以了，然而我是hash的，十分巧妙。

 #include<cmath>
 #include<cstdio>
 #include<vector>
 #include<cstring>
 #include<iostream>
 #include<algorithm>
 #define ll long long
 using namespace std;

 int l;
 string a,b;
 vector<int>e[];
 unsigned ll H[];
 int fa[];

 bool cmp(int a,int b){return H[a]>H[b];}

 void dfs(int x)
 {
     H[x]=;
     for(int i=;i<e[x].size();i++)
         dfs(e[x][i]);
     sort(e[x].begin(),e[x].end(),cmp);//为什么排序，因为根据有序来hash，不然是无法比较
     for(int i=;i<e[x].size();i++)
         H[x]=H[x]*+H[e[x][i]]*;
 }
 unsigned ll cal(string a)
 {
     l=a.length();
     int now=,cnt=;
     for(int i=;i<l;i++)
         if(a[i]=='')
         {
             e[now].push_back(++cnt);
             fa[cnt]=now,now=cnt;
         }
         else now=fa[now];
     dfs();
     for(int i=;i<=cnt;i++)
         e[i].clear();
     return H[];
 }
 int main()
 {
     int cas;scanf("%d",&cas);
     while(cas--)
     {
         cin>>a;cin>>b;
         if(cal(a)==cal(b))puts("same");
         else puts("different");
     }
 }