結果
問題 | No.1488 Max Score of the Tree |
ユーザー | tenten |
提出日時 | 2023-03-24 09:23:20 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 331 ms / 2,000 ms |
コード長 | 2,975 bytes |
コンパイル時間 | 2,885 ms |
コンパイル使用メモリ | 84,688 KB |
実行使用メモリ | 131,056 KB |
最終ジャッジ日時 | 2023-10-18 19:57:59 |
合計ジャッジ時間 | 8,360 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 185 ms
128,844 KB |
testcase_01 | AC | 228 ms
124,472 KB |
testcase_02 | AC | 268 ms
128,444 KB |
testcase_03 | AC | 220 ms
131,056 KB |
testcase_04 | AC | 331 ms
130,928 KB |
testcase_05 | AC | 55 ms
53,444 KB |
testcase_06 | AC | 104 ms
76,748 KB |
testcase_07 | AC | 148 ms
110,688 KB |
testcase_08 | AC | 114 ms
84,472 KB |
testcase_09 | AC | 133 ms
78,784 KB |
testcase_10 | AC | 137 ms
113,044 KB |
testcase_11 | AC | 244 ms
130,928 KB |
testcase_12 | AC | 54 ms
53,444 KB |
testcase_13 | AC | 115 ms
67,128 KB |
testcase_14 | AC | 135 ms
91,220 KB |
testcase_15 | AC | 125 ms
78,164 KB |
testcase_16 | AC | 64 ms
57,876 KB |
testcase_17 | AC | 101 ms
66,332 KB |
testcase_18 | AC | 187 ms
116,492 KB |
testcase_19 | AC | 123 ms
85,828 KB |
testcase_20 | AC | 100 ms
66,248 KB |
testcase_21 | AC | 64 ms
57,544 KB |
testcase_22 | AC | 121 ms
77,548 KB |
testcase_23 | AC | 53 ms
53,432 KB |
testcase_24 | AC | 53 ms
53,444 KB |
testcase_25 | AC | 54 ms
53,448 KB |
testcase_26 | AC | 88 ms
67,760 KB |
testcase_27 | AC | 62 ms
55,500 KB |
testcase_28 | AC | 96 ms
63,768 KB |
testcase_29 | AC | 101 ms
63,780 KB |
testcase_30 | AC | 149 ms
116,048 KB |
testcase_31 | AC | 258 ms
130,532 KB |
ソースコード
import java.io.*; import java.util.*; import java.util.stream.*; public class Main { static int[] values; static long[] counts; static ArrayList<HashMap<Integer, Integer>> graph = new ArrayList<>(); static long[][] dp; public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); int k = sc.nextInt(); for (int i = 0; i < n; i++) { graph.add(new HashMap<>()); } values = new int[n - 1]; for (int i = 0; i < n - 1; i ++) { int a = sc.nextInt() - 1; int b = sc.nextInt() - 1; values[i] = sc.nextInt(); graph.get(a).put(b, i); graph.get(b).put(a, i); } counts = new long[n - 1]; getCount(0, 0); dp = new long[n - 1][k + 1]; for (long[] arr : dp) { Arrays.fill(arr, -1); } System.out.println(dfw(n - 2, k)); } static long getCount(int idx, int p) { long count = 0; for (int x : graph.get(idx).keySet()) { if (x == p) { continue; } long tmp = getCount(x, idx); counts[graph.get(idx).get(x)] = tmp; count += tmp; } if (count == 0) { count++; } return count; } static long dfw(int idx, int v) { if (v < 0) { return Long.MIN_VALUE; } if (idx < 0) { return 0; } if (dp[idx][v] < 0) { dp[idx][v] = Math.max(dfw(idx - 1, v) + values[idx] * counts[idx], dfw(idx - 1, v - values[idx]) + values[idx] * counts[idx] * 2); } return dp[idx][v]; } } 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(); } }