| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3880 |
| 2 | jiangly | 3669 |
| 3 | ecnerwala | 3654 |
| 4 | Benq | 3627 |
| 5 | orzdevinwang | 3612 |
| 6 | Geothermal | 3569 |
| 6 | cnnfls_csy | 3569 |
| 8 | jqdai0815 | 3532 |
| 9 | Radewoosh | 3522 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | awoo | 161 |
| 2 | maomao90 | 160 |
| 3 | adamant | 157 |
| 4 | maroonrk | 154 |
| 5 | -is-this-fft- | 148 |
| 5 | atcoder_official | 148 |
| 5 | SecondThread | 148 |
| 8 | Petr | 147 |
| 9 | TheScrasse | 145 |
| 10 | nor | 144 |
I came across this paper
On Finding Lowest Common Ancestors: Simplification and Parallelization by Baruch Schieber, Uzi Vishkin April, 1987
so naturally I tried to code golf it
lca https://judge.yosupo.jp/submission/188189
rmq https://judge.yosupo.jp/submission/188190
edit: minor golf
Cool! This algorithm seems to be almost the same size of the one described here, although maybe a bit slower.
rip
although looking at the test cases, this approach does worse on the small width query where the usual 4-russians approach would have an advantage: you hit the case with less operations
on cses rmq: your implementation: .10s, my implementation: 0.12s
revisiting this, I code golfed it another way, and now it is a bit faster
https://judge.yosupo.jp/submission/222465
Kudos for a clean, neat code and usage of C++20 features!
thanks
Auto comment: topic has been updated by lrvideckis (previous revision, new revision, compare).