| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3741 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3489 |
| 7 | Radewoosh | 3483 |
| 8 | Kevin114514 | 3442 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 2 | atcoder_official | 162 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | nor | 150 |
[Help] Memory limit exceeded
Hi guys, Why my implementation to problem https://mirror.codeforces.com/contest/1278/problem/D gives MLE, First I though it is because of recursive DFS. But even after changing DFS to iterative it is still giving MLE.Can anyone please help me with it. My solution links
https://pastebin.com/T5eqyXYS (Recursive) https://pastebin.com/KczMMcud (Iterative)
| Rev. | Язык | Кто | Когда | Δ | Комментарий | |
|---|---|---|---|---|---|---|
| en2 |
|
take_me_back | 2019-12-27 10:00:26 | 3 | (published) | |
| en1 |
|
take_me_back | 2019-12-27 09:59:17 | 385 | Initial revision (saved to drafts) |
