| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3947 |
| 2 | jiangly | 3734 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3612 |
| 7 | ecnerwala | 3581 |
| 8 | Geothermal | 3569 |
| 8 | cnnfls_csy | 3569 |
| 10 | ksun48 | 3479 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | awoo | 163 |
| 2 | maomao90 | 160 |
| 3 | nor | 156 |
| 3 | adamant | 156 |
| 5 | atcoder_official | 155 |
| 5 | -is-this-fft- | 155 |
| 7 | maroonrk | 153 |
| 7 | cry | 153 |
| 9 | SecondThread | 147 |
| 10 | Petr | 146 |
Time and memory complexity(Pls help!)
Problem link: 1654C - Alice and the Cake
I tried solving the problem with a different approach. It would be great if someone helps me analyze the time and space complexity of my submission, because I feel it should be within constraints and somehow it fails!
Thanks for your time reading :)
