Problem 144D Codeforces Round #103 (Div. 2)
Here is my submission.
Rewrote Dijkstra already 3-4 times (not enough?)... but I think I am doing something wrong with SortedList.
Thx.
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3904 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3494 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | maroonrk | 3350 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 159 |
5 | -is-this-fft- | 157 |
5 | awoo | 157 |
5 | adamant | 157 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | Dominater069 | 152 |
Problem 144D Codeforces Round #103 (Div. 2)
Name |
---|
I am from Java ,so dont know much about the c#.However I think there is a problem in your implemtation in Dijkstra.
When I swapped :
sl.Remove (new pair (dist [p.fst], p.snd));
with
dist [p.fst] = weight + p.snd;
It passed the 10th test case but failed on the 12th.Here's my submission.__
your program needs to clear memory before exit, and this process is very slow, i think.
I think maybe SPFA is a good way to solve this problem.