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".
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 166 |
2 | maomao90 | 163 |
2 | Um_nik | 163 |
4 | atcoder_official | 161 |
5 | adamant | 160 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | nor | 153 |
9 | Dominater069 | 153 |
[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. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
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) |
Name |
---|