Does Heavy Light Decomposition have any advantage over Binary Lifting Technique or using a sparse table? Can we solve some type of problem using HLD which can't be solved using the other mentioned techniques?
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | Radewoosh | 3415 |
| 8 | Um_nik | 3376 |
| 9 | maroonrk | 3361 |
| 10 | XVIII | 3345 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
Does Heavy Light Decomposition have any advantage over Binary Lifting Technique or using a sparse table? Can we solve some type of problem using HLD which can't be solved using the other mentioned techniques?
Hello People! I am new to ACM ICPC, and I want to participate this year. I know that you have to take part in regionals to qualify for Finals. What are xProvisionals/Nationals? Like this: https://icpc.baylor.edu/regionals/finder/india-chennai-provincial-2017
Do they also have slots for finals? I tried googling but I didn't get any answers.
Codeforces allows us to create mashups, and run it as a contest. I noticed a problem in it. If you solve and get AC on any problem in a mashup contest, it won't be reflected in the problem page in the contest from which it was taken. For example, if you solve Problem A from Round 410 in a mashup, and then go to the Round 410's problem A page, it will be shown as unsolved.
Is this a bug? Or was it intended to be like this? (which doesn't make much sense). Or do I have to wait for a certain amount of time for the change to take place?
If this is a bug, please correct this codeforces! Thanks!
| Name |
|---|


