How can I calculate this with efficiency without using HLD or Link Cut Trees? I tried doing it with Binary Lifting but I am not able to do it correctly. Please guide me. Thanks.
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 150 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Dec/22/2024 21:01:14 (h2).
Desktop version, switch to mobile version.
Supported by
You are in the right path if you tried doing it using binary lifting. Have you managed to succeed in doing a regular binary lifting (just to find the LCA of 2 vertices)? If not I recommend you reading this blog
Now, if you understand how to find LCA of 2 vertices, you do almost the same thing you did for calculating the parenting array but instead you do it for the length of edges
// g is the adjacency list
// w is the "adjacency list" of weights
void DFS(int node, int cost, int par = -1) {
p[node][0] = par; maxi[node][0] = cost; if (par != -1) { h[node] = 1 + h[par]; } for (int i = 1; i < MAX_LOG; i++) { if (p[node][i - 1] != -1) { p[node][i] = p[p[node][i - 1]][i - 1]; maxi[node][i] = max(maxi[node][i - 1], maxi[p[node][i - 1]][i - 1]); } } for (int i = 0; i < (int)g[node].size(); i++) { int viz = g[node][i]; if (viz != par) { DFS(viz, w[node][i], node); } }}
For a query it is again very similar to finding the LCA of 2 vertices.