| # | 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 | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | Dominater069 | 154 |
| 8 | awoo | 154 |
| 10 | luogu_official | 150 |
Hi all,
I learnt some graph theory recently and I am quite fascinated by it. So, I wanted to check out some really interesting problems under that topic. What are some of the best problems that you've solved which have a graph algorithm (like shortest path, SCCs, euler tour, max-flow, bridges/articulation points) as their solution?
429A - Xor-tree & 499E - Array and Operations & 489B - BerSU Ball & 500B - New Year Permutation
Nice ones, but I was actually looking for problems like Hiking or Tanya and Password or Drazil and Tiles or Fox and Dinner i.e. where the reduction to a graph problem isn't very obvious.