| Title |
User |
Message |
Date Posted |
| Re: What am I doing wrong? |
ZorvyY |
I've used both the bellman ford and spfa algorithms? They should handle negative edge weights... |
Jan 02, 2018 - 2:48:14 am UTC |
| Re: What am I doing wrong? |
jargon |
Bonus: one case will have edges with negative lengths. |
Jan 01, 2018 - 8:35:56 pm UTC |
| What am I doing wrong? |
ZorvyY |
I've tried multiple algorithms, but I keep getting the last test case incorrect. What am I missing? |
Jan 01, 2018 - 3:37:55 pm UTC |
| Re: RE |
jargon |
N and M will be on the same line. Here's your error: Traceback (most recent call last): File "a.out", line 19, in graph[int(a[0])].append(weight) KeyError: 3 |
Feb 18, 2017 - 10:30:44 pm UTC |
| RE |
Chinadoll |
My code worked fine on windows cmd but I'm getting RE for all test cases? Are N and M on the same line separated by a space or on different lines? |
Feb 17, 2017 - 11:15:16 pm UTC |
| Re: Infinitely short paths. |
bbi5291 |
AFAIK there are no such cases in the actual test data |
Oct 13, 2013 - 3:33:54 am UTC |
| Infinitely short paths. |
B |
For example: 3 3 1 2 1 2 1 -2 1 3 5 |
Oct 13, 2013 - 3:06:04 am UTC |
