1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117
| const int N=510,M=N*2,mod=1e9+7; int n,m,k,a[N]; int f[N][N][2]; int t1[N],t2[N]; bool vis[N][N]; vector<int> edge1[N],edge2[N]; vector<int> son1,son2; #define INF 1e8
int match[N], pre[N]; LL mp[N][N], ex[N], ey[N], slack[N]; bool st[N];
void check(int u); LL KM();
void dfs(int u,int fa1,int v,int fa2){ if(vis[u][v]) return ; for(auto u1:edge1[u]) if(u1!=fa1) for(auto v1:edge2[v]) if(v1!=fa2) if(!vis[u1][v1]) dfs(u1, u, v1, v); for(auto u1:edge1[u]) if(u1!=fa1&&!vis[u1][v]) dfs(u1, u, v, fa2); for(auto v1:edge2[v]) if(v1!=fa2&&!vis[u][v1]) dfs(u, fa1, v1, v); son1.clear(); for(auto u1:edge1[u]) if(u1!=fa1) son1.push_back(u1),f[u][v][0]=max(f[u][v][0], f[u1][v][0]); son2.clear(); for(auto v1:edge2[v]) if(v1!=fa2) son2.push_back(v1),f[u][v][0]=max(f[u][v][0], f[u][v1][0]); bool flag=0; if(son1.size()>son2.size()) son1.swap(son2),flag=1; for(auto u1:edge1[u]) if(u1!=fa1) for(auto v1:edge2[v]) if(v1!=fa2) flag?mp[v1][u1]=f[u1][v1][0]:mp[u1][v1]=f[u1][v1][0];
vis[u][v]=1; f[u][v][1]=t1[u]==t2[v]?KM()+1:0; f[u][v][0]=max(f[u][v][0], f[u][v][1]); for(auto u1:edge1[u]) if(u1!=fa1) for(auto v1:edge2[v]) if(u1!=fa2) flag?mp[v1][u1]=0:mp[u1][v1]=0; }
void solve(){ n=read(),m=read(); rep(i,1,n) t1[i]=read(); rep(i,1,m) t2[i]=read(); rep(i,1,n-1){ int u=read(),v=read(); edge1[u].push_back(v),edge1[v].push_back(u); } rep(i,1,m-1){ int u=read(),v=read(); edge2[u].push_back(v),edge2[v].push_back(u); } dfs(1, 0, 1, 0); print(f[1][1][0]); }
signed main(){ solve(); return 0; }
void check(int u){ LL x, y = 0, yy = 0, delta; pre[0] = 0; for(auto i: son2) pre[i] = 0; for(auto i: son2) slack[i] = INF; match[y] = u; while(1){ x = match[y], delta = INF, st[y] = 1; for(auto i: son2){ if(st[i])continue; if(slack[i] > ex[x] + ey[i] - mp[x][i]){ slack[i] = ex[x] + ey[i] - mp[x][i]; pre[i] = y; } if(slack[i] < delta) {delta = slack[i];yy = i;} }if(st[0]) ex[match[0]] -= delta, ey[0] += delta; else slack[0] -= delta; for(auto i: son2){ if(st[i]) ex[match[i]] -= delta, ey[i] += delta; else slack[i] -= delta; } y = yy; if(match[y]==-1)break; } while(y){match[y] = match[pre[y]];y = pre[y];} }
LL KM() { for(auto i: son2) match[i] = -1; match[0] = -1; for(auto i: son1) ex[i] = ey[i] = 0; for(auto i: son2) ex[i] = ey[i] = 0; ex[0] = ey[0] = 0; for(auto i: son1){ st[0] = 0; for(auto j: son2) st[j] = 0; check(i); } LL res = 0; for(auto i: son2) if(match[i] != -1) res += mp[match[i]][i]; return res; }
|