I am trying to solve this problem: http://codeforces.com/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 !
→ Pay attention
Before contest
Codeforces Round 940 (Div. 2) and CodeCraft-23
42:09:15
Register now »
Codeforces Round 940 (Div. 2) and CodeCraft-23
42:09:15
Register now »
*has extra registration
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | ecnerwala | 3648 |
| 2 | Benq | 3580 |
| 3 | orzdevinwang | 3570 |
| 4 | cnnfls_csy | 3569 |
| 5 | Geothermal | 3568 |
| 6 | tourist | 3565 |
| 7 | maroonrk | 3530 |
| 8 | Radewoosh | 3520 |
| 9 | Um_nik | 3481 |
| 10 | jiangly | 3467 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | adamant | 164 |
| 2 | awoo | 164 |
| 4 | TheScrasse | 160 |
| 5 | nor | 159 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 150 |
| 7 | SecondThread | 150 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Apr/19/2024 23:25:46 (l2).
Desktop version, switch to mobile version.
Supported by
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.com/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 !