CodeForces 1009F :Dominant Indices dsu on tree + 线段树合并

传送门

题意

求每个点的子树中哪一层节点数最多，如果有节点数最多不唯一，取层数最小的。

分析

根上一题一样，也是两种做法

代码

dsu on tree

#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 1e6 + 10,M = N * 2;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
	char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
	while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
int h[N],e[M],ne[M],idx;
int dep[N],sz[N],son[N],cnt[N];
int n,Son,mx,sum;
int ans[N];

void add(int x,int y){
	ne[idx] = h[x],e[idx] = y,h[x] = idx++;
}

void dfs(int u, int fa) {
	dep[u] = dep[fa] + 1;
	sz[u] = 1;
	for (int i = h[u]; ~i; i = ne[i]) {
		int j = e[i];
		if (j ==  fa) continue;
		dfs(j, u);
		sz[u] += sz[j];
		if (sz[son[u]] < sz[j]) son[u] = j;
	}
}

void cal(int u, int fa, int st) {
	if (st == 1) {
		cnt[dep[u]]++;
		if(cnt[dep[u]] > mx) mx = cnt[dep[u]],sum = dep[u];
		else if(cnt[dep[u]] == mx) sum = min(sum,dep[u]);
		for (int i = h[u]; ~i; i = ne[i]) {
			if (e[i] != Son && e[i] != fa)
				cal(e[i], u, st);
		}
	}
	else {
		cnt[dep[u]]--;
		for (int i = h[u]; ~i; i = ne[i]) {
			if (e[i] != Son && e[i] != fa)
				cal(e[i], u, st);
		}
	}
}


void dsu(int u, int fa, bool st) {
	for (int i = h[u]; ~i; i = ne[i]) {
		int j = e[i];
		if (j == fa || j == son[u]) continue;
		dsu(j, u, 0);
	}
	if (son[u]) dsu(son[u], u, 1);
	Son = son[u];
	cal(u, fa, 1);
	Son = 0;
	ans[u] = sum - dep[u];
	if (!st) cal(u, fa, -1),mx = sum = 0;
}

int main() {
	memset(h,-1,sizeof h);
	read(n);
	for(int i = 1;i < n;i++){
		int a,b;
		read(a),read(b);
		add(a,b),add(b,a);
	}
	dfs(1,0);
	dsu(1,0,0);
	for(int i = 1;i <= n;i++) printf("%d\n",ans[i]);
	return 0;
}

线段树合并

#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 1e6 + 10,M = N * 2;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
	char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
	while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
struct Node{
	int l,r;
	int cnt,id;
}tr[N * 27];
int h[N],ne[M],e[M],idx,num;
int dep[N],ans[N];
int root[N];
int n;

void add(int x,int y){
	ne[idx] = h[x],e[idx] = y,h[x] = idx++;
}

void push(int u){
	if(tr[tr[u].l].cnt >= tr[tr[u].r].cnt) tr[u].cnt = tr[tr[u].l].cnt,tr[u].id = tr[tr[u].l].id;
	else tr[u].cnt = tr[tr[u].r].cnt,tr[u].id = tr[tr[u].r].id;
}

void modify(int &u,int l,int r,int x){
	if(!u) u = ++num;
	if(l == r){
		tr[u].cnt++,tr[u].id = l;
		return;
	}
	int mid = (l + r) >> 1;
	if(x <= mid) modify(tr[u].l,l,mid,x);
	else modify(tr[u].r,mid + 1,r,x);
	push(u);
}

int merge(int u,int v,int l,int r){
	if(!u || !v) return u + v;
	if(l == r){
		tr[u].cnt += tr[v].cnt;
		tr[u].id = l;
		return u;
	}
	int mid = (l + r) >> 1;
	tr[u].l = merge(tr[u].l,tr[v].l,l,mid);
	tr[u].r = merge(tr[u].r,tr[v].r,mid + 1,r);
	push(u);
	return u;
}

void dfs(int u,int fa){
	dep[u] = dep[fa] + 1;
	modify(root[u],1,n,dep[u]);
	for(int i = h[u];~i;i = ne[i]){
		int j = e[i];
		if(j == fa) continue;
		dfs(j,u);
		root[u] = merge(root[u],root[j],1,n);
	}
	ans[u] = tr[root[u]].id - dep[u];
}

int main() {
	memset(h,-1,sizeof h);
	read(n);
	for(int i = 1;i < n;i++){
		int a,b;
		read(a),read(b);
		add(a,b),add(b,a);
	}
	dfs(1,0);
	for(int i = 1;i <= n;i++) di(ans[i]);
	return 0;
}