| # | 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 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 160 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | Dominater069 | 153 |
| 8 | awoo | 153 |
| 10 | luogu_official | 150 |
There is a tree that consists of one node(the root) let it be (1).
There is some queries each query is either
find if x is ancestor of y.
make x a son of y(its guaranteed that y exist).
If the first query does not exist its easy to solve it using DFS but I am stuck at finding a solution for the whole problem.
How to solve this?
This problem can be solved using Binary Lifting. I recommend watching the tutorial on Binary Lifting by Algorithms Live! on Youtube if you don't already know it.