| # | 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 | 160 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | Dominater069 | 154 |
| 8 | awoo | 154 |
| 10 | luogu_official | 151 |
Help me out here pls!!! Why does my solution exceed ML?
My solution to the E1 problem of the 747 round (https://mirror.codeforces.com/contest/1594/problem/E1) exceeds memory limit?
Here is my solution $$$\to$$$ https://mirror.codeforces.com/contest/1594/submission/131228904
I thought it wasn't supposed to MLE 'cause the depth of the recursion was less than $$$2 * log(2^{61}) = 122$$$.
Sorry, dunno how to write blogs in Codeforces properly)
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
MikeMirzuhanov | 2021-10-08 20:26:48 | 1 | ||
| en1 |
|
MikeMirzuhanov | 2021-10-08 20:26:26 | 431 | Initial revision (published) |
