CT30308

The Fewest Hops at Barking Cove

MediumL4 · Loop LordAcceptance: 0.0%XP: 35

It is audit day at the seal rocks of Barking Cove. Tina spreads the tunnels records across the table and picks up a sharp pencil. 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 <= 659; 0 <= m <= 1318.

Example 1:

Input: 48 807 1 48 16 39 6 26 1 11 8 16 11 18 37 42 18 45 16 25 16 30 21 41 5 32 16 19 39 42 2 41 24 33 3 28 22 30 2 10 39 44 1 17 3 23 41 48 6 33 36 40 7 36 8 25 11 33 4 44 5 23 17 35 9 15 12 45 18 19 6 14 10 11 6 21 12 37 3 25 3 31 28 30 4 14 29 41 2 45 1 32 1 42 13 18 1 48 27 36 27 45 8 39 39 47 15 38 5 10 23 25 8 29 23 27 16 38 46 47 23 44 12 26 4 35 18 24 22 45 16 32 20 41 9 40 27 29 2 46 20 45 18 44 9 35 21 43 7 31 17 42 30 43 29 37 7 11 10 48 31 44 29 30 7 20 5 36 6 30 28 33 20 33 4 23 17 19 5 33 1 23 23 42 35 46 26 36 12 34 9 14 25 30 29 45 8 38 25 43 2 39 33 42 19 37 7 45 31 32 19 39 2 4 1 16 17 37 39 48 18 37 26 32 13 47 42 48 24 39 9 25 34 48 14 20 39 41 5 12 36 39 4 28 39 46 3 5 32 40 22 33 23 32 6 27 4 30 4 45 24 27 27 32 7 40 21 40 34 46 43 45 27 43 5 43 31 40 1 28 8 36 6 28 10 29 3…
Output: 1

Example 2:

Input: 156 436 1 156 120 145 114 123 8 99 67 69 71 86 22 103 26 111 11 106 43 112 15 143 97 101 54 112 116 135 71 132 49 88 32 125 95 133 34 78 46 95 10 48 7 38 34 91 30 107 20 36 12 32 39 41 51 80 14 127 35 90 21 63 106 142 152 153 29 139 86 154 40 143 48 133 39 133 74 86 80 139 120 128 6 153 102 125 30 39 78 129 94 114 80 154 35 46 105 130 108 155 26 156 36 51 5 17 93 105 102 155 87 137 9 136 4 154 142 153 14 122 7 27 96 102 88 121 77 128 40 150 116 138 41 101 83 87 55 76 96 126 13 143 13 105 19 119 55 101 16 21 108 140 89 144 36 64 1 99 80 141 94 148 13 144 9 74 12 103 70 135 38 152 43 64 43 93 21 93 31 141 16 79 9 20 21 96 25 108 14 97 51 56 88 103 47 119 86 138 90 138 57 89 81 87 79 90 39 85 75 83 84 92 18 125 82 127 34 36 66 92 95 127 34 102 31 125 61 114 3 140 60 139 72 91 51 113 101 118 3…
Output: 3

Example 3:

Input: 442 454 1 442 57 68 386 431 67 425 116 240 156 416 79 292 275 390 111 376 126 346 88 205 218 303 224 255 243 379 218 423 105 115 130 392 169 362 142 442 352 359 130 408 208 439 190 216 11 130 26 338 78 301 16 46 69 221 10 119 170 393 295 344 137 432 100 307 367 408 172 199 327 404 166 298 4 94 77 96 69 402 40 173 46 47 322 372 306 344 150 427 82 89 142 233 1 422 229 236 215 418 12 36 185 392 185 212 13 297 83 128 243 414 76 161 318 374 8 54 231 395 169 360 188 211 40 96 250 405 239 290 61 107 151 231 120 284 111 419 122 370 97 353 241 256 121 306 180 343 248 372 107 181 427 433 134 240 15 203 8 80 221 335 388 420 12 334 64 336 20 140 57 129 36 165 274 372 193 370 27 407 69 194 130 235 5 428 53 267 125 197 249 280 103 115 165 341 199 427 66 137 265 310 252 356 28 315 112 322 173 420 81 183 …
Output: 13

Constraints:

1 <= n <= 659; 0 <= m <= 1318.

Loading...
Test Cases:No test cases
No test cases available.
The Fewest Hops at Barking Cove - MEDIUM Coding Problem | CodeTikki