結果

問題 No.1221 木 *= 3
ユーザー tenten
提出日時 2023-04-11 15:48:35
言語 Java
(openjdk 23)
結果
AC  
実行時間 817 ms / 2,000 ms
コード長 2,551 bytes
コンパイル時間 3,781 ms
コンパイル使用メモリ 97,124 KB
実行使用メモリ 83,368 KB
最終ジャッジ日時 2024-10-07 08:56:30
合計ジャッジ時間 15,722 ms
ジャッジサーバーID
(参考情報)
judge2 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 4
other AC * 18
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import java.io.*;
import java.util.*;
import java.util.stream.*;
public class Main {
static long[] losts;
static long[] exists;
static long[] dp1;
static long[] dp2;
static ArrayList<ArrayList<Integer>> graph = new ArrayList<>();
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner();
int n = sc.nextInt();
losts = new long[n];
for (int i = 0; i < n; i++) {
losts[i] = sc.nextInt();
graph.add(new ArrayList<>());
}
exists = new long[n];
for (int i = 0; i < n; i++) {
exists[i] = sc.nextInt();
}
for (int i = 0; i < n - 1; i++) {
int a = sc.nextInt() - 1;
int b = sc.nextInt() - 1;
graph.get(a).add(b);
graph.get(b).add(a);
}
dp1 = new long[n];
dp2 = new long[n];
calc(0, 0);
System.out.println(Math.max(dp1[0], dp2[0]));
}
static void calc(int idx, int p) {
dp1[idx] = losts[idx];
for (int x : graph.get(idx)) {
if (x == p) {
continue;
}
calc(x, idx);
dp1[idx] += Math.max(dp1[x], dp2[x]);
dp2[idx] += Math.max(dp1[x], dp2[x] + exists[idx] + exists[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();
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0