CT31179

Dev's bridges Reckoning

MediumL4 · Loop LordAcceptance: 0.0%XP: 35

Deep in the forest village of Briarthorn, Dev studies rows of bridges entries. One clean number will settle the guild's oldest argument. Task: An undirected graph has n nodes and m edges. Print the number of connected components. Input format: First line: n and m. Next m lines: u v. Output format: Print the component count. Constraints: 1 <= n <= 1764; 0 <= m <= 3528; 1 <= u,v <= n.

Example 1:

Input: 1504 973 623 703 956 1088 961 1383 1299 1468 759 1397 894 1022 488 1214 50 783 494 1253 486 944 379 580 205 1479 421 822 407 786 298 1482 727 1464 987 1250 122 1260 261 344 137 798 129 1090 1144 1425 168 1033 239 1361 730 917 79 659 262 1004 1021 1066 171 313 668 1079 667 869 727 916 429 985 90 187 1030 1196 732 1400 664 1123 165 944 1290 1391 938 1247 250 1366 1060 1361 369 1303 1067 1434 39 1329 528 771 550 789 67 517 556 1446 301 1203 762 1236 553 803 58 314 597 1132 91 980 593 1018 200 574 118 953 1350 1406 366 413 893 914 438 835 214 284 1002 1028 894 1345 479 850 984 1344 595 850 404 1132 265 1086 581 1014 669 1127 256 1007 564 1148 410 1064 605 1181 56 1292 557 1130 1133 1178 857 1349 426 777 111 973 68 744 184 1474 587 1185 30 716 427 1382 246 1403 330 345 461 481 1334 1388 545 642…
Output: 544

Example 2:

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

Example 3:

Input: 538 1066 422 466 368 394 6 8 8 352 18 392 434 503 379 470 431 435 102 106 92 97 103 118 249 298 344 410 263 475 101 511 498 518 237 531 245 335 404 419 314 430 32 226 144 343 187 234 170 326 6 232 365 524 98 373 283 503 370 392 260 412 126 464 149 379 303 310 4 302 198 205 38 39 11 513 75 435 228 469 77 189 300 325 16 127 262 405 166 340 45 513 235 284 108 350 303 398 280 374 105 275 135 150 40 145 24 232 86 498 173 305 104 207 214 269 356 368 417 533 53 56 276 296 15 283 113 146 24 170 50 81 123 127 86 310 67 414 131 210 366 393 37 523 26 263 67 133 74 237 56 65 491 518 100 286 180 448 2 278 160 432 11 55 341 403 196 492 34 273 102 180 196 271 45 358 433 501 176 407 55 320 132 232 20 321 79 413 221 330 332 490 25 194 9 449 93 439 441 443 30 193 358 407 2 313 366 396 422 461 281 296 199 50…
Output: 13

Constraints:

1 <= n <= 1764; 0 <= m <= 3528; 1 <= u,v <= n.

Loading...
Test Cases:No test cases
No test cases available.
Dev's bridges Reckoning - MEDIUM Coding Problem | CodeTikki