結果
問題 | No.1221 木 *= 3 |
ユーザー |
|
提出日時 | 2020-10-05 17:16:12 |
言語 | Rust (1.83.0 + proconio) |
結果 |
AC
|
実行時間 | 76 ms / 2,000 ms |
コード長 | 3,359 bytes |
コンパイル時間 | 14,927 ms |
コンパイル使用メモリ | 388,812 KB |
実行使用メモリ | 26,752 KB |
最終ジャッジ日時 | 2024-07-19 21:37:16 |
合計ジャッジ時間 | 18,299 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 18 |
ソースコード
#[allow(unused_imports)]use std::cmp::*;#[allow(unused_imports)]use std::collections::*;use std::io::{Write, BufWriter};// https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8macro_rules! input {($($r:tt)*) => {let stdin = std::io::stdin();let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));let mut next = move || -> String{bytes.by_ref().map(|r|r.unwrap() as char).skip_while(|c|c.is_whitespace()).take_while(|c|!c.is_whitespace()).collect()};input_inner!{next, $($r)*}};}macro_rules! input_inner {($next:expr) => {};($next:expr, ) => {};($next:expr, $var:ident : $t:tt $($r:tt)*) => {let $var = read_value!($next, $t);input_inner!{$next $($r)*}};}macro_rules! read_value {($next:expr, [graph1; $len:expr]) => {{let mut g = vec![vec![]; $len];let ab = read_value!($next, [(usize1, usize1)]);for (a, b) in ab {g[a].push(b);g[b].push(a);}g}};($next:expr, ( $($t:tt),* )) => {( $(read_value!($next, $t)),* )};($next:expr, [ $t:tt ; $len:expr ]) => {(0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()};($next:expr, chars) => {read_value!($next, String).chars().collect::<Vec<char>>()};($next:expr, usize1) => (read_value!($next, usize) - 1);($next:expr, [ $t:tt ]) => {{let len = read_value!($next, usize);read_value!($next, [$t; len])}};($next:expr, $t:ty) => ($next().parse::<$t>().expect("Parse error"));}#[allow(unused)]macro_rules! debug {($($format:tt)*) => (write!(std::io::stderr(), $($format)*).unwrap());}#[allow(unused)]macro_rules! debugln {($($format:tt)*) => (writeln!(std::io::stderr(), $($format)*).unwrap());}const INF: i64 = 1 << 50;fn dfs(v: usize, par: usize, g: &[Vec<usize>],a: &[i64], b: &[i64],dp: &mut [i64], ep: &mut [i64]) {let mut d = 0;let mut e = a[v];for &w in &g[v] {if w == par {continue;}dfs(w, v, g, a, b, dp, ep);d += max(dp[w] + b[v] + b[w], ep[w]);e += max(dp[w], ep[w]);}dp[v] = d;ep[v] = e;}fn solve() {let out = std::io::stdout();let mut out = BufWriter::new(out.lock());macro_rules! puts {($($format:tt)*) => (let _ = write!(out,$($format)*););}#[allow(unused)]macro_rules! putvec {($v:expr) => {for i in 0..$v.len() {puts!("{}{}", $v[i], if i + 1 == $v.len() {"\n"} else {" "});}}}input! {n: usize,a: [i64; n],b: [i64; n],uv: [(usize1, usize1); n - 1],}let mut g = vec![vec![]; n];for &(u, v) in &uv {g[u].push(v);g[v].push(u);}let mut dp = vec![-INF; n];let mut ep = vec![-INF; n];dfs(0, n, &g, &a, &b, &mut dp, &mut ep);puts!("{}\n", max(dp[0], ep[0]));}fn main() {// In order to avoid potential stack overflow, spawn a new thread.let stack_size = 104_857_600; // 100 MBlet thd = std::thread::Builder::new().stack_size(stack_size);thd.spawn(|| solve()).unwrap().join().unwrap();}