| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3885 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3580 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3506 |
| 7 | ecnerwala | 3505 |
| 8 | Radewoosh | 3457 |
| 9 | Kevin114514 | 3377 |
| 10 | gamegame | 3374 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 170 |
| 2 | -is-this-fft- | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 160 |
| 5 | djm03178 | 157 |
| 6 | Dominater069 | 156 |
| 7 | adamant | 153 |
| 8 | luogu_official | 152 |
| 8 | awoo | 152 |
| 10 | maomao90 | 148 |
Reagrding MLE veridict.
Can Someone please help me out with optimizing my solution?
Question Link -> https://mirror.codeforces.com/contest/2037/problem/G
My Solution -> https://mirror.codeforces.com/contest/2037/submission/298945671
Its obvious what I am trying to do. I simply create DAG by adding edges between indexes where transition is possible. Then I run Kahn's algo to sort the nodes and then its simple dp to find number of ways to reach the ending node.
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en1 |
|
AARYABHATTA_THE_GREAT | 2024-12-29 11:56:06 | 460 | Initial revision (published) |
