CT37743

Axel's bridges Reckoning

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

It is audit day at the cinnabar mines of Vermilion. Axel spreads the bridges records across the table and picks up a sharp pencil. Task: Print YES if the undirected graph's nodes can be split into two groups with no edge inside a group, otherwise NO. Input format: First line: n and m. Next m lines: u v. Output format: Print YES or NO. Constraints: 1 <= n <= 1376; 0 <= m <= 2752; self-edges make the answer NO.

Example 1:

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

Example 2:

Input: 369 1665 1 2 2 3 1 3 24 301 115 166 119 280 73 184 68 332 52 111 191 266 81 95 203 297 84 155 14 134 216 307 41 239 93 156 51 288 32 357 92 229 50 316 74 341 76 303 82 358 295 316 24 89 15 257 181 192 61 248 56 243 42 74 90 233 214 308 17 45 56 333 72 334 208 274 20 258 5 248 104 113 143 326 151 199 198 210 20 91 74 356 305 363 267 284 57 91 3 147 219 220 275 319 9 224 102 325 237 249 198 296 130 174 311 334 247 321 62 314 130 141 91 160 6 357 198 269 275 301 16 57 166 250 5 6 16 322 106 284 342 346 22 220 31 34 105 322 190 361 73 93 156 289 51 300 234 368 29 297 128 289 225 300 245 340 168 236 92 360 104 293 143 270 16 154 64 112 30 310 276 294 288 338 177 189 168 359 2 129 7 146 194 221 152 196 275 308 30 231 142 271 40 261 13 337 110 146 72 177 26 237 149 199 254 280 337 347 30 250 263 …
Output: NO

Example 3:

Input: 293 1146 15 276 86 159 120 151 222 244 185 255 7 22 55 249 106 270 236 272 123 139 33 214 132 266 62 241 143 167 196 218 8 191 11 166 4 225 101 184 78 216 84 243 263 266 12 184 209 292 217 274 153 184 61 132 144 211 45 123 13 82 133 220 29 51 115 191 74 154 27 114 67 219 90 123 156 273 197 228 180 242 52 224 30 183 163 217 88 274 46 94 72 80 21 114 98 163 13 193 283 293 78 109 87 171 92 174 38 70 104 244 247 286 175 253 192 229 57 152 65 237 83 120 167 224 12 216 46 80 274 292 64 97 156 218 57 147 19 229 15 130 108 273 32 169 218 263 89 105 71 89 38 214 106 125 43 89 209 288 23 182 226 255 33 56 51 77 138 194 109 120 194 251 103 293 42 68 51 243 75 109 20 145 27 148 99 195 31 170 10 144 76 205 163 259 27 65 172 264 139 192 227 276 18 88 79 212 210 288 61 203 30 169 64 174 57 273 43 111 65 …
Output: NO

Constraints:

1 <= n <= 1376; 0 <= m <= 2752; self-edges make the answer NO.

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