I am trying to solve this problem: http://codeforces.me/contest/545/problem/E My source is that: http://pastebin.com/Jyjb6sjx
I take memory limit in testcase 6. Can you help me? Thank you !
→ Обратите внимание
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 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 | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 5 | -is-this-fft- | 158 |
| 6 | adamant | 157 |
| 6 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 8 | nor | 154 |
| 10 | djm03178 | 153 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 13.11.2024 04:52:15 (j3).
Десктопная версия, переключиться на мобильную.
При поддержке
I you visited a node already , why you process the node again ? just add if(visited[node]==true) continue ; in 85 number lines . Thanks.
thanks
but now with that code: http://pastebin.com/qvaz03sQ
I take TLE in testcase 12. Is my logic wrong? Or I can optimize it a bit?
find a node which has lower cost to invent and process it . If cost is tie of two nodes , than consider the node which edge cost is lower to reach the node . My solution http://codeforces.me/contest/545/submission/11163248
Thank you a lot man. I solved it. You really helped me.
(Erase was so slow,so I did the sorting as you recommended).
Welcome !