[BZOJ1086][SCOI2005]王室联邦

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <algorithm>
using namespace std;

const int BufferSize = 1 << 16;
char buffer[BufferSize], *Head, *Tail;
inline char Getchar() {
	if(Head == Tail) {
		int l = fread(buffer, 1, BufferSize, stdin);
		Tail = (Head = buffer) + l;
	}
	return *Head++;
}
int read() {
	int x = 0, f = 1; char c = Getchar();
	while(!isdigit(c)){ if(c == ‘-‘) f = -1; c = Getchar(); }
	while(isdigit(c)){ x = x * 10 + c - ‘0‘; c = Getchar(); }
	return x * f;
}

#define maxn 1010
#define maxm 2010
#define maxbl 1010

int n, B, m, head[maxn], nxt[maxm], to[maxm];

void AddEdge(int a, int b) {
	to[++m] = b; nxt[m] = head[a]; head[a] = m;
	swap(a, b);
	to[++m] = b; nxt[m] = head[a]; head[a] = m;
	return ;
}

int S[maxn], top, blid[maxn], cb, rt[maxbl];
void build(int u, int fa) {
	int bot = top;
	for(int e = head[u]; e; e = nxt[e]) if(to[e] != fa) {
		build(to[e], u);
		if(top - bot >= B) {
			rt[++cb] = u;
			while(top > bot) blid[S[top--]] = cb;
		}
	}
	S[++top] = u;
	return ;
}

int main() {
	n = read(); B = read();
	for(int i = 1; i < n; i++) {
		int a = read(), b = read();
		AddEdge(a, b);
	}
	
	build(1, 0);
	while(top) blid[S[top--]] = cb;
	
	printf("%d\n", cb);
	for(int i = 1; i <= n; i++) printf("%d%c", blid[i], i < n ? ‘ ‘ : ‘\n‘);
	for(int i = 1; i <= cb; i++) printf("%d%c", rt[i], i < n ? ‘ ‘ : ‘\n‘);
	
	return 0;
}