| # | User | Rating |
|---|---|---|
| 1 | tourist | 3757 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 171 |
| 2 | awoo | 165 |
| 3 | adamant | 164 |
| 4 | TheScrasse | 159 |
| 5 | maroonrk | 154 |
| 6 | nor | 153 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
Yet Another Tree Problem
The following problem popped into my mind all of a sudden and I have no idea how to solve it.
You are given a weighted rooted tree with $$$n$$$ nodes. You need to find the number of unordered pairs of nodes $$$(u,v)$$$ such that
$$$Constraints: 1<=n<= 10^5, -10^6<=edge\,weights<=10^6$$$
It will be really helpful if you can provide me with a solution.
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
YouKn0wWho | 2019-07-14 10:08:52 | 7 | Tiny change: ' weighted tree w' -> ' weighted rooted tree w' | |
| en1 |
|
YouKn0wWho | 2019-07-13 12:49:37 | 477 | Initial revision (published) |
