# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3821 |
3 | Benq | 3736 |
4 | Radewoosh | 3631 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3388 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 161 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
Name |
---|
Can you go step by step through the solution of problem "B. Stable Neigh-bors" of GCG Round 1B?
I'd like to see how would you reason while solving this problem.
Sorry for reviving, but I was looking for more examples of binary lifting problems, not necessarily just those restricted to trees. Can anyone suggest tasks like this, which use the technique in unique ways?
Oh wait I found some already 1175E 1078D
Lol how you became grey in one hour vammadur?!
Hobson's Trains from ICPC World Finals 2019 involves binary lifting on a graph that may not be a tree.