CT43111

Boris's Twilight tunnels

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Boris runs the brewery at the saffron fields of Marigold Row. Today the books show a list of tunnels, and the numbers must be worked out before sundown. 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 <= 1118; 0 <= m <= 2236.

Example 1:

Input: 135 1949 1 135 106 133 46 51 16 24 69 106 66 80 64 109 74 118 2 9 103 111 62 134 17 24 62 80 82 113 45 92 68 91 87 101 117 120 27 49 22 47 51 114 46 64 3 93 27 60 70 134 13 35 8 12 21 38 65 109 82 105 35 49 46 71 18 46 14 74 23 115 21 102 78 124 30 120 7 58 38 73 19 82 77 93 91 101 33 108 67 112 47 123 94 99 19 21 82 104 64 66 73 132 31 124 54 105 51 62 17 96 49 114 81 96 82 127 25 69 25 26 12 54 54 115 36 40 6 117 9 92 75 125 29 61 24 110 121 128 106 127 100 103 3 15 16 134 56 107 43 62 14 132 10 127 74 86 124 126 24 106 1 92 20 86 16 21 62 95 66 91 29 88 73 106 63 117 13 22 46 113 8 78 61 62 64 87 18 124 35 93 88 118 103 128 43 112 76 94 71 97 33 68 21 118 26 30 64 131 79 132 57 61 112 130 21 37 34 108 65 130 75 109 15 88 26 92 37 65 20 74 79 135 31 32 67 124 23 59 17 118 51 119 18 24 23…
Output: 2

Example 2:

Input: 183 2221 1 183 86 128 56 121 75 123 16 133 159 162 119 121 2 16 19 127 31 145 35 137 113 143 29 156 32 46 15 26 96 118 69 173 34 75 74 167 21 89 7 25 170 181 149 154 42 69 65 168 101 126 26 92 72 140 43 95 35 85 42 81 20 21 7 140 32 85 36 156 90 107 61 102 116 120 73 177 10 132 53 102 57 98 22 145 76 124 65 123 7 54 121 162 65 172 13 174 92 113 116 147 71 108 161 162 50 90 29 83 49 116 28 120 68 95 20 52 69 155 113 150 52 100 153 158 27 139 66 86 66 166 100 163 68 101 9 179 5 56 89 91 69 100 87 94 7 45 65 149 122 167 67 76 79 147 129 156 161 167 23 77 137 142 3 64 64 70 164 167 4 125 4 128 24 90 98 117 86 141 79 108 106 118 98 99 10 180 44 57 92 167 37 69 82 119 120 148 83 113 13 106 8 130 151 161 37 153 53 70 92 154 112 126 53 90 155 164 78 167 44 45 3 77 14 128 90 155 130 142 119 129 3 1…
Output: 2

Example 3:

Input: 952 951 1 952 263 798 648 826 865 887 716 807 741 850 200 765 356 743 736 891 419 450 824 890 401 881 118 564 41 219 336 803 85 520 262 846 309 705 218 375 198 376 590 818 474 803 13 672 296 494 568 827 764 791 120 319 443 525 279 438 123 507 135 362 329 340 83 830 378 576 483 935 23 610 7 821 428 600 165 700 59 440 370 405 256 365 598 800 86 642 555 905 100 290 5 266 646 796 506 699 338 809 439 674 113 403 400 830 397 686 443 621 38 292 13 410 136 730 53 610 620 753 306 435 395 432 630 685 287 842 727 888 411 612 453 933 201 766 44 655 63 843 879 897 762 833 204 751 289 630 270 565 325 665 521 641 77 260 345 638 235 931 484 621 83 219 398 717 500 661 182 552 273 365 208 793 529 627 115 155 656 951 533 594 102 741 652 699 387 749 425 890 261 556 194 315 299 803 367 547 99 763 750 859 122 5…
Output: 15

Constraints:

1 <= n <= 1118; 0 <= m <= 2236.

Loading...
Test Cases:No test cases
No test cases available.
Boris's Twilight tunnels - MEDIUM Coding Problem | CodeTikki