結果
問題 | No.277 根掘り葉掘り |
ユーザー |
|
提出日時 | 2021-02-26 19:56:14 |
言語 | Rust (1.83.0 + proconio) |
結果 |
AC
|
実行時間 | 55 ms / 3,000 ms |
コード長 | 11,693 bytes |
コンパイル時間 | 12,347 ms |
コンパイル使用メモリ | 396,584 KB |
実行使用メモリ | 21,504 KB |
最終ジャッジ日時 | 2024-10-02 12:19:18 |
合計ジャッジ時間 | 15,126 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 18 |
ソースコード
fn main() {let mut io = IO::new();input!{ from io,n: usize,ed: [(Usize1, Usize1); n-1]}let mut g = UndirectedGraph::new(n);for &(u, v) in &ed {g.add_edge(u, v, 1i64);}let mut que = std::collections::VecDeque::new();let mut dist = vec![std::i64::MAX; n];que.push_back(0);dist[0] = 0;for i in 1..n {if g.edges_from(i).count() == 1 {que.push_back(i);dist[i] = 0;}}while let Some(u) = que.pop_front() {for e in g.edges_from(u) {let v = e.to;if dist[v] > dist[u] + e.cost {dist[v] = dist[u] + e.cost;que.push_back(v);}}}io.iterln(dist.into_iter(), "\n");}pub fn tree_dfs<C: Cost, G: Graph<C>>(g: &G, root: usize)-> (Vec<C>, Vec<Option<usize>>, Vec<usize>, Vec<usize>){let n = g.size();let mut euler = Vec::with_capacity(n);let mut dist = vec![C::MAX; n];dist[root] = C::zero();let mut par = vec![None; n];let mut size = vec![1; n];let mut q = vec![root];while let Some(v) = q.pop() {euler.push(v);for e in g.edges_from(v) {if par[v] == Some(e.to) { continue; }par[e.to] = Some(v);dist[e.to] = dist[v] + e.cost;q.push(e.to);}}for &v in euler.iter().skip(1).rev() {size[par[v].unwrap()] += size[v];}(dist, par, size, euler)}// ------------ Graph impl start ------------pub trait Cost:Element+ Clone + Copy + std::fmt::Display+ Eq + Ord+ Zero + One+ Add<Output = Self> + AddAssign+ Sub<Output = Self>+ Neg<Output = Self>{const MAX: Self;}#[derive(Copy, Clone)]pub struct Edge<C = Void> {// pub from: usize,pub to: usize,pub cost: C,pub id: usize}pub struct UndirectedGraph<C>(pub Vec<Vec<Edge<C>>>, pub usize);pub struct DirectedGraph<C>{pub forward: Vec<Vec<Edge<C>>>,pub backward: Vec<Vec<Edge<C>>>,pub count: usize,}pub trait Graph<C: Element> {fn new(size: usize) -> Self;fn size(&self) -> usize;fn add_edge(&mut self, u: usize, v: usize, cost: C);fn edges_from(&self, v: usize) -> std::slice::Iter<Edge<C>>;}impl<C: Element> Graph<C> for UndirectedGraph<C> {fn new(size: usize) -> Self {Self(vec![Vec::<Edge<C>>::new(); size], 0)}fn size(&self) -> usize {self.0.len()}fn add_edge(&mut self, u: usize, v: usize, cost: C) {self.0[u].push(Edge{ to: v, cost: cost.clone(), id: self.1 });self.0[v].push(Edge{ to: u, cost: cost.clone(), id: self.1 });self.1 += 1;}fn edges_from(&self, v: usize) -> std::slice::Iter<Edge<C>> {self.0[v].iter()}}impl<C: Element> Graph<C> for DirectedGraph<C> {fn new(size: usize) -> Self {Self {forward: vec![Vec::<Edge<C>>::new(); size],backward: vec![Vec::<Edge<C>>::new(); size],count: 0}}fn size(&self) -> usize {self.forward.len()}fn add_edge(&mut self, u: usize, v: usize, cost: C) {self.forward[u].push(Edge{ to: v, cost: cost.clone(), id: self.count });self.backward[v].push(Edge{ to: u, cost: cost.clone(), id: self.count });self.count += 1;}fn edges_from(&self, v: usize) -> std::slice::Iter<Edge<C>> {self.forward[v].iter()}}impl<C: Element> DirectedGraph<C> {pub fn edges_to(&self, u: usize) -> std::slice::Iter<Edge<C>> {self.backward[u].iter()}pub fn reverse(&self) -> Self {Self {forward: self.backward.clone(),backward: self.forward.clone(),count: self.count,}}}macro_rules! impl_cost {($($T:ident,)*) => {$(impl Cost for $T { const MAX: Self = std::$T::MAX; })*};}impl_cost! {i8, i16, i32, i64, i128, isize,}#[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord)]pub struct Void();impl std::fmt::Display for Void {fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result {write!(f, "")}}impl Zero for Void {fn zero() -> Self { Void() }fn is_zero(&self) -> bool { true }}impl One for Void {fn one() -> Self { Void() }fn is_one(&self) -> bool { true }}impl Add for Void {type Output = Self;fn add(self, _: Self) -> Self { Void() }}impl AddAssign for Void {fn add_assign(&mut self, _: Self) {}}impl Sub for Void {type Output = Self;fn sub(self, _: Self) -> Self { Void() }}impl Neg for Void {type Output = Self;fn neg(self) -> Self { Void() }}impl Cost for Void { const MAX: Self = Void(); }// ------------ Graph impl end ------------// ------------ algebraic traits start ------------use std::marker::Sized;use std::ops::*;/// 元pub trait Element: Sized + Clone + PartialEq {}impl<T: Sized + Clone + PartialEq> Element for T {}/// 結合性pub trait Associative: Magma {}/// マグマpub trait Magma: Element + Add<Output=Self> {}impl<T: Element + Add<Output=Self>> Magma for T {}/// 半群pub trait SemiGroup: Magma + Associative {}impl<T: Magma + Associative> SemiGroup for T {}/// モノイドpub trait Monoid: SemiGroup + Zero {}impl<T: SemiGroup + Zero> Monoid for T {}pub trait ComMonoid: Monoid + AddAssign {}impl<T: Monoid + AddAssign> ComMonoid for T {}/// 群pub trait Group: Monoid + Neg<Output=Self> {}impl<T: Monoid + Neg<Output=Self>> Group for T {}pub trait ComGroup: Group + ComMonoid {}impl<T: Group + ComMonoid> ComGroup for T {}/// 半環pub trait SemiRing: ComMonoid + Mul<Output=Self> + One {}impl<T: ComMonoid + Mul<Output=Self> + One> SemiRing for T {}/// 環pub trait Ring: ComGroup + SemiRing {}impl<T: ComGroup + SemiRing> Ring for T {}pub trait ComRing: Ring + MulAssign {}impl<T: Ring + MulAssign> ComRing for T {}/// 体pub trait Field: ComRing + Div<Output=Self> + DivAssign {}impl<T: ComRing + Div<Output=Self> + DivAssign> Field for T {}/// 加法単元pub trait Zero: Element {fn zero() -> Self;fn is_zero(&self) -> bool {*self == Self::zero()}}/// 乗法単元pub trait One: Element {fn one() -> Self;fn is_one(&self) -> bool {*self == Self::one()}}macro_rules! impl_integer {($($T:ty,)*) => {$(impl Associative for $T {}impl Zero for $T {fn zero() -> Self { 0 }fn is_zero(&self) -> bool { *self == 0 }}impl<'a> Zero for &'a $T {fn zero() -> Self { &0 }fn is_zero(&self) -> bool { *self == &0 }}impl One for $T {fn one() -> Self { 1 }fn is_one(&self) -> bool { *self == 1 }}impl<'a> One for &'a $T {fn one() -> Self { &1 }fn is_one(&self) -> bool { *self == &1 }})*};}impl_integer! {i8, i16, i32, i64, i128, isize,u8, u16, u32, u64, u128, usize,}// ------------ algebraic traits end ------------// ------------ io module start ------------use std::io::{stdout, BufWriter, Read, StdoutLock, Write};pub struct IO {iter: std::str::SplitAsciiWhitespace<'static>,buf: BufWriter<StdoutLock<'static>>,}impl IO {pub fn new() -> Self {let mut input = String::new();std::io::stdin().read_to_string(&mut input).unwrap();let input = Box::leak(input.into_boxed_str());let out = Box::new(stdout());IO {iter: input.split_ascii_whitespace(),buf: BufWriter::new(Box::leak(out).lock()),}}fn scan_str(&mut self) -> &'static str {self.iter.next().unwrap()}pub fn scan<T: Scan>(&mut self) -> <T as Scan>::Output {<T as Scan>::scan(self)}pub fn scan_vec<T: Scan>(&mut self, n: usize) -> Vec<<T as Scan>::Output> {(0..n).map(|_| self.scan::<T>()).collect()}pub fn print<T: Print>(&mut self, x: T) {<T as Print>::print(self, x);}pub fn println<T: Print>(&mut self, x: T) {self.print(x);self.print("\n");}pub fn iterln<T: Print, I: Iterator<Item = T>>(&mut self, mut iter: I, delim: &str) {if let Some(v) = iter.next() {self.print(v);for v in iter {self.print(delim);self.print(v);}}self.print("\n");}pub fn flush(&mut self) {self.buf.flush().unwrap();}}impl Default for IO {fn default() -> Self {Self::new()}}pub trait Scan {type Output;fn scan(io: &mut IO) -> Self::Output;}macro_rules! impl_scan {($($t:tt),*) => {$(impl Scan for $t {type Output = Self;fn scan(s: &mut IO) -> Self::Output {s.scan_str().parse().unwrap()}})*};}impl_scan!(i16, i32, i64, isize, u16, u32, u64, usize, String);pub enum Bytes {}impl Scan for Bytes {type Output = &'static [u8];fn scan(s: &mut IO) -> Self::Output {s.scan_str().as_bytes()}}pub enum Chars {}impl Scan for Chars {type Output = Vec<char>;fn scan(s: &mut IO) -> Self::Output {s.scan_str().chars().collect()}}pub enum Usize1 {}impl Scan for Usize1 {type Output = usize;fn scan(s: &mut IO) -> Self::Output {s.scan::<usize>().wrapping_sub(1)}}impl<T: Scan, U: Scan> Scan for (T, U) {type Output = (T::Output, U::Output);fn scan(s: &mut IO) -> Self::Output {(T::scan(s), U::scan(s))}}impl<T: Scan, U: Scan, V: Scan> Scan for (T, U, V) {type Output = (T::Output, U::Output, V::Output);fn scan(s: &mut IO) -> Self::Output {(T::scan(s), U::scan(s), V::scan(s))}}impl<T: Scan, U: Scan, V: Scan, W: Scan> Scan for (T, U, V, W) {type Output = (T::Output, U::Output, V::Output, W::Output);fn scan(s: &mut IO) -> Self::Output {(T::scan(s), U::scan(s), V::scan(s), W::scan(s))}}pub trait Print {fn print(w: &mut IO, x: Self);}macro_rules! impl_print_int {($($t:ty),*) => {$(impl Print for $t {fn print(w: &mut IO, x: Self) {w.buf.write_all(x.to_string().as_bytes()).unwrap();}})*};}impl_print_int!(i16, i32, i64, isize, u16, u32, u64, usize, f32, f64);impl Print for u8 {fn print(w: &mut IO, x: Self) {w.buf.write_all(&[x]).unwrap();}}impl Print for &[u8] {fn print(w: &mut IO, x: Self) {w.buf.write_all(x).unwrap();}}impl Print for &str {fn print(w: &mut IO, x: Self) {w.print(x.as_bytes());}}impl Print for String {fn print(w: &mut IO, x: Self) {w.print(x.as_bytes());}}impl<T: Print, U: Print> Print for (T, U) {fn print(w: &mut IO, (x, y): Self) {w.print(x);w.print(" ");w.print(y);}}impl<T: Print, U: Print, V: Print> Print for (T, U, V) {fn print(w: &mut IO, (x, y, z): Self) {w.print(x);w.print(" ");w.print(y);w.print(" ");w.print(z);}}mod neboccoio_macro {#[macro_export]macro_rules! input {(@start $io:tt @read @rest) => {};(@start $io:tt @read @rest, $($rest: tt)*) => {input!(@start $io @read @rest $($rest)*)};(@start $io:tt @read @rest mut $($rest:tt)*) => {input!(@start $io @read @mut [mut] @rest $($rest)*)};(@start $io:tt @read @rest $($rest:tt)*) => {input!(@start $io @read @mut [] @rest $($rest)*)};(@start $io:tt @read @mut [$($mut:tt)?] @rest $var:tt: [$kind:tt; $len:expr] $($rest:tt)*) => {let $($mut)* $var = $io.scan_vec::<$kind>($len);input!(@start $io @read @rest $($rest)*)};(@start $io:tt @read @mut [$($mut:tt)?] @rest $var:tt: $kind:tt $($rest:tt)*) => {let $($mut)* $var = $io.scan::<$kind>();input!(@start $io @read @rest $($rest)*)};(from $io:tt $($rest:tt)*) => {input!(@start $io @read @rest $($rest)*)};}}// ------------ io module end ------------