传送门
(网上有人)可以证明按题意染色一棵树需要的颜色种数不超过logn。然后O(logn^2)dp即可。
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int MAXN=1e4+2,INF=0x3f3f3f3f;
int head[MAXN],edge=0;
struct EDGE {
int v,nxt;
}e[MAXN<<1];
int n,dp[15][MAXN],ans=INF;
inline int read() {
int x=0;char c=getchar();
while (c<'0'||c>'9') c=getchar();
while (c>='0'&&c<='9') x=x*10+c-'0',c=getchar();
return x;
}
inline void adde(int u,int v) {
e[edge].nxt=head[u],e[edge].v=v,head[u]=edge++;
e[edge].nxt=head[v],e[edge].v=u,head[v]=edge++;
}
void dfs(int p,int fa) {
for (int i=1;i<=14;++i) dp[i][p]=i;
for (int i=head[p];~i;i=e[i].nxt) {
int v=e[i].v;
if (v^fa) {
dfs(v,p);
for (int j=1;j<=14;++j) {
int temp=INF;
for (int k=1;k<=14;++k)
if (j^k) temp=min(temp,dp[k][v]);
dp[j][p]+=temp;
}
}
}
}
int main() {
memset(head,-1,sizeof(head));
n=read();
for (int i=1;i<n;++i) {
int u=read(),v=read();
adde(u,v);
}
dfs(1,0);
for (int i=1;i<=14;++i)
ans=min(ans,dp[i][1]);
printf("%d\n",ans);
return 0;
}