luogu P4323 [JSOI2016]独特的树叶

 hash 的方式，我觉得这个是找了这么久最好写的hash了，貌似也不容易被卡。

Hash=(Hash[son1]+p)⨁(Hash[son2]+p)⨁……+size∗q+1

#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long LL;
const int maxn = 100005;
const int maxm = 200005;
const ull q = 1000000009;
const ull p = 17;
    int root,ver[maxm],he[maxn],ne[maxm],tot,sz[maxn];
    ull h[maxn];
    void add(int x, int y) {
        ver[++tot] = y;
        ne[tot] = he[x];
        he[x] = tot;
    }
    void dfs1( int x,int fa ){
        h[x] = 0;sz[x]  =1;
        for( int cure = he[x];cure;cure = ne[cure] ){
            int y = ver[cure];
            if( y==fa ) continue;
            dfs1(y,x);
            h[x] ^= h[y] + p;
            sz[x] +=sz[y];
        }
        h[x] += sz[x]*q;
    }
    ull g[maxn];
    void dfs2( int x,int fa ){
        h[x] -= sz[x]*q;
        if( x != root ) h[x] ^= g[x]+p;
        for( int cure = he[x];cure;cure=  ne[cure] ){
            int y = ver[cure];
            if( y == fa ) continue;
            g[y] = (h[x] ^ (h[y]+p)) + (sz[root]-sz[y])*q;
            dfs2(y,x);
        }
        h[x] += sz[root]*q;
    }
int du[maxn];
set<ull> se;
int main(){
    int n;
    scanf("%d",&n);
    root = 1;
    for( int x,y,i = 1;i < n;i++ ){
        scanf("%d%d",&x,&y);
        add( x,y );add( y,x );
    }
    root = 1;
    dfs1(1,0);dfs2(1,0);
    for( int i =1;i <= n;i++ ) se.insert( h[i] );
    tot = 0;for( int i =0;i <= n+1;i++ ) he[i] = 0;
    for( int x,y,i = 1;i <= n;i++ ){
        scanf("%d%d",&x,&y);
        add( x,y );add( y,x );
        du[x]++;du[y]++;
    }
    if( n == 1 ){
        printf("1");
        return 0;
    }
    for( int i = 1;i <= n+1;i++ ){
        if( du[i] != 1 ){
            root = i;
            break;
        }
    }
    dfs1(root,0);
    dfs2(root,0);
    int ans = 0;
    for( int i = 1;i <= n+1;i++ ){
        if( du[i]==1 ){
            if( se.find( g[i] ) != se.end() ){
                ans = i;
                break;
            }
        }
    }
    printf("%d",ans);
    return 0;
}