how to find $$$\Large shortest\ Path\ in$$$ $$$\texttt{PLANAR}$$$ $$$\Large graph\ \Theta(1)$$$ using $$$\textbf{lazy bitset}$$$?
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3845 |
| 2 | tourist | 3798 |
| 3 | orzdevinwang | 3706 |
| 4 | jqdai0815 | 3682 |
| 5 | ksun48 | 3589 |
| 6 | Ormlis | 3532 |
| 7 | Benq | 3468 |
| 8 | Radewoosh | 3463 |
| 9 | ecnerwala | 3451 |
| 10 | Um_nik | 3450 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 165 |
| 2 | Qingyu | 159 |
| 2 | -is-this-fft- | 159 |
| 4 | atcoder_official | 157 |
| 5 | Dominater069 | 156 |
| 6 | adamant | 154 |
| 7 | djm03178 | 151 |
| 8 | luogu_official | 149 |
| 9 | awoo | 148 |
| 10 | TheScrasse | 145 |
→ Find user
→ Recent actions
Comments (0)
Write comment?
Codeforces (c) Copyright 2010-2025 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Mar/19/2025 15:02:14 (i1).
Desktop version, switch to mobile version.
Supported by
