MSE06I - "Shortest" pair of paths



hide comments
joqsan_77: 2018-08-04 18:20:23

Maybe the tag "minimum-cost-flow" should be added.

kejriwal: 2017-01-24 18:36:15

Weak test cases... my earlier code failed on the following case:
7 8
0 1 1
0 2 1
1 3 1
2 3 1
3 4 1
3 5 1
4 6 1
5 6 1
0 0

Jacob Plachta: 2013-10-30 01:47:23

The input contains paths with i=j (a path from a node to itself).

~!(*(@*!@^&: 2009-06-26 19:15:48

Updated in statement. Original text and data set came from official website.

Anton Lunyov: 2009-06-26 19:14:13

In fact, in author tests n<=15 and m<=170 instead of n<=64 and m<=10000.
It may help. :-)

Last edit: 2009-05-06 19:31:53

Added by:psetter
Date:2009-04-16
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ERL JS-RHINO NODEJS PERL6 VB.NET
Resource:Southeastern European 2006