結果
問題 | No.898 tri-βutree |
ユーザー | tenten |
提出日時 | 2023-03-15 15:39:52 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 2,206 ms / 4,000 ms |
コード長 | 3,639 bytes |
コンパイル時間 | 3,033 ms |
コンパイル使用メモリ | 95,184 KB |
実行使用メモリ | 120,416 KB |
最終ジャッジ日時 | 2023-10-18 12:26:00 |
合計ジャッジ時間 | 36,180 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 853 ms
120,416 KB |
testcase_01 | AC | 54 ms
42,364 KB |
testcase_02 | AC | 60 ms
44,416 KB |
testcase_03 | AC | 61 ms
44,424 KB |
testcase_04 | AC | 63 ms
44,384 KB |
testcase_05 | AC | 61 ms
44,360 KB |
testcase_06 | AC | 61 ms
44,368 KB |
testcase_07 | AC | 1,517 ms
107,864 KB |
testcase_08 | AC | 1,463 ms
105,932 KB |
testcase_09 | AC | 1,864 ms
120,188 KB |
testcase_10 | AC | 1,423 ms
110,388 KB |
testcase_11 | AC | 1,437 ms
113,008 KB |
testcase_12 | AC | 1,550 ms
110,000 KB |
testcase_13 | AC | 1,815 ms
109,224 KB |
testcase_14 | AC | 1,961 ms
117,452 KB |
testcase_15 | AC | 1,473 ms
112,268 KB |
testcase_16 | AC | 1,568 ms
105,896 KB |
testcase_17 | AC | 2,206 ms
120,104 KB |
testcase_18 | AC | 1,444 ms
110,356 KB |
testcase_19 | AC | 1,432 ms
110,324 KB |
testcase_20 | AC | 1,533 ms
117,500 KB |
testcase_21 | AC | 1,564 ms
105,928 KB |
ソースコード
import java.io.*; import java.util.*; import java.util.stream.*; public class Main { static ArrayList<HashMap<Integer, Integer>> graph = new ArrayList<>(); static int[][] parents; static int[] depths; 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[18][n]; values = new long[n]; setDepth(0, 0, 0, 0); for (int i = 1; i < 18; i++) { for (int j = 0; j < n; j++) { parents[i][j] = parents[i - 1][parents[i - 1][j]]; } } int q = sc.nextInt(); StringBuilder sb = new StringBuilder(); while (q-- > 0) { int[] points = new int[3]; long ans = 0; for (int i = 0; i < 3; i++) { points[i] = sc.nextInt(); ans += values[points[i]]; } for (int i = 0; i < 3; i++) { int lca = getLCA(points[i], points[(i + 1) % 3]); ans -= values[lca]; } sb.append(ans).append("\n"); } System.out.print(sb); } static int getLCA(int a, int b) { if (depths[a] < depths[b]) { return getLCA(b, a); } for (int i = 17; i >= 0; i--) { if (depths[a] - depths[b] < (1 << i)) { continue; } a = parents[i][a]; } if (a == b) { return a; } for (int i = 17; i >= 0; i--) { if (parents[i][a] != parents[i][b]) { a = parents[i][a]; b = parents[i][b]; } } return parents[0][a]; } static void setDepth(int idx, int p, int d, long v) { parents[0][idx] = p; depths[idx] = d; values[idx] = v; for (int x : graph.get(idx).keySet()) { if (x != p) { setDepth(x, idx, d + 1, v + graph.get(idx).get(x)); } } } } class Utilities { static String arrayToLineString(Object[] arr) { return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n")); } static String arrayToLineString(int[] arr) { return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new)); } } class Scanner { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(""); StringBuilder sb = new StringBuilder(); public Scanner() throws Exception { } public int nextInt() throws Exception { return Integer.parseInt(next()); } public long nextLong() throws Exception { return Long.parseLong(next()); } public double nextDouble() throws Exception { return Double.parseDouble(next()); } public int[] nextIntArray() throws Exception { return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray(); } public String next() throws Exception { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }