CT47389

Zane's Wild roads

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Caravans arrive at the lakeside town of Mirrormere with crates of roads, and Zane the auditor must account for every last one. 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 <= 2361; 0 <= m <= 4722.

Example 1:

Input: 1625 1819 1 1625 231 1380 451 1442 526 1607 45 828 252 1418 519 945 238 999 153 1131 636 723 270 498 944 1484 252 392 378 1486 67 323 826 1606 2 323 886 934 725 1517 455 1223 1245 1476 1001 1269 1005 1204 240 1096 897 1028 365 686 1111 1503 466 1038 797 1020 505 600 665 1022 402 512 37 890 196 280 183 1159 1030 1614 35 814 758 1054 126 380 1156 1460 425 594 966 1589 648 1499 466 666 1182 1455 701 858 179 1403 729 1536 221 954 55 1396 178 388 91 1484 920 1572 740 1332 278 1328 755 1601 586 728 1045 1291 164 849 1074 1389 334 702 374 1313 228 1310 295 877 326 944 215 832 1215 1398 1294 1348 1014 1236 338 1178 7 12 1461 1485 472 1386 6 1409 954 1239 406 678 338 1498 583 1085 663 1081 314 553 654 1247 936 1606 1173 1536 360 1281 53 335 1249 1470 523 1467 1226 1388 292 1024 445 850 116 182 192 …
Output: 12

Example 2:

Input: 1388 1387 1 1388 604 957 345 850 166 466 1062 1309 47 385 924 1366 271 366 873 1129 528 1020 538 987 543 587 32 487 955 1304 401 470 191 883 693 1206 103 1237 105 1228 709 1132 127 1344 486 1356 66 1112 1073 1234 124 1291 671 997 185 385 89 1057 138 754 172 999 190 453 544 1157 621 946 100 905 65 532 563 718 65 1134 212 1113 36 660 31 985 135 178 564 921 461 1373 264 618 717 1078 1224 1373 56 711 65 1019 497 526 654 1316 332 1111 383 1135 659 1093 535 966 244 1082 251 1151 756 1142 681 1032 229 929 578 1003 285 1137 443 770 465 1106 110 640 937 1137 280 594 383 1366 649 1374 294 520 1213 1270 62 1317 302 433 86 323 215 922 1052 1342 713 917 509 523 831 1269 988 1321 685 929 128 1100 231 755 617 1047 609 753 96 402 348 1253 382 420 465 504 175 863 1018 1181 539 820 1251 1327 1339 1376 784 1…
Output: 7

Example 3:

Input: 109 1559 1 109 6 39 12 99 41 55 3 34 47 48 55 60 19 27 43 47 70 103 52 109 6 67 59 108 14 84 53 91 34 48 27 67 22 30 6 92 22 50 11 50 42 92 16 39 44 106 94 108 62 83 14 70 11 71 2 5 24 103 3 81 31 96 13 109 40 86 34 60 13 78 7 87 7 39 57 104 102 109 26 67 43 67 20 88 10 67 50 97 31 52 74 77 15 35 8 13 9 56 86 99 63 94 10 55 8 98 1 78 44 89 3 14 45 49 21 47 5 107 31 93 69 82 90 106 10 18 33 49 12 34 80 96 25 57 36 79 5 78 16 89 66 100 19 22 37 73 73 95 45 89 37 54 27 50 6 101 63 96 51 54 6 81 2 91 24 47 20 106 56 71 41 67 52 95 91 105 26 40 42 102 6 29 57 62 79 91 8 38 57 108 10 16 46 109 19 66 21 72 39 99 53 68 94 99 14 97 74 96 95 102 29 63 29 31 77 108 72 104 25 45 15 62 35 48 20 39 62 107 5 72 5 41 45 84 54 58 46 100 56 70 16 53 43 70 83 94 45 65 8 49 38 63 35 82 7 49 36 82 65 91 90 109…
Output: 2

Constraints:

1 <= n <= 2361; 0 <= m <= 4722.

Loading...
Test Cases:No test cases
No test cases available.
Zane's Wild roads - MEDIUM Coding Problem | CodeTikki