結果
問題 | No.2427 Tree Distance Two |
ユーザー | haihamabossu |
提出日時 | 2023-08-18 21:53:39 |
言語 | Rust (1.77.0) |
結果 |
AC
|
実行時間 | 362 ms / 2,000 ms |
コード長 | 5,251 bytes |
コンパイル時間 | 11,952 ms |
コンパイル使用メモリ | 375,180 KB |
実行使用メモリ | 93,056 KB |
最終ジャッジ日時 | 2024-05-06 03:53:05 |
合計ジャッジ時間 | 19,523 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 0 ms
5,248 KB |
testcase_02 | AC | 1 ms
5,376 KB |
testcase_03 | AC | 362 ms
82,560 KB |
testcase_04 | AC | 1 ms
5,376 KB |
testcase_05 | AC | 362 ms
82,560 KB |
testcase_06 | AC | 1 ms
5,376 KB |
testcase_07 | AC | 304 ms
89,216 KB |
testcase_08 | AC | 336 ms
93,056 KB |
testcase_09 | AC | 316 ms
89,216 KB |
testcase_10 | AC | 327 ms
90,368 KB |
testcase_11 | AC | 322 ms
88,192 KB |
testcase_12 | AC | 341 ms
86,656 KB |
testcase_13 | AC | 348 ms
84,992 KB |
testcase_14 | AC | 157 ms
83,072 KB |
testcase_15 | AC | 1 ms
5,376 KB |
testcase_16 | AC | 1 ms
5,376 KB |
testcase_17 | AC | 1 ms
5,376 KB |
testcase_18 | AC | 1 ms
5,376 KB |
testcase_19 | AC | 0 ms
5,376 KB |
testcase_20 | AC | 5 ms
5,376 KB |
testcase_21 | AC | 6 ms
5,376 KB |
testcase_22 | AC | 2 ms
5,376 KB |
testcase_23 | AC | 2 ms
5,376 KB |
testcase_24 | AC | 5 ms
5,376 KB |
testcase_25 | AC | 67 ms
22,912 KB |
testcase_26 | AC | 200 ms
50,432 KB |
testcase_27 | AC | 136 ms
38,528 KB |
testcase_28 | AC | 329 ms
77,568 KB |
testcase_29 | AC | 276 ms
63,616 KB |
testcase_30 | AC | 187 ms
49,024 KB |
testcase_31 | AC | 107 ms
31,744 KB |
testcase_32 | AC | 187 ms
48,640 KB |
testcase_33 | AC | 159 ms
44,160 KB |
testcase_34 | AC | 35 ms
14,848 KB |
ソースコード
pub mod scanner { pub struct Scanner { buf: Vec<String>, } impl Scanner { pub fn new() -> Self { Self { buf: vec![] } } pub fn new_from(source: &str) -> Self { let source = String::from(source); let buf = Self::split(source); Self { buf } } pub fn next<T: std::str::FromStr>(&mut self) -> T { loop { if let Some(x) = self.buf.pop() { return x.parse().ok().expect(""); } let mut source = String::new(); std::io::stdin().read_line(&mut source).expect(""); self.buf = Self::split(source); } } fn split(source: String) -> Vec<String> { source .split_whitespace() .rev() .map(String::from) .collect::<Vec<_>>() } } } pub mod tree { #[derive(Clone)] pub struct Edge { pub to: usize, pub id: usize, pub rev: usize, pub cost: isize, } pub struct Tree { pub n: usize, root: usize, pub edges: Vec<Vec<Edge>>, pub parent: Vec<Option<usize>>, pub depth: Vec<usize>, pub subtree_size: Vec<usize>, pub pre_order: Vec<usize>, pub post_order: Vec<usize>, pub euler_tour: Vec<usize>, } impl Tree { pub fn new(n: usize) -> Tree { Tree { n, root: 0, edges: vec![vec![]; n], parent: vec![None; n], depth: vec![0; n], subtree_size: vec![0; n], pre_order: vec![], post_order: vec![], euler_tour: vec![], } } pub fn init(scanner: &mut crate::scanner::Scanner, indexed: usize, weighted: bool) -> Tree { let n: usize = scanner.next(); let mut tree = Tree::new(n); for id in 0..n - 1 { let u: usize = scanner.next::<usize>() - indexed; let v: usize = scanner.next::<usize>() - indexed; let cost: isize; if weighted { cost = scanner.next(); } else { cost = 1; } tree.add_edge(u, v, id, cost); } tree.set_root(0); tree } pub fn add_edge(&mut self, u: usize, v: usize, id: usize, cost: isize) { { let to = v; let rev = self.edges[v].len(); self.edges[u].push(Edge { to, id, rev, cost }); } { let to = u; let rev = self.edges[u].len() - 1; self.edges[v].push(Edge { to, id, rev, cost }); } } pub fn degree(&self, u: usize) -> usize { self.edges[u].len() } pub fn set_root(&mut self, root: usize) { let n = self.n; self.root = root; self.parent = vec![None; n]; self.depth = vec![0; n]; self.subtree_size = vec![0; n]; self.pre_order = vec![]; self.post_order = vec![]; self.euler_tour = vec![]; let mut stack: Vec<(usize, usize, usize)> = vec![]; stack.push((root, 0, 0)); while let Some((u, i, d)) = stack.pop() { if i == 0 { self.subtree_size[u] += 1; self.pre_order.push(u); } if i == self.degree(u) { if let Some(p) = self.parent[u] { self.subtree_size[p] += self.subtree_size[u]; } self.post_order.push(u); self.euler_tour.push(u); continue; } stack.push((u, i + 1, d)); let edge = &self.edges[u][i]; if Some(edge.to) == self.parent[u] { continue; } self.parent[edge.to] = Some(u); self.depth[edge.to] = d + 1; self.euler_tour.push(u); stack.push((edge.to, 0, d + 1)); } } } } use crate::{scanner::Scanner, tree::Tree}; use std::io::Write; fn main() { let mut scanner = Scanner::new(); let out = std::io::stdout(); let mut out = std::io::BufWriter::new(out.lock()); let t: usize = 1; for _ in 0..t { solve(&mut scanner, &mut out); } } fn solve(scanner: &mut Scanner, out: &mut std::io::BufWriter<std::io::StdoutLock>) { let n: usize = scanner.next(); let mut tree = Tree::new(n); for id in 0..n - 1 { let u: usize = scanner.next::<usize>() - 1; let v: usize = scanner.next::<usize>() - 1; tree.add_edge(u, v, id, 1); } tree.set_root(0); for u in 0..n { let mut ans = 0; for edge in tree.edges[u].iter() { let v = edge.to; ans += tree.edges[v].len() - 1; } writeln!(out, "{}", ans).unwrap(); } }