I'm stuck on MLE at a 3 month old problem, I feel I should complete that, Please take a look and help me out 1981C - Turtle and an Incomplete Sequence My code : 264590950 PS: My code is a bit complex, but my idea is very similar to the one given in the editorial of this contest, by traversing, x/2 2x and 2x+1, until I reach my required value, also adhering to constraints
→ Обратите внимание
До соревнования
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
08:46:34
Зарегистрироваться »
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
08:46:34
Зарегистрироваться »
*есть доп. регистрация
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 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 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 4 | atcoder_official | 161 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 23.11.2024 08:48:26 (l2).
Десктопная версия, переключиться на мобильную.
При поддержке
can step number be equal to n? i mean n==step
I think it will be n-1 at max
You should write the map outside your bfs function because the memory global will be larger than the inside of a function (and also in your function there are too many activity with your map) it may leads to MLE
Tried, still MLE