Notes
This function is in beta test. Please help improve it in the issues
here.
Hints
Your answer may be identical to the JOJ answer in the first several lines.
However, you will still get Wrong Answer because the complete output may be longer and there might be errors in the future lines.
Please double check your code to solve this problem and try again.
Your Answer
6756 8178 366 9648 1070 247 1089 3256 392 3127 6472 935 8604 6680 614 3981 2702 705 1603 231 333 4743 5554 130 1209 4106 54 2954 3903 178 7782 1932 2 7888 986 499 9134 1041 984 3634 586 718 7038 4143 379 4223 8144 549 6363 3983 455 1251 9664 39 1933 3791 339 6374 676 162 6892 4074 480 3592 304 873 6802 407 94 4145 9299 570 7139 3462 889 7198 9512 404 3150 3617 611 6201 8008 661 9688 6815 503 2311 4117 72 9454 1552 599 5665 953 284 8259 579 859 5884 2397 506 8872 2700 435 4244 4281 49 6117 4418 450 561 3005 89 5836 9736 553 5313 1516 946 9669 6957 886 6074 6859 520 7746 7603 114 5866 9245 340 7018 1662 520 8609 718 284 1096 7249 910 9553 1676 26 8429 5739 650 1491 5569 136 2738 698 217 1053 2122 914 6334 5750 105 1342 9649 884 9331 6069 257 1557 3127 553 7762 724 637 450 4930 548 3360 5849 486 4397 9929 542 5055 6965 168 5506 1990 612 8743 2337 88 7110 1274 333 6905 3254 449 2047 9493 890 2160 466 967 4532 9657 953 8053 9325 579 2433 3186 393 4808 7282 200 9302 6746 266 7695 234 317 7552 7113 46 3927 1790 788
JOJ Answer
Shortest path length is 2133 The graph is not a DAG No MST exists!