CT44672

Last roads of Tracker

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The harbor bell rings at the forest village of Briarthorn; Tracker weighs the day's roads manifests and starts the calculations. 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 <= 2935; 0 <= m <= 5870; 1 <= u,v <= n.

Example 1:

Input: 310 2057 262 277 137 256 129 293 4 194 9 207 127 210 279 288 43 188 222 229 54 302 24 42 48 204 48 184 62 200 119 127 197 237 188 287 144 244 67 172 145 302 298 305 101 287 139 143 200 219 192 268 80 258 104 117 94 259 34 130 103 283 155 213 45 266 102 205 97 168 200 290 115 180 184 211 220 250 142 210 81 233 70 152 156 224 59 170 4 114 149 240 161 223 53 292 81 241 226 243 113 123 121 280 61 217 159 208 158 272 208 232 75 159 109 128 15 37 114 189 144 155 222 249 46 169 213 287 17 259 2 107 148 210 242 261 61 85 8 108 156 194 47 85 27 173 201 245 166 310 109 112 6 21 263 277 11 255 64 146 47 97 54 300 19 175 13 45 30 93 13 224 54 127 99 106 69 276 232 296 264 275 123 173 29 189 180 197 89 213 212 214 297 302 3 119 217 298 130 246 108 282 7 252 140 179 171 280 122 293 160 223 208 228 150 2…
Output: 1

Example 2:

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

Example 3:

Input: 1706 4896 1276 1675 704 1437 1079 1425 1441 1631 300 960 927 1628 1260 1633 857 1533 359 469 967 1163 884 1219 862 1283 38 805 289 739 264 758 329 1110 751 1524 266 522 350 900 287 1115 73 1556 54 533 1317 1482 477 996 517 1590 158 289 335 1432 1119 1562 228 590 61 1251 51 1531 133 1237 497 549 823 1058 863 1368 665 863 877 1583 881 923 680 870 711 1542 1432 1677 533 959 59 1322 280 1496 61 319 686 848 502 623 1102 1660 1044 1302 170 294 566 1650 119 1515 334 907 144 1613 405 554 533 565 884 1667 988 1238 231 1542 727 828 155 333 1344 1405 704 1173 839 863 554 1271 1217 1277 1289 1572 158 706 1018 1238 218 1651 1679 1687 743 1339 73 1474 700 959 71 1019 1070 1450 527 754 689 1323 537 914 624 1380 213 1218 1038 1204 641 1077 770 1270 9 565 1024 1527 639 870 832 1395 683 923 53 765 504 1242 …
Output: 3

Constraints:

1 <= n <= 2935; 0 <= m <= 5870; 1 <= u,v <= n.

Loading...
Test Cases:No test cases
No test cases available.