Coldfresh的博客

You are given a rooted tree with root in vertex 1. Each vertex is coloured in some colour. Let’s call colour c dominating in the subtree of vertex v if there are no other colours that appear in the su...

套dsu on tree的套路 代码： #include<iostream> #include<cstdio> #include<algorithm> #include<cstring> #include<cmath> #define ll long long #define maxx 500005 #define INF 0x7f7f...

Polycarpus got hold of a family relationship tree. The tree describes family relationships of n people, numbered 1 through n. Each person in the tree has no more than one parent. Let’s call person a a...