CT29308

Odin and the Separate Camps

MediumL4 · Loop LordAcceptance: 0.0%XP: 35

The harbor bell rings at the crane marshes of Stillwater; Odin 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 <= 595; 0 <= m <= 1190; 1 <= u,v <= n.

Example 1:

Input: 104 144 14 96 18 42 40 70 36 84 62 85 66 90 18 95 14 84 88 90 40 77 45 83 22 90 8 40 23 101 32 58 27 92 66 93 9 15 4 18 60 67 34 99 25 77 22 43 32 42 34 96 13 34 31 104 25 96 2 15 65 68 14 85 46 60 20 62 47 67 12 49 45 67 80 82 58 89 58 74 5 45 3 29 1 52 68 90 67 86 5 12 91 104 46 74 16 54 23 68 2 63 48 49 7 70 16 22 55 93 84 88 7 48 37 52 66 91 39 91 61 76 31 53 9 46 58 66 2 48 13 63 17 66 32 81 13 102 22 31 21 90 5 77 80 100 64 104 6 29 21 40 75 97 50 53 3 81 81 89 35 61 64 103 2 10 82 97 19 41 38 104 7 56 49 59 14 92 17 85 50 83 10 70 90 99 77 92 33 89 45 49 31 51 59 88 52 101 40 91 91 95 30 83 51 68 3 13 26 52 6 48 92 102 5 67 1 97 44 68 52 85 12 98 25 97 88 102 49 62 33 85 61 95 43 55 21 27 35 76 9 74 52 103 50 97 44 67 46 84 23 37 49 90 8 41 25 58 40 83 45 81 11 72 29 35 10 35 28 49 …
Output: 7

Example 2:

Input: 280 94 35 209 101 214 19 228 193 196 115 189 112 157 13 168 26 71 1 86 169 206 98 161 96 195 87 116 49 214 205 218 50 79 115 174 71 78 67 139 84 96 211 269 121 220 60 275 24 94 43 76 14 238 238 240 237 262 47 156 152 252 140 150 54 227 61 154 47 131 246 258 36 251 52 114 92 275 57 260 124 177 30 279 23 179 188 263 7 37 167 231 51 264 34 59 92 151 93 123 91 126 109 203 35 152 233 236 33 129 31 110 121 233 83 258 131 263 1 197 50 191 2 77 146 276 53 144 196 250 150 174 201 266 159 270 20 222 224 264 200 230 67 215 2 68 56 89 80 112 156 162 136 234 48 146 53 194 67 167 101 134 15 215 59 91 13 106 31 125 25 276 88 212 116 194 123 192 12 171 83 87 162 275 111 180 164 209 93 238
Output: 186

Example 3:

Input: 21 152 9 20 4 14 5 20 17 20 5 11 3 4 16 19 1 4 8 11 6 21 12 19 15 18 12 17 3 15 13 17 9 11 9 16 1 20 8 16 16 21 11 17 7 11 8 18 7 9 12 14 4 6 13 19 14 21 5 7 7 19 20 21 2 15 15 19 8 10 2 19 1 19 1 17 18 21 17 21 10 20 4 5 3 9 5 9 6 11 16 17 4 20 4 17 16 18 7 15 16 20 2 20 5 8 5 21 2 8 2 7 13 15 9 21 7 20 7 12 4 15 4 19 2 5 7 17 3 5 8 17 13 21 4 21 2 21 3 16 12 16 4 18 1 12 10 12 2 10 11 12 2 18 5 18 11 13 14 18 6 20 11 15 3 18 11 21 13 20 6 9 1 14 1 18 1 13 5 19 9 13 10 17 3 14 6 18 10 18 9 17 12 15 12 20 15 21 7 14 6 10 14 16 3 17 6 13 4 13 9 12 1 2 7 13 8 15 6 12 4 11 10 14 10 19 3 6 2 9 14 19 11 20 6 19 2 13 11 16 1 15 8 13 2 12 15 16 8 12 10 11 6 14 2 17 7 21 7 8 11 18 8 20 2 14 8 9 12 18 5 6 1 10 5 15 15 17 13 18 8 14 10 13 11 14 17 18 7 16 1 9 5 17 1 11 8 19 12 21 6 17 19 21 17 19
Output: 1

Constraints:

1 <= n <= 595; 0 <= m <= 1190; 1 <= u,v <= n.

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