CT46260

Last tunnels of Yuri

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Yuri inherited the timber yard at the desert outpost of Sandspire along with its curious bookkeeping system for tunnels. Time to make sense of it. 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 <= 1101; 0 <= m <= 2202.

Example 1:

Input: 97 2167 1 97 69 92 49 67 28 33 30 56 2 55 14 79 37 53 38 57 58 85 18 39 42 92 10 55 74 91 3 28 16 81 1 4 21 69 27 60 53 70 77 97 46 70 43 48 33 97 31 52 23 71 36 47 45 71 55 69 37 40 50 71 35 97 68 89 26 87 26 68 64 77 18 25 7 69 19 42 81 91 58 68 18 24 45 75 6 10 34 48 13 96 20 86 21 26 18 21 5 23 55 88 52 75 2 17 61 79 35 71 44 78 48 66 32 59 75 87 16 58 66 89 13 79 34 62 1 32 9 94 59 67 50 88 50 75 19 67 1 80 39 71 11 65 34 78 23 57 72 91 14 30 22 46 55 62 28 87 29 32 64 80 73 89 13 48 57 81 13 15 63 82 6 71 56 62 2 51 14 50 38 93 44 73 21 31 17 22 51 88 39 55 24 81 26 83 71 93 28 39 71 97 34 54 61 90 63 72 94 96 69 93 11 25 47 82 25 62 30 77 37 94 19 31 89 91 38 69 38 71 11 35 58 66 31 36 16 96 79 84 58 62 66 80 21 60 52 88 21 74 23 55 50 57 49 90 15 77 35 55 19 88 43 82 10 91 8 84 22 …
Output: 2

Example 2:

Input: 73 850 1 73 8 37 59 70 35 63 52 55 39 60 6 10 25 54 25 35 28 41 23 46 22 50 1 45 50 57 7 24 18 53 4 25 16 33 60 72 23 59 18 19 49 68 16 21 33 54 18 71 49 66 12 34 3 18 7 10 20 32 43 52 18 60 22 59 6 63 28 50 17 53 5 44 40 51 56 63 27 42 25 58 24 29 36 48 51 62 9 63 19 70 2 19 59 61 38 55 43 46 20 50 57 60 30 36 4 41 34 59 19 52 45 52 22 51 14 36 34 40 23 28 11 19 29 57 12 38 22 38 46 54 38 58 20 59 18 59 48 60 6 33 32 67 4 56 4 22 40 59 18 44 35 46 22 73 8 47 54 70 26 49 53 73 5 57 4 13 12 45 6 9 9 23 17 51 31 37 17 39 26 40 16 67 28 59 28 48 27 59 33 67 3 67 28 33 29 61 62 72 6 27 4 42 67 69 48 49 32 73 71 72 14 63 28 31 24 72 15 38 31 36 8 21 1 16 27 57 31 68 35 54 52 70 4 24 29 49 50 69 17 42 70 72 7 36 7 8 17 63 24 57 42 46 3 59 21 26 23 43 46 51 26 58 15 37 2 36 41 60 52 72 30 57 26 4…
Output: 2

Example 3:

Input: 755 754 1 755 537 572 509 618 379 715 210 535 225 621 460 743 51 490 122 191 580 612 186 439 251 648 206 558 111 394 74 227 26 185 136 491 32 193 66 523 278 524 165 351 489 619 580 628 476 755 106 417 106 173 3 728 534 563 614 620 320 566 480 676 176 730 107 309 69 307 285 365 429 692 488 548 73 629 583 597 99 416 87 531 303 487 470 499 103 254 486 559 333 598 440 492 137 265 186 602 467 607 190 361 446 689 40 412 371 691 348 551 181 460 438 622 327 387 569 727 281 391 19 270 615 689 214 565 70 573 418 576 404 675 144 295 459 484 356 508 49 482 317 388 164 740 380 501 94 405 53 566 191 475 148 343 230 702 465 545 52 557 175 359 166 684 541 577 7 718 76 560 175 399 98 301 119 431 26 191 75 208 45 439 442 703 46 700 118 242 404 529 495 574 414 446 23 384 144 292 64 408 209 689 52 187 316 358…
Output: 7

Constraints:

1 <= n <= 1101; 0 <= m <= 2202.

Loading...
Test Cases:No test cases
No test cases available.
Last tunnels of Yuri - MEDIUM Coding Problem | CodeTikki