CT54869

Tina Counts the canals

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Legend says the vault under the trading post of Goldmeadow opens only for a perfect tally of canals. Tina means to find out. Task: A tree has n nodes and n-1 unweighted edges. Print its diameter (in edges). Input format: First line: n. Next n-1 lines: u v. Output format: Print the diameter. Constraints: 1 <= n <= 2228; the input is a connected tree.

Example 1:

Input: 267 55 234 34 112 75 135 15 29 25 37 61 76 168 214 1 53 129 223 19 88 36 131 13 74 93 255 4 7 5 32 43 62 4 60 96 134 65 95 31 85 38 83 9 18 38 41 38 186 35 116 23 28 54 124 50 141 105 166 5 12 56 143 39 123 27 63 114 248 80 247 65 129 37 84 44 59 65 216 37 177 1 17 51 101 2 68 190 204 16 104 7 45 58 245 31 249 21 42 3 9 31 52 80 238 38 183 46 58 192 258 109 168 6 21 26 148 79 242 122 162 108 260 47 167 68 138 126 178 33 38 80 105 81 136 45 261 95 115 69 197 3 11 99 145 155 219 90 222 2 211 12 61 56 259 110 240 58 266 18 48 59 79 4 22 30 218 31 241 73 128 62 81 8 15 92 203 97 98 120 202 173 181 175 236 184 229 1 16 40 73 25 49 21 44 13 20 24 150 6 10 156 253 37 67 30 122 173 193 39 192 89 187 163 262 72 176 105 111 159 173 158 169 89 154 16 232 40 199 137 151 53 75 52 265 27 50 74 94 11 126…
Output: 16

Example 2:

Input: 826 174 373 286 303 356 368 43 178 329 793 200 315 62 91 111 412 120 175 430 809 533 634 288 578 448 747 231 293 278 625 7 192 61 165 482 738 377 428 84 105 128 164 15 380 358 408 48 217 498 506 14 176 24 779 81 221 284 676 357 433 288 479 229 242 85 429 30 168 423 800 14 334 192 440 509 529 370 420 267 444 262 274 20 65 17 821 116 163 428 818 13 247 259 652 136 328 61 64 172 197 442 456 389 698 661 774 429 513 131 141 217 347 348 439 526 591 20 76 340 383 316 542 276 422 209 644 262 534 49 69 535 717 73 685 83 385 34 291 49 80 180 230 49 311 9 50 186 490 89 268 74 120 8 31 237 267 259 359 60 158 380 708 103 521 152 666 40 63 307 438 634 808 110 825 572 594 376 458 89 443 5 8 176 240 327 655 598 600 472 701 259 684 5 7 167 189 156 484 236 507 1 2 72 169 705 785 297 508 128 736 104 290 173 …
Output: 26

Example 3:

Input: 150 33 49 87 105 15 144 2 17 14 59 12 60 9 97 12 96 1 27 12 55 25 52 27 58 35 83 94 139 1 46 89 143 9 72 2 8 75 134 86 88 21 23 62 69 57 92 10 128 1 39 111 123 34 51 129 142 56 64 23 68 6 18 6 7 34 63 105 121 23 56 90 119 35 124 1 10 59 93 1 5 37 113 7 62 3 45 16 145 4 9 16 53 6 138 60 84 82 146 34 66 9 12 1 99 85 120 105 129 6 13 56 65 8 32 26 100 131 148 54 107 59 86 14 25 10 44 22 36 70 111 12 98 22 133 60 94 3 4 16 20 10 30 49 61 53 85 15 31 5 87 72 106 70 118 1 2 15 40 96 104 72 126 4 15 47 71 38 57 10 22 31 103 26 114 1 3 34 78 65 137 27 101 60 110 25 28 8 82 91 140 43 54 34 37 60 108 24 80 21 43 49 70 5 149 9 122 64 75 49 117 9 11 14 24 96 125 6 34 6 14 50 132 96 135 71 141 24 35 2 29 141 147 5 90 35 67 36 127 108 116 34 50 22 74 14 16 2 112 30 73 11 109 45 136 34 89 21 77 1 41 33 1…
Output: 16

Constraints:

1 <= n <= 2228; the input is a connected tree.

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