Centroid Decomposition

Introduction

Centroid Decomposition is a divide and conquer technique for trees. The centroid of a tree is a node which, if rooted, results in no other nodes having a subtree of size greater than $\frac{N}{2}$. Centroid Decomposition works by repeated splitting the tree and each of the resulting subgraphs at the centroid, producing $O(\log N)$ layers of subgraphs.

Implementation

General centroid code is shown below.

bool r[MN];//removed
int s[MN];//subtree size
int dfs(int n, int p = 0)
{
    s[n] = 1;
    for(int x : a[n])
        if(x != p && !r[x])
            s[n] += dfs(x, n);
    return s[n];
}

boolean[] r = new boolean[MN];//removed
int[] s = new int[MN];//subtree size
public int dfs(int n, int p)
{
    s[n] = 1;
    for(int x : a[n])
        if(x != p && !r[x])
            s[n] += dfs(x, n);
    return s[n];
}

Solution - Xenia & Tree

#include <cstdio>
#include <cstring>
#include <vector>

template<typename T> bool ckmin(T& a, const T& b){return b<a?a=b,1:0;}

const int MN = 1e5+10, INF = 0x3f3f3f3f;

int N, M, s[MN], m[MN][2], t, b, d;
bool r[MN], red[MN];

Problems