CT43500

Mason's Timeworn Ledger

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Mason found an old ledger of tunnels in the shed attic at the lily shoals of Padmore. The margin notes pose a precise question. Task: Print the minimum number of edges on a path from s to t, or -1. Input format: First line: n m s t. Next m lines: u v. Output format: Print the BFS distance or -1. Constraints: 1 <= n <= 2491; 0 <= m <= 4982.

Example 1:

Input: 857 2022 1 857 572 631 61 769 704 826 296 590 262 351 166 807 191 798 653 661 528 797 136 718 402 795 94 383 546 637 117 358 8 240 304 652 196 516 723 726 43 87 6 601 366 762 141 672 175 707 34 502 214 687 605 770 15 284 43 514 687 844 402 853 390 577 665 783 322 843 33 672 678 681 2 133 171 546 103 313 521 605 584 762 472 629 124 660 86 589 217 470 711 850 184 329 430 810 81 783 662 844 436 441 208 516 267 653 97 613 309 845 598 671 375 749 204 376 637 846 8 703 51 326 533 679 371 767 55 75 224 601 249 581 244 845 780 790 335 542 405 738 664 849 95 626 168 477 221 487 387 704 315 589 521 570 161 506 82 328 544 644 239 781 109 487 512 637 340 719 355 791 375 404 382 631 50 677 437 556 163 347 272 529 694 757 268 701 139 453 165 762 261 749 161 849 126 595 199 669 575 716 16 653 530 670 66 …
Output: 5

Example 2:

Input: 35 595 1 35 18 34 4 33 14 15 28 33 26 33 1 26 2 35 1 33 7 8 8 10 7 19 1 23 15 29 4 34 34 35 26 30 11 18 12 34 3 10 4 9 8 29 15 31 11 19 24 31 3 5 3 30 3 23 15 35 6 34 23 28 20 24 12 23 15 32 26 28 9 19 28 30 2 24 2 18 9 28 1 15 8 13 26 27 18 21 16 23 1 13 12 20 11 17 14 29 3 20 29 30 6 33 16 35 5 19 3 34 18 24 15 16 22 26 10 35 28 34 7 23 13 35 10 34 6 26 2 22 1 7 10 12 4 31 4 20 1 19 11 27 10 22 1 11 30 33 3 29 4 28 24 32 5 16 20 28 14 19 13 34 19 32 9 30 11 23 5 10 12 24 9 17 25 27 9 23 19 35 3 28 14 32 29 33 25 26 4 29 12 35 30 31 12 26 11 32 14 31 8 12 14 20 18 22 21 32 10 31 21 23 2 27 16 18 22 33 9 35 11 21 18 30 14 16 16 20 20 33 32 33 6 21 15 30 5 23 2 19 2 15 5 27 14 21 19 25 2 4 1 24 21 34 5 6 9 32 6 18 19 34 20 30 7 17 11 22 16 27 1 8 2 23 1 6 3 18 17 32 5 20 19 29 7 10 11 13 5 …
Output: 1

Example 3:

Input: 2091 4524 1 2091 1091 1255 648 1946 1224 1507 176 1275 1831 1893 1067 1646 5 1985 1651 1690 467 1579 1333 2048 949 1984 416 690 795 2074 763 1795 448 1546 874 976 1511 1966 535 1120 512 590 1104 1261 438 1432 306 839 169 1685 117 326 224 1497 195 804 335 1657 806 1240 1072 1702 1955 1958 304 1525 669 1773 184 1681 64 873 1806 1949 1484 1766 598 1130 1055 1477 559 1863 277 760 1379 1825 374 698 1234 1485 582 1310 417 1250 102 1468 49 1585 582 1620 1021 1398 883 1078 93 1880 868 2004 1347 2016 714 1853 230 761 823 1240 1507 1775 1 554 290 1207 196 1465 686 938 863 1772 245 756 1131 1172 123 424 397 1937 17 2057 1331 1861 1079 1851 984 2055 358 1367 401 1794 1002 1787 153 531 34 594 117 582 72 892 702 1955 381 1197 726 1324 942 1058 617 1198 1496 2073 437 835 918 1868 82 1763 320 1196 865 178…
Output: 4

Constraints:

1 <= n <= 2491; 0 <= m <= 4982.

Loading...
Test Cases:No test cases
No test cases available.
Mason's Timeworn Ledger - MEDIUM Coding Problem | CodeTikki