Given two weighted trees. f(x, y) — distance between x and y in the first tree, g(x, y) — distance between x and y in the second tree. How many pairs (x, y) such that x < y and f(x, y) < g(x, y). Number of vertices <= 2*10^5.
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3657 |
| 3 | jiangly | 3638 |
| 4 | turmax | 3442 |
| 5 | tourist | 3380 |
| 6 | Um_nik | 3353 |
| 7 | strapple | 3350 |
| 8 | squareOf105 | 3346 |
| 9 | heuristica | 3322 |
| 10 | maroonrk | 3310 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 151 |
| 3 | maspy | 150 |
| 4 | AmShZ | 144 |
| 4 | Um_nik | 144 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 135 |
| 9 | maroonrk | 133 |
| 10 | Proof_by_QED | 131 |
→ Find user
→ Recent actions
History
Revisions
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| ru3 |
|
Temirulan | 2018-05-21 14:09:32 | 7 | Мелкая правка: 'x$ и $y$ в первом дереве.' -> 'x$ и $y$ во втором дереве.' | |
| ru2 |
|
Temirulan | 2018-05-21 12:34:06 | 23 | Мелкая правка: 'le 2*10^5$.' -> 'le 2*10^5$, веса ребер $\le 10^9$.' | |
| ru1 |
|
Temirulan | 2018-05-21 00:10:54 | 352 | Первая редакция перевода на Русский | |
| en1 |
|
Temirulan | 2018-05-21 00:07:41 | 277 | Initial revision (published) |
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Oct/22/2026 12:30:53 (g2).
Desktop version, switch to mobile version.
Supported by
