I am getting MLE for this code https://codeforces.me/contest/1774/submission/186717963 Please Anyone Can help?
→ Обратите внимание
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3657 |
| 3 | jiangly | 3638 |
| 4 | turmax | 3442 |
| 5 | tourist | 3380 |
| 6 | Um_nik | 3353 |
| 7 | strapple | 3350 |
| 8 | squareOf105 | 3346 |
| 9 | heuristica | 3322 |
| 10 | maroonrk | 3310 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | AmShZ | 144 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 135 |
| 9 | maroonrk | 133 |
| 10 | qwexd | 130 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2026 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 18.10.2026 01:20:59 (g2).
Десктопная версия, переключиться на мобильную.
При поддержке
Hey man, i solved ur memory problem with the following submission: https://codeforces.me/contest/1774/submission/186734301
However, I got a time limit exceeded on the next test (22). Do u think u could give me a time complexity analysis for ur code to see what is the problem?
for my code the time complexity was O(n); where n is number of nodes
can u double check this please because my changes have not affected anything in your code but it is giving time limit exceeded on testcase 22.
The one thing more i have done is predefining the size of curr vector so to avoid mutliple times reallocation of size of the vector
Now i gets accepted by passing the visited vector by reference... !!
Thanks @TheOpChicken123 for pointing out.
https://codeforces.me/contest/1774/submission/186738592
Here is the revised code Link
alright man, good job
Pass the reference for
vistedandcurrvectors and make the necessary changes inupdate()andDFS()functions.This is ACCEPTED submission of your code.
In
update()you are not changing anything incurrvector, so better pass its reference, which will be faster [ O(1) compared to your O(N) passing] and also reduces memory usage in recursive calls.In
DFS()same thing.visitedandcurryou can pass the reference. But one change is required forcurr. As after every recursive function your lastly added element should be removed, add one extracurr.pop_back()at the end ofDFS()Hope you got it right :)