Submission #363622
Source Code Expand
def dfs(g, h, now, parent) have = h[now] == 1 cost = 0 g[now].each do |to| next if to == parent val,has = dfs(g, h, to, now) if has cost += val + 2 have = true end end [cost, have] end n,x = gets.split.map(&:to_i) h = gets.split.map(&:to_i) g = 1.upto(n).map { |_| [] } 1.upto(n-1).each do |_| a,b = gets.split.map(&:to_i).map { |k| k-1 } g[a].push b g[b].push a end puts dfs(g, h, x-1, -1)[0]
Submission Info
Submission Time | |
---|---|
Task | B - ツリーグラフ |
User | hamadu |
Language | Ruby (1.9.3) |
Score | 100 |
Code Size | 464 Byte |
Status | AC |
Exec Time | 54 ms |
Memory | 4568 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample_01.txt, subtask0_sample_02.txt |
All | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask1_line01.txt, subtask1_line02.txt, subtask1_line03.txt, subtask1_line04.txt, subtask1_line05.txt, subtask1_line06.txt, subtask1_random01.txt, subtask1_random02.txt, subtask1_random03.txt, subtask1_random04.txt, subtask1_random05.txt, subtask1_random06.txt, subtask1_random07.txt, subtask1_random08.txt, subtask1_special01.txt, subtask1_special02.txt, subtask1_special03.txt, subtask1_special04.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample_01.txt | AC | 49 ms | 4312 KB |
subtask0_sample_02.txt | AC | 48 ms | 4308 KB |
subtask1_line01.txt | AC | 48 ms | 4308 KB |
subtask1_line02.txt | AC | 49 ms | 4568 KB |
subtask1_line03.txt | AC | 49 ms | 4444 KB |
subtask1_line04.txt | AC | 50 ms | 4464 KB |
subtask1_line05.txt | AC | 50 ms | 4440 KB |
subtask1_line06.txt | AC | 51 ms | 4444 KB |
subtask1_random01.txt | AC | 48 ms | 4316 KB |
subtask1_random02.txt | AC | 50 ms | 4368 KB |
subtask1_random03.txt | AC | 50 ms | 4368 KB |
subtask1_random04.txt | AC | 48 ms | 4316 KB |
subtask1_random05.txt | AC | 47 ms | 4316 KB |
subtask1_random06.txt | AC | 50 ms | 4296 KB |
subtask1_random07.txt | AC | 50 ms | 4308 KB |
subtask1_random08.txt | AC | 48 ms | 4352 KB |
subtask1_special01.txt | AC | 49 ms | 4292 KB |
subtask1_special02.txt | AC | 49 ms | 4300 KB |
subtask1_special03.txt | AC | 54 ms | 4312 KB |
subtask1_special04.txt | AC | 52 ms | 4308 KB |