Submission #1003865
Source Code Expand
def dfs(z,c) f=G[c].size==2?1:0 r=[0,c] G[c].each{|e| next if e==z t=dfs(c,e) r=[r,[t[0]+f,t[1]]].max } r end N=gets.to_i G=N.times.map{[]} (N-1).times{ a,b=gets.split.map(&:to_i) G[a-1]<<b-1 G[b-1]<<a-1 } p dfs(-1,dfs(-1,0)[1])[0]+G.count{|e|e.size==1}
Submission Info
Submission Time | |
---|---|
Task | K - Problem on Tree |
User | leafmoon |
Language | Ruby (2.3.3) |
Score | 100 |
Code Size | 284 Byte |
Status | AC |
Exec Time | 436 ms |
Memory | 12412 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt |
All | sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, subtask1_30.txt, subtask1_31.txt, subtask1_32.txt, subtask1_33.txt, subtask1_34.txt, subtask1_35.txt, subtask1_36.txt, subtask1_37.txt, subtask1_38.txt, subtask1_39.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 11 ms | 1788 KB |
sample_02.txt | AC | 11 ms | 1788 KB |
subtask1_01.txt | AC | 320 ms | 10876 KB |
subtask1_02.txt | AC | 281 ms | 10236 KB |
subtask1_03.txt | AC | 115 ms | 4604 KB |
subtask1_04.txt | AC | 144 ms | 6652 KB |
subtask1_05.txt | AC | 176 ms | 6652 KB |
subtask1_06.txt | AC | 28 ms | 2428 KB |
subtask1_07.txt | AC | 385 ms | 11644 KB |
subtask1_08.txt | AC | 114 ms | 4732 KB |
subtask1_09.txt | AC | 270 ms | 10620 KB |
subtask1_10.txt | AC | 315 ms | 10620 KB |
subtask1_11.txt | AC | 146 ms | 6524 KB |
subtask1_12.txt | AC | 64 ms | 3324 KB |
subtask1_13.txt | AC | 40 ms | 2940 KB |
subtask1_14.txt | AC | 43 ms | 3068 KB |
subtask1_15.txt | AC | 412 ms | 12156 KB |
subtask1_16.txt | AC | 402 ms | 12156 KB |
subtask1_17.txt | AC | 415 ms | 12028 KB |
subtask1_18.txt | AC | 418 ms | 12156 KB |
subtask1_19.txt | AC | 429 ms | 12284 KB |
subtask1_20.txt | AC | 384 ms | 11516 KB |
subtask1_21.txt | AC | 398 ms | 12028 KB |
subtask1_22.txt | AC | 410 ms | 12028 KB |
subtask1_23.txt | AC | 402 ms | 12156 KB |
subtask1_24.txt | AC | 404 ms | 12028 KB |
subtask1_25.txt | AC | 383 ms | 11516 KB |
subtask1_26.txt | AC | 428 ms | 12028 KB |
subtask1_27.txt | AC | 427 ms | 12284 KB |
subtask1_28.txt | AC | 387 ms | 11516 KB |
subtask1_29.txt | AC | 429 ms | 12284 KB |
subtask1_30.txt | AC | 436 ms | 12156 KB |
subtask1_31.txt | AC | 416 ms | 12412 KB |
subtask1_32.txt | AC | 414 ms | 12156 KB |
subtask1_33.txt | AC | 413 ms | 12156 KB |
subtask1_34.txt | AC | 426 ms | 12156 KB |
subtask1_35.txt | AC | 415 ms | 12028 KB |
subtask1_36.txt | AC | 417 ms | 12284 KB |
subtask1_37.txt | AC | 394 ms | 12284 KB |
subtask1_38.txt | AC | 417 ms | 12156 KB |
subtask1_39.txt | AC | 389 ms | 11516 KB |