CT29761

The Separate Camps at Sleekwater

MediumL4 · Loop LordAcceptance: 0.0%XP: 35

Hans found an old ledger of bridges in the stall attic at the otter slides of Sleekwater. The margin notes pose a precise question. 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 <= 612; 0 <= m <= 1224; 1 <= u,v <= n.

Example 1:

Input: 213 1150 70 187 99 179 111 155 3 170 140 152 4 101 12 70 119 126 54 127 41 105 102 120 46 130 133 157 46 185 76 170 100 211 11 29 100 192 109 196 58 94 15 148 63 125 58 59 99 133 89 117 78 106 5 85 37 81 34 201 31 156 115 181 38 71 86 91 78 156 19 176 102 144 162 204 83 105 55 147 27 49 31 73 65 134 163 168 69 189 71 72 43 52 8 56 26 120 7 20 171 178 88 180 15 96 140 194 109 147 182 201 77 179 38 41 13 32 58 88 128 138 158 206 173 210 61 133 77 162 34 59 162 179 42 114 108 131 2 198 60 75 134 164 54 174 38 120 51 81 34 76 205 206 22 26 23 145 59 188 49 144 70 161 39 104 1 127 68 151 40 175 13 22 7 45 68 116 159 165 21 137 56 135 35 55 107 201 22 122 148 177 129 202 60 191 22 128 9 153 87 131 49 106 63 171 6 117 101 192 114 195 120 153 17 43 204 213 158 167 47 174 149 178 13 168 96 141 110 …
Output: 1

Example 2:

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

Example 3:

Input: 341 569 309 318 4 284 82 243 121 227 322 337 284 323 2 75 320 341 158 192 108 234 226 306 148 293 85 155 186 284 13 232 231 291 192 299 137 310 206 340 159 244 255 316 32 35 230 259 267 285 12 277 212 274 232 312 157 182 11 164 106 221 73 131 53 63 18 200 63 210 125 204 30 248 49 311 12 63 89 304 85 267 19 43 147 261 156 211 144 182 13 136 160 246 89 118 174 195 192 290 2 294 85 284 33 84 243 277 61 181 76 148 85 128 159 310 69 281 49 208 187 248 7 10 47 223 286 303 68 239 144 280 84 110 212 299 157 302 154 248 45 141 232 329 84 254 47 115 194 296 124 164 132 187 17 178 109 186 61 320 4 101 26 162 75 308 68 160 270 334 68 162 114 185 28 129 8 63 197 274 146 289 14 220 112 172 40 211 19 221 8 168 69 72 5 234 103 176 130 252 102 193 53 325 124 125 303 340 20 85 84 238 64 181 330 336 94 161 6…
Output: 13

Constraints:

1 <= n <= 612; 0 <= m <= 1224; 1 <= u,v <= n.

Loading...
Test Cases:No test cases
No test cases available.
The Separate Camps at Sleekwater - MEDIUM Coding Problem | CodeTikki