[BZOJ2815][ZJOI2012]灾难

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

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 65540
#define maxm 3000010
#define maxlog 16

int n, m, head[maxn], nxt[maxm], to[maxm], reM, reH[maxn], reN[maxm], reT[maxm];

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

int ind[maxn], Q[maxn], hd, tl;

struct Tree {
	int rt, fa[maxn][maxlog], dep[maxn], siz[maxn];
	int m, head[maxn], nxt[maxm], to[maxm];
	
	void init(int _rt) {
		rt = _rt;
		memset(dep, 0, sizeof(dep));
		memset(fa, 0, sizeof(fa));
		return ;
	}
	
	int lca(int a, int b) {
		if(dep[a] < dep[b]) swap(a, b);
		for(int i = maxlog - 1; i >= 0; i--) if(dep[a] - (1 << i) >= dep[b]) a = fa[a][i];
		for(int i = maxlog - 1; i >= 0; i--) if(fa[a][i] != fa[b][i]) a = fa[a][i], b = fa[b][i];
		return a == b ? a : fa[b][0];
	}
	
	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 ;
	}
	void add(int u, int pa) {
		AddEdge(u, pa);
		dep[u] = dep[pa] + 1;
		fa[u][0] = pa;
		for(int i = 1; i < maxlog; i++) fa[u][i] = fa[fa[u][i-1]][i-1];
		return ;
	}
	
	void dfs(int u) {
		siz[u] = 1;
		for(int e = head[u]; e; e = nxt[e]) if(to[e] != fa[u][0])
			dfs(to[e]), siz[u] += siz[to[e]];
		return ;
	}
	void build() { return dfs(rt); }
} sol;

int main() {
	n = read();
	for(int i = 1; i <= n; i++) {
		int x = read();
		while(x) {
			AddEdge(x, i); ind[i]++;
			x = read();
		}
	}
	
	for(int i = 1; i <= n; i++) if(!ind[i]) AddEdge(n + 1, i), ind[i]++; n++;
	/*for(int u = 1; u <= n; u++) {
		printf("%d to\n", u);
		for(int e = head[u]; e; e = nxt[e]) printf("%d ", to[e]);
		putchar(‘\n‘);
	} // */
	Q[++tl] = n;
	while(hd < tl) {
		int u = Q[++hd];
		for(int e = head[u]; e; e = nxt[e])
			if(!--ind[to[e]]) Q[++tl] = to[e];
	}
	sol.init(n);
	for(int i = 2; i <= tl; i++) {
		int u = Q[i], v = 0;
		for(int e = reH[u]; e; e = reN[e])
			if(v) v = sol.lca(v, reT[e]);
			else v = reT[e];
		sol.add(u, v);
//		printf("add to tree: %d %d\n", u, v);
	}
	sol.build();
	
	for(int i = 1; i < n; i++) printf("%d\n", sol.siz[i] - 1);
	
	return 0;
}