Hello Codeforces,
\section{Introduction} I came across this problem a while back — https://cses.fi/problemset/task/1139/. Here the task is — "Given a rooted tree, determine the number of ditinct elements for each subtree of the tree".
[Tutorial] DSU on tree
Hello Codeforces,
\section{Introduction} I came across this problem a while back — https://cses.fi/problemset/task/1139/. Here the task is — "Given a rooted tree, determine the number of ditinct elements for each subtree of the tree".
| Rev. | Язык | Кто | Когда | Δ | Комментарий | |
|---|---|---|---|---|---|---|
| en7 |
|
shadow9236 | 2022-05-21 09:59:32 | 0 | (published) | |
| en6 |
|
shadow9236 | 2022-05-21 09:58:27 | 6 | ||
| en5 |
|
shadow9236 | 2022-05-21 09:57:01 | 43 | Grammar | |
| en4 |
|
shadow9236 | 2022-05-21 09:52:36 | 44 | ||
| en3 |
|
shadow9236 | 2022-05-21 09:49:39 | 2815 | Tiny change: 'Thanks to @-is-this-f' -> 'Thanks to /profile/-is-this-f' | |
| en2 |
|
shadow9236 | 2022-05-21 09:17:42 | 529 | ||
| en1 |
|
shadow9236 | 2022-05-21 09:10:06 | 272 | Initial revision (saved to drafts) |