結果
問題 | No.872 All Tree Path |
ユーザー | ikd |
提出日時 | 2021-01-09 11:16:56 |
言語 | Rust (1.77.0 + proconio) |
結果 |
AC
|
実行時間 | 204 ms / 3,000 ms |
コード長 | 3,148 bytes |
コンパイル時間 | 19,548 ms |
コンパイル使用メモリ | 381,824 KB |
実行使用メモリ | 48,680 KB |
最終ジャッジ日時 | 2024-11-17 13:27:52 |
合計ジャッジ時間 | 15,209 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 192 ms
27,268 KB |
testcase_01 | AC | 198 ms
27,204 KB |
testcase_02 | AC | 189 ms
27,280 KB |
testcase_03 | AC | 89 ms
48,680 KB |
testcase_04 | AC | 1 ms
6,820 KB |
testcase_05 | AC | 204 ms
27,360 KB |
testcase_06 | AC | 191 ms
27,332 KB |
testcase_07 | AC | 195 ms
27,360 KB |
testcase_08 | AC | 11 ms
6,820 KB |
testcase_09 | AC | 11 ms
6,820 KB |
testcase_10 | AC | 11 ms
6,816 KB |
testcase_11 | AC | 11 ms
6,820 KB |
testcase_12 | AC | 11 ms
6,816 KB |
testcase_13 | AC | 1 ms
6,820 KB |
testcase_14 | AC | 1 ms
6,816 KB |
testcase_15 | AC | 1 ms
6,820 KB |
testcase_16 | AC | 1 ms
6,816 KB |
testcase_17 | AC | 1 ms
6,816 KB |
testcase_18 | AC | 1 ms
6,820 KB |
testcase_19 | AC | 1 ms
6,820 KB |
ソースコード
type E = (usize, u64); fn dfs(i: usize, p: usize, g: &Vec<Vec<E>>, size: &mut Vec<usize>, dp: &mut Vec<u64>) { size[i] = 1; for &(j, w) in &g[i] { if j == p { continue; } dfs(j, i, g, size, dp); size[i] += size[j]; dp[i] += dp[j] + w * size[j] as u64; } } fn main() { let stdin = std::io::stdin(); let mut rd = ProconReader::new(stdin.lock()); let n: usize = rd.get(); let mut g = vec![vec![]; n]; for _ in 0..(n - 1) { let u: usize = rd.get(); let v: usize = rd.get(); let w: u64 = rd.get(); g[u - 1].push((v - 1, w)); g[v - 1].push((u - 1, w)); } let mut size = vec![0; n]; let mut dp = vec![0; n]; dfs(0, !0, &g, &mut size, &mut dp); let mut ans = vec![0; n]; use std::collections::VecDeque; let mut q = VecDeque::new(); q.push_back((0, !0, 0)); while let Some((i, p, s)) = q.pop_front() { let mut a = 0; for &(j, w) in &g[i] { if j == p { a += s; } else { a += dp[j] + size[j] as u64 * w; } } ans[i] = a; for &(j, w) in &g[i] { if j == p { continue; } let nxt_s = a - dp[j] - size[j] as u64 * w + (n - size[j]) as u64 * w; q.push_back((j, i, nxt_s)); } } // println!("{:?}", size); // println!("{:?}", dp); // println!("{:?}", ans); println!("{}", ans.iter().sum::<u64>()); } pub struct ProconReader<R> { r: R, line: String, i: usize, } impl<R: std::io::BufRead> ProconReader<R> { pub fn new(reader: R) -> Self { Self { r: reader, line: String::new(), i: 0, } } pub fn get<T>(&mut self) -> T where T: std::str::FromStr, <T as std::str::FromStr>::Err: std::fmt::Debug, { self.skip_blanks(); assert!(self.i < self.line.len()); assert_ne!(&self.line[self.i..=self.i], " "); let line = &self.line[self.i..]; let end = line.find(' ').unwrap_or_else(|| line.len()); let s = &line[..end]; self.i += end; s.parse() .unwrap_or_else(|_| panic!("parse error `{}`", self.line)) } fn skip_blanks(&mut self) { loop { let start = self.line[self.i..].find(|ch| ch != ' '); match start { Some(j) => { self.i += j; break; } None => { self.line.clear(); self.i = 0; let num_bytes = self.r.read_line(&mut self.line).unwrap(); assert!(num_bytes > 0, "reached EOF :("); self.line = self.line.trim_end_matches(&['\r', '\n'][..]).to_string(); } } } } pub fn get_vec<T>(&mut self, n: usize) -> Vec<T> where T: std::str::FromStr, <T as std::str::FromStr>::Err: std::fmt::Debug, { (0..n).map(|_| self.get()).collect() } }