| # | 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 | 165 |
| 2 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 4 | adamant | 160 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 8 | Dominater069 | 154 |
| 8 | nor | 154 |
Time Complexity Calculation
For this Problem
The solution is written in O(n*m)
But How it is possible if there is recursion calls inside the nested solution.
Solution in tutorial is:
https://codeforces.net/blog/entry/116108 (Problem E)
Please someone help me understand the time complexity?Shouldn't it be O(n*m*n*m).I know we are not checking same grid twice.
Please someone help me.
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
I_lOVE_ROMAN | 2023-10-30 15:29:00 | 2 | Tiny change: 'oblem:1829A]\n\n\nThe' -> 'oblem:1829E]\n\n\nThe' | |
| en1 |
|
I_lOVE_ROMAN | 2023-10-29 12:50:26 | 432 | Initial revision (published) |
