CT54118

Brewer's corridors Separate Camps

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Brewer the customs officer watches over the opal reefs of Shimmerdeep's stores of corridors. A careful computation stands between order and chaos. 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 <= 1251; 0 <= m <= 2502; 1 <= u,v <= n.

Example 1:

Input: 139 534 20 97 10 20 14 106 40 136 19 107 32 92 75 94 58 93 53 83 15 137 23 121 100 103 55 79 43 119 80 125 26 31 73 115 63 114 48 92 59 114 29 35 34 65 3 92 29 56 7 67 21 104 81 87 15 85 11 26 32 42 74 101 68 120 53 133 77 101 24 35 26 126 53 57 22 61 89 133 41 127 102 116 10 132 72 89 44 66 43 132 2 41 6 18 26 37 57 99 20 133 63 122 19 23 125 136 104 130 90 110 118 126 119 125 17 84 96 123 11 24 47 56 16 113 69 107 20 22 45 139 27 65 113 114 53 96 24 28 7 36 15 52 24 128 106 115 12 24 48 125 95 111 79 137 12 102 13 74 83 98 75 129 31 107 68 83 51 136 130 139 93 110 90 128 64 90 9 21 82 126 111 137 34 121 86 135 28 115 24 125 15 129 48 72 104 128 81 112 123 135 56 108 3 100 21 132 118 123 25 52 27 72 7 63 116 138 1 52 14 135 65 79 52 117 27 75 88 105 16 134 8 68 97 99 43 86 6 60 53 71 13 1…
Output: 1

Example 2:

Input: 229 1313 17 204 43 88 150 151 93 181 177 190 109 127 53 91 140 203 39 172 110 221 159 212 100 207 67 139 73 154 38 219 94 151 154 213 194 210 97 175 65 72 76 104 170 189 175 208 1 203 201 203 135 188 149 195 97 209 32 58 142 160 62 144 172 179 67 103 72 84 76 146 146 220 101 191 54 193 142 168 93 195 83 152 55 149 70 134 91 221 158 197 124 158 95 152 102 159 3 102 50 194 132 149 80 85 94 175 111 167 24 201 44 128 29 113 109 148 97 150 10 212 81 199 13 141 41 147 63 190 109 208 22 160 52 174 77 83 145 212 48 102 90 222 136 158 29 40 109 167 65 164 82 87 2 177 36 201 21 50 54 126 141 211 91 129 2 53 80 216 176 223 79 211 57 199 164 217 61 194 128 213 147 160 86 125 19 28 189 216 141 219 187 219 123 214 144 220 68 71 89 135 42 228 22 27 75 116 35 151 37 151 106 170 79 216 157 196 107 219 53 1…
Output: 1

Example 3:

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

Constraints:

1 <= n <= 1251; 0 <= m <= 2502; 1 <= u,v <= n.

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