Hi, I'm failing on test case #31 in the problem Dijkstra? from Codeforces Alpha Round #20 (Codeforces format) Link to the Problem, but I'm not able to test it locally because the test case is too big, it's hidden in the submit link.
There's a way to see this full test ? The problem itself is tricky, asking for a as fast as possible Dijsktra implementation, can you guys see what's wrong with this code ? Code
Length of the shortest path can be (n - 1)·w = 1011, which fits long long but is greater than your
INF.Probably, the 31st test has answer with answer = 109.
You have to increase your
INFUPD:Too slow
1904852
Thank you.. but, extending the discussion, there's a way to see the full length of this big test cases ? It would be helpful.
AFAIK, there are no way to see it.
But It's usually not important.
ok, Thanks.
enlarge your INF 100 times natural way proven method every problem likes it OK just after 2 days of using