Submission #2554803
Source Code Expand
using System; using System.Collections.Generic; using System.Threading; namespace Abc070d { class Program { static void Main(string[] args) { int n = int.Parse(Console.ReadLine()); List<List<int>> branches = new List<List<int>>(); for (int i = 0; i < n - 1; i++) { string[] input = Console.ReadLine().Split(' '); List<int> branch = new List<int>() { int.Parse(input[0]), int.Parse(input[1]), int.Parse(input[2]) }; branches.Add(branch); } string[] query = Console.ReadLine().Split(' '); int q_num = int.Parse(query[0]); int k = int.Parse(query[1]); long[] dp = new long[n + 1]; dp[k] = 0; List<int> queue = new List<int>(); queue.Add(k); List<int> yet = new List<int>(); for (int i = 0; i < n - 1; i++) { yet.Add(i); } while (queue.Count > 0) { int current = queue[0]; queue.RemoveAt(0); List<int> found = yet.FindAll(index => branches[index][0] == current || branches[index][1] == current); foreach (int index in found) { List<int> branch = branches[index]; if (branch[0] == current) { dp[branch[1]] = dp[current] + branch[2]; queue.Add(branch[1]); yet.Remove(index); continue; } if (branch[1] == current) { dp[branch[0]] = dp[current] + branch[2]; queue.Add(branch[0]); yet.Remove(index); } } } for (int i = 0; i < q_num; i++) { string[] q = Console.ReadLine().Split(' '); int x = int.Parse(q[0]); int y = int.Parse(q[1]); Console.WriteLine(dp[x] + dp[y]); } } } }
Submission Info
Submission Time | |
---|---|
Task | D - Transit Tree Path |
User | katand |
Language | C# (Mono 4.6.2.0) |
Score | 0 |
Code Size | 2372 Byte |
Status | TLE |
Exec Time | 2109 ms |
Memory | 32796 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 400 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_2.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_28.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 24 ms | 11348 KB |
sample_02.txt | AC | 22 ms | 9056 KB |
sample_03.txt | AC | 22 ms | 11104 KB |
subtask_1_1.txt | AC | 23 ms | 11092 KB |
subtask_1_10.txt | AC | 449 ms | 15956 KB |
subtask_1_11.txt | AC | 26 ms | 11220 KB |
subtask_1_12.txt | AC | 59 ms | 13396 KB |
subtask_1_13.txt | AC | 154 ms | 15576 KB |
subtask_1_14.txt | AC | 23 ms | 11104 KB |
subtask_1_15.txt | AC | 306 ms | 15456 KB |
subtask_1_16.txt | TLE | 2108 ms | 31536 KB |
subtask_1_17.txt | TLE | 2109 ms | 27440 KB |
subtask_1_18.txt | TLE | 2109 ms | 25392 KB |
subtask_1_19.txt | TLE | 2109 ms | 29488 KB |
subtask_1_2.txt | AC | 44 ms | 11232 KB |
subtask_1_20.txt | TLE | 2108 ms | 27436 KB |
subtask_1_21.txt | TLE | 2108 ms | 25388 KB |
subtask_1_22.txt | TLE | 2109 ms | 25388 KB |
subtask_1_23.txt | TLE | 2109 ms | 27436 KB |
subtask_1_24.txt | TLE | 2109 ms | 32672 KB |
subtask_1_25.txt | TLE | 2109 ms | 30624 KB |
subtask_1_26.txt | TLE | 2109 ms | 32796 KB |
subtask_1_27.txt | TLE | 2109 ms | 32672 KB |
subtask_1_28.txt | TLE | 2108 ms | 26968 KB |
subtask_1_3.txt | TLE | 2108 ms | 22624 KB |
subtask_1_4.txt | AC | 23 ms | 11104 KB |
subtask_1_5.txt | AC | 592 ms | 16328 KB |
subtask_1_6.txt | AC | 1205 ms | 14664 KB |
subtask_1_7.txt | AC | 494 ms | 16080 KB |
subtask_1_8.txt | AC | 23 ms | 13152 KB |
subtask_1_9.txt | TLE | 2109 ms | 29360 KB |