結果
問題 | No.898 tri-βutree |
ユーザー |
![]() |
提出日時 | 2024-07-22 13:40:24 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,301 bytes |
コンパイル時間 | 2,816 ms |
コンパイル使用メモリ | 83,448 KB |
実行使用メモリ | 125,736 KB |
最終ジャッジ日時 | 2024-07-22 13:41:00 |
合計ジャッジ時間 | 29,470 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1,044 ms
125,736 KB |
testcase_01 | AC | 61 ms
37,576 KB |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
ソースコード
import java.io.*; import java.util.*; import java.util.function.*; import java.util.stream.*; public class Main { static List<Map<Integer, Integer>> graph = new ArrayList<>(); static int[] depths; static int[][] parents; static long[] values; public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); for (int i = 0; i < n; i++) { graph.add(new HashMap<>()); } for (int i = 0; i < n - 1; i++) { int a = sc.nextInt(); int b = sc.nextInt(); int c = sc.nextInt(); graph.get(a).put(b, c); graph.get(b).put(a, c); } depths = new int[n]; parents = new int[20][n]; values = new long[n]; setDepth(0, 0, 0, 0); for (int i = 1; i < 20; i++) { for (int j = 0; j < n; j++) { parents[i][j] = parents[i - 1][parents[i - 1][j]]; } } int q = sc.nextInt(); System.out.println(IntStream.range(0, q) .mapToObj(i -> String.valueOf(getSize(new int[]{sc.nextInt(), sc.nextInt(), sc.nextInt()}))) .collect(Collectors.joining("\n"))); } static void setDepth(int idx, int p, int d, long v) { depths[idx] = d; parents[0][idx] = p; values[idx] = v; for (int x : graph.get(idx).keySet()) { if (x != p) { setDepth(x, idx, d + 1, v + graph.get(idx).get(x)); } } } static long getSize(int[] points) { int ans = 0; for (int i = 0; i < points.length; i++) { ans += getSize(points[i], points[(i + 1) % points.length]); } return ans / 2; } static long getSize(int a, int b) { return values[a] + values[b] - values[getLCA(a, b)] * 2; } static int getLCA(int a, int b) { if (depths[a] < depths[b]) { return getLCA(b, a); } for (int i = 19; i >= 0; i--) { if (depths[a] - depths[b] >= (1 << i)) { a = parents[i][a]; } } if (a == b) { return a; } for (int i = 19; i >= 0; i--) { if (parents[i][a] != parents[i][b]) { a = parents[i][a]; b = parents[i][b]; } } return parents[0][a]; } } class Scanner { BufferedReader br; StringTokenizer st = new StringTokenizer(""); StringBuilder sb = new StringBuilder(); public Scanner() { try { br = new BufferedReader(new InputStreamReader(System.in)); } catch (Exception e) { } } public int nextInt() { return Integer.parseInt(next()); } public long nextLong() { return Long.parseLong(next()); } public double nextDouble() { return Double.parseDouble(next()); } public String next() { try { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } } catch (Exception e) { e.printStackTrace(); } finally { return st.nextToken(); } } }