CT53933

Dino and the Fewest Hops

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Before the gates of the snowberry thicket of Winterholt close for winter, Dino must finish the roads ledger - one figure at a time. 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 <= 2462; 0 <= m <= 4924.

Example 1:

Input: 1228 1234 1 1228 44 393 189 1199 955 1207 240 526 431 981 384 1027 251 311 578 731 246 439 1094 1152 72 183 260 992 77 803 621 890 638 660 1156 1165 753 1225 155 1063 6 425 293 595 111 699 110 805 158 424 607 783 484 729 615 842 293 393 147 740 608 1189 199 832 288 1048 726 1129 214 915 854 1165 483 812 710 798 419 940 87 818 416 1000 224 605 362 914 31 523 277 972 521 622 875 1195 379 404 28 173 181 748 740 1163 81 1194 83 777 211 770 64 625 26 813 124 947 836 1026 240 1083 191 672 445 826 213 379 623 781 295 461 211 1140 65 206 173 767 477 960 217 1098 968 1114 377 496 500 845 139 614 300 1187 64 463 928 1211 62 1226 288 842 132 812 602 1056 349 867 124 584 105 204 414 605 335 970 350 640 163 604 77 1071 590 931 42 468 19 166 83 88 249 800 182 559 379 395 179 1071 260 489 491 1146 540 82…
Output: 11

Example 2:

Input: 1683 3630 1 1683 1030 1481 647 1587 268 516 253 1412 1079 1320 466 929 404 1576 432 1532 21 517 167 1366 391 1670 388 1242 507 673 1011 1029 766 1324 877 1584 760 1371 870 912 453 1142 350 660 1271 1557 421 1125 255 1206 809 1000 34 1214 958 1255 71 1350 1499 1680 1387 1611 396 664 170 753 365 470 313 686 330 373 612 1119 576 727 1182 1587 759 1356 253 1567 843 1336 1250 1301 446 1653 1519 1567 612 838 193 454 774 1560 469 1266 198 1508 266 616 665 1076 191 533 60 817 1114 1358 1025 1464 11 1034 1331 1612 788 975 1292 1315 504 1445 531 1611 788 1140 426 573 141 476 952 1006 1117 1637 1054 1351 1174 1407 848 1543 326 1299 501 659 39 379 860 1002 304 690 760 1365 657 1213 818 1410 311 1647 603 729 448 1606 258 982 1344 1420 54 362 79 230 169 1139 219 259 3 480 419 677 599 880 3 619 1142 1495…
Output: 5

Example 3:

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

Constraints:

1 <= n <= 2462; 0 <= m <= 4924.

Loading...
Test Cases:No test cases
No test cases available.
Dino and the Fewest Hops - MEDIUM Coding Problem | CodeTikki