→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3773 |
| 3 | Radewoosh | 3646 |
| 4 | ecnerwala | 3624 |
| 5 | jqdai0815 | 3620 |
| 5 | Benq | 3620 |
| 7 | orzdevinwang | 3612 |
| 8 | Geothermal | 3569 |
| 8 | cnnfls_csy | 3569 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 161 |
| 2 | maomao90 | 160 |
| 3 | awoo | 159 |
| 4 | atcoder_official | 157 |
| 5 | -is-this-fft- | 155 |
| 5 | nor | 155 |
| 5 | adamant | 155 |
| 8 | Um_nik | 152 |
| 8 | maroonrk | 152 |
| 10 | djm03178 | 146 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 12.09.2024 17:54:34 (i1).
Десктопная версия, переключиться на мобильную.
При поддержке
You forgot about memoization in dfs.
The whole point of using reference variable is memoisation itself
Sorry, idk what is this. Im not c++ guru :( My thought is that linking and unlinking variable is time consuming and not O(1).Because you first allocate space in the heap and create a connection, then cut it off, which gives additional costs both in memory and time. So its causing tle.
Source ?
I only have link to Russian c# video. I think you dont need it. Its just base knowledge about struct, collections,heap,stack and how reference and pointers work.
Auto comment: topic has been updated by sojabhai (previous revision, new revision, compare).
I think it's the fact that $$$dp[x][lastSeen]$$$ is accessed multiple times in the TLE code (even if it's via a reference variable), and it's probably not cache optimised. Replacing the reference variable with just $$$dp[x][lastSeen]$$$ gives the same TLE result — 271896757
Makes sense , Thanks
Auto comment: topic has been updated by sojabhai (previous revision, new revision, compare).