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 | 3843 |
2 | jiangly | 3705 |
3 | Benq | 3628 |
4 | orzdevinwang | 3571 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3530 |
8 | ecnerwala | 3499 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | adamant | 164 |
3 | awoo | 163 |
4 | TheScrasse | 156 |
5 | nor | 153 |
6 | maroonrk | 152 |
6 | -is-this-fft- | 152 |
8 | Petr | 145 |
9 | orz | 144 |
9 | pajenegod | 144 |
[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 |
---|