题目大意:
给一棵
n
个节点的树,以及一个整数
分析:
对于每个点的儿子节点,一旦一部分儿子节点的数量
≥B
,将其分成一个集合,其余剩下没有处理的节点归入最后一个集合,可以证明一定不会
≥3∗B
,对于
n<B
判断无解即可。
AC code:
#include <cstdio>
#include <vector>
#define pb push_back
#define ONLINE_JUDGE
using namespace std;
const int MAXN = 10009;
int n, b, s[MAXN];
struct Ugraph
{
int size;
int head[MAXN];
int to[MAXN<<1];
int ne[MAXN<<1];
Ugraph(){size = 1;}
void add_edge(int u, int v)
{
to[size] = v, ne[size] = head[u], head[u] = size++;
to[size] = u, ne[size] = head[v], head[v] = size++;
}
}G;
int capital[MAXN];
int label[MAXN], tot;
void change(int x, int fa, int lab)
{
if(label[x]) return ;
label[x] = lab;
for(int i = G.head[x]; i; i = G.ne[i])
if(G.to[i] != fa) change(G.to[i], x, lab);
}
void dfs(int x, int fa)
{
int tmp = 0;
vector<int> son;
for(int i = G.head[x]; i; i = G.ne[i])
{
int to = G.to[i];
if(to == fa) continue;
dfs(to, x);
tmp += s[to];
son.pb(to);
if(tmp < b) continue;
capital[++tot] = x;
for(int j = 0; j < son.size(); ++j)
change(son[j], x, tot);
son.clear();
tmp = 0;
}
s[x] = 1+tmp;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("sgu216.in", "r", stdin);
freopen("sgu216.out", "w", stdout);
#endif
scanf("%d%d", &n, &b);
for(int i = 1; i < n; ++i)
{
int u, v;
scanf("%d%d", &u, &v);
G.add_edge(u, v);
}
if(n < b) puts("0");
else if(n <= 3*b)
{
puts("1");printf("1");
for(int i = 2; i <= n; ++i)
printf(" 1");
puts(""), puts("1");
}
else
{
dfs(1, 0);
for(int i = 1; i <= n; ++i)
if(!label[i]) label[i] = tot;
printf("%d\n", tot);
printf("%d", label[1]);
for(int i = 2; i <= n; ++i)
printf(" %d", label[i]);
puts("");
printf("%d", capital[1]);
for(int i = 2; i <= tot; ++i)
printf(" %d", capital[i]);
puts("");
}
#ifndef ONLINE_JUDGE
fclose(stdin);
fclose(stdout);
#endif
return 0;
}