This documentation is automatically generated by online-judge-tools/verification-helper
View the Project on GitHub beet-aizu/library
与えられた根付き木の決定的なハッシュ値を求める
一般の木について同型性判定を行う場合は、まず木の中心や重心を求め、それらを根にすればよい
$O(N \log N)$
#ifndef call_from_test #include <bits/stdc++.h> using namespace std; #endif // http://wwwmayr.in.tum.de/konferenzen/Jass08/courses/1/smal/Smal_Talk.pdf //BEGIN CUT HERE struct AHU{ inline static map<vector<int>, int> I; vector< vector<int> > G; AHU(int n):G(n){} void add_edge(int u,int v){ G[u].emplace_back(v); G[v].emplace_back(u); } int dfs(int v,int p){ vector<int> hs; for(int u:G[v]) if(u!=p) hs.emplace_back(dfs(u,v)); sort(hs.begin(),hs.end()); int sz=I.size(); if(!I.count(hs)) I[hs]=sz; return I[hs]; } int build(int r=0){ return dfs(r,-1); } }; //END CUT HERE #ifndef call_from_test //INSERT ABOVE HERE signed main(){ return 0; } #endif
#line 1 "tree/ahu.cpp" #include <bits/stdc++.h> using namespace std; #endif // http://wwwmayr.in.tum.de/konferenzen/Jass08/courses/1/smal/Smal_Talk.pdf //BEGIN CUT HERE struct AHU{ inline static map<vector<int>, int> I; vector< vector<int> > G; AHU(int n):G(n){} void add_edge(int u,int v){ G[u].emplace_back(v); G[v].emplace_back(u); } int dfs(int v,int p){ vector<int> hs; for(int u:G[v]) if(u!=p) hs.emplace_back(dfs(u,v)); sort(hs.begin(),hs.end()); int sz=I.size(); if(!I.count(hs)) I[hs]=sz; return I[hs]; } int build(int r=0){ return dfs(r,-1); } }; //END CUT HERE #ifndef call_from_test //INSERT ABOVE HERE signed main(){ return 0; } #endif