| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
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.