#650818 (Rust) No.1488 Max Score of the Tree

• 問題: No.1488 Max Score of the Tree
• ユーザー: cotton_fn_
• 提出日時: 2021-04-23 22:12:32
• 言語: Rust (1.77.0)
• 結果: AC
• 実行時間: 21 ms / 2,000 ms
• コード長: 13,353 bytes
• コンパイル時間: 3,107 ms
• コンパイル使用メモリ: 168,240 KB
• 実行使用メモリ: 4,380 KB
• 最終ジャッジ日時: 2023-09-17 12:24:38
• 合計ジャッジ時間: 4,911 ms
• ジャッジサーバーID （参考情報）: judge13 / judge15

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	17 ms; 4,380 KB
testcase_01	AC	19 ms; 4,376 KB
testcase_02	AC	20 ms; 4,380 KB
testcase_03	AC	20 ms; 4,380 KB
testcase_04	AC	21 ms; 4,376 KB
testcase_05	AC	2 ms; 4,376 KB
testcase_06	AC	7 ms; 4,376 KB
testcase_07	AC	12 ms; 4,380 KB
testcase_08	AC	9 ms; 4,380 KB
testcase_09	AC	7 ms; 4,376 KB
testcase_10	AC	11 ms; 4,380 KB
testcase_11	AC	20 ms; 4,380 KB
testcase_12	AC	1 ms; 4,376 KB
testcase_13	AC	4 ms; 4,380 KB
testcase_14	AC	11 ms; 4,380 KB
testcase_15	AC	8 ms; 4,376 KB
testcase_16	AC	3 ms; 4,376 KB
testcase_17	AC	5 ms; 4,376 KB
testcase_18	AC	13 ms; 4,380 KB
testcase_19	AC	9 ms; 4,376 KB
testcase_20	AC	4 ms; 4,380 KB
testcase_21	AC	3 ms; 4,380 KB
testcase_22	AC	6 ms; 4,380 KB
testcase_23	AC	1 ms; 4,380 KB
testcase_24	AC	1 ms; 4,376 KB
testcase_25	AC	2 ms; 4,376 KB
testcase_26	AC	6 ms; 4,376 KB
testcase_27	AC	2 ms; 4,376 KB
testcase_28	AC	3 ms; 4,380 KB
testcase_29	AC	4 ms; 4,380 KB
testcase_30	AC	15 ms; 4,376 KB
testcase_31	AC	21 ms; 4,380 KB

ソースコード

#![allow(unused_imports, unused_macros)]

use kyoproio::*;
use std::{
    collections::*,
    io::{self, prelude::*},
    iter, mem,
};

use std::time::{Instant, Duration};

fn run<I: Input, O: Write>(mut kin: I, mut out: O) {
    let (n, k): (usize, usize) = kin.parse();
    let g = AdjList::from_labeled_bi_edges(n + 1, kin.parse_iter::<(usize, usize, usize)>().take(n - 1));
    let mut wv = vec![(0, 0); n + 1];
    dfs(&g, &mut vec![0; n + 1], &mut wv, 1, 0);
    d!(wv);
    let mut dp = vec![0; k + 1];
    let mut scr = 0;
    for (w, v) in wv {
        for i in (w..=k).rev() {
            dp[i] = dp[i].max(dp[i - w] + v);
        }
        scr += v;
    }
    d!(dp);
    let ans = scr + *dp.iter().max().unwrap();
    wln!(out, "{}", ans);
}

fn dfs(g: &AdjList<usize>, c: &mut [usize], wv: &mut [(usize, usize)], u: usize, p: usize) {
    for (v, w) in g.adj(u) {
        if v == p {
            wv[u].0 = *w;
        } else {
            dfs(g, c, wv, v, u);
            c[u] += c[v];
        }
    }
    if u != 1 && g[u].len() == 1 {
        c[u] += 1;
    }
    wv[u].1 = c[u] * wv[u].0;
}

pub trait Graph<'a, T: 'a> {
    type Adj: Iterator<Item = (usize, &'a T)>;
    fn adj(&'a self, u: usize) -> Self::Adj;
    fn adj_unlabeled(&'a self, u: usize) -> AdjUnlabeled<Self::Adj> {
        AdjUnlabeled(self.adj(u))
    }
    fn len(&self) -> usize;
}
pub struct AdjUnlabeled<I>(I);
impl<T, I: Iterator<Item = (usize, T)>> Iterator for AdjUnlabeled<I> {
    type Item = usize;
    fn next(&mut self) -> Option<Self::Item> {
        self.0.next().map(|(v, _)| v)
    }
}
#[derive(Clone)]
pub struct AdjList<T> {
    heads: Vec<usize>,
    edges: Vec<(usize, T)>,
}
impl<T> AdjList<T> {
    pub fn builder(n: usize) -> AdjListBuilder<T> {
        AdjListBuilder {
            heads: vec![!0; n],
            tails: vec![],
            edges: vec![],
        }
    }
    pub fn edge_count(&self) -> usize {
        self.edges.len()
    }
    pub fn from_labeled_edges<I: IntoIterator<Item = (usize, usize, T)>>(n: usize, iter: I) -> Self {
        let mut b = Self::builder(n);
        b.extend_labeled(iter);
        b.build()
    }
    pub fn from_labeled_bi_edges<I: IntoIterator<Item = (usize, usize, T)>>(n: usize, iter: I) -> Self
    where
        T: Clone
    {
        let mut b = Self::builder(n);
        b.extend_labeled_bi_edges(iter);
        b.build()
    }
}
impl AdjList<()> {
    pub fn from_edges<I: IntoIterator<Item = (usize, usize)>>(n: usize, iter: I) -> Self {
        Self::from_labeled_edges(n, iter.into_iter().map(|(u, v)| (u, v, ())))
    }
    pub fn from_bi_edges<I: IntoIterator<Item = (usize, usize)>>(n: usize, iter: I) -> Self {
        Self::from_labeled_bi_edges(n, iter.into_iter().map(|(u, v)| (u, v, ())))
    }
}
impl<T> std::ops::Index<usize> for AdjList<T> {
    type Output = [(usize, T)];
    fn index(&self, i: usize) -> &Self::Output {
        &self.edges[self.heads[i]..self.heads[i + 1]]
    }
}
impl<T> std::ops::IndexMut<usize> for AdjList<T> {
    fn index_mut(&mut self, i: usize) -> &mut Self::Output {
        &mut self.edges[self.heads[i]..self.heads[i + 1]]
    }
}
impl<T: std::fmt::Debug> std::fmt::Debug for AdjList<T> {
    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        f.debug_map().entries((0..self.len()).map(|u| (u, &self[u]))).finish()
    }
}
impl<'a, T: 'a> Graph<'a, T> for AdjList<T> {
    type Adj = AdjIter<'a, T>;
    fn adj(&'a self, u: usize) -> Self::Adj {
        AdjIter(self[u].iter())
    }
    fn len(&self) -> usize {
        self.heads.len() - 1
    }
}
pub struct AdjIter<'a, T>(std::slice::Iter<'a, (usize, T)>);
impl<'a, T> Iterator for AdjIter<'a, T> {
    type Item = (usize, &'a T);
    fn next(&mut self) -> Option<Self::Item> {
        self.0.next().map(|(v, x)| (*v, x))
    }
}
#[derive(Clone)]
pub struct AdjListBuilder<T> {
    heads: Vec<usize>,
    tails: Vec<usize>,
    edges: Vec<(usize, T)>,
}
impl<T> AdjListBuilder<T> {
    pub fn build(mut self) -> AdjList<T> {
        let mut edges = Vec::<(usize, T)>::with_capacity(self.edges.len());
        let edges_ptr = edges.as_mut_ptr();
        let mut ofs = self.edges.len();
        unsafe {
            for head in self.heads.iter_mut().rev() {
                let mut node = *head;
                while let (Some(&t), Some(e)) = (self.tails.get(node), self.edges.get(node)) {
                    ofs -= 1;
                    edges_ptr.add(ofs).write(std::ptr::read(e));
                    node = t;
                }
                *head = ofs;
            }
            self.edges.set_len(0);
            edges.set_len(edges.capacity());
        }
        self.heads.push(edges.len());
        AdjList {
            heads: self.heads,
            edges
        }
    }
    pub fn labeled_edge(&mut self, u: usize, v: usize, x: T) {
        assert!(u < self.heads.len());
        self.edges.push((v, x));
        self.tails.push(self.heads[u]);
        self.heads[u] = self.tails.len() - 1;
    }
    pub fn labeled_bi_edge(&mut self, u: usize, v: usize, x: T)
    where
        T: Clone,
    {
        self.labeled_edge(u, v, x.clone());
        self.labeled_edge(v, u, x);
    }
    pub fn extend_labeled<I: IntoIterator<Item = (usize, usize, T)>>(&mut self, iter: I) {
        for (u, v, x) in iter {
            self.labeled_edge(u, v, x);
        }
    }
    pub fn extend_labeled_bi_edges<I: IntoIterator<Item = (usize, usize, T)>>(&mut self, iter: I)
    where
        T: Clone,
    {
        for (u, v, x) in iter {
            self.labeled_bi_edge(u, v, x);
        }
    }
}
impl AdjListBuilder<()> {
    pub fn edge(&mut self, u: usize, v: usize) {
        self.labeled_edge(u, v, ());
    }
    pub fn bi_edge(&mut self, u: usize, v: usize) {
        self.labeled_bi_edge(u, v, ());
    }
    pub fn extend_bi_edges<I: IntoIterator<Item = (usize, usize)>>(&mut self, iter: I) {
        self.extend_labeled_bi_edges(iter.into_iter().map(|(u, v)| (u, v, ())));
    }
}
impl std::iter::Extend<(usize, usize)> for AdjListBuilder<()> {
    fn extend<I: IntoIterator<Item = (usize, usize)>>(&mut self, iter: I) {
        self.extend_labeled(iter.into_iter().map(|(u, v)| (u, v, ())));
    }
}



// -----------------------------------------------------------------------------
fn main() -> io::Result<()> {
    std::thread::Builder::new()
        .stack_size(1 << 26)
        .spawn(|| {
            run(
                Scanner::new(io::stdin().lock()),
                io::BufWriter::new(io::stdout().lock()),
            )
        })?
        .join()
        .unwrap();
    Ok(())
}

#[macro_export]
macro_rules! w {
    ($($arg:tt)*) => { write!($($arg)*).unwrap(); }
}
#[macro_export]
macro_rules! wln {
    ($dst:expr $(, $($arg:tt)*)?) => {{
        writeln!($dst $(, $($arg)*)?).unwrap();
        #[cfg(debug_assertions)]
        $dst.flush().unwrap();
    }}
}
#[macro_export]
macro_rules! w_iter {
    ($dst:expr, $fmt:expr, $iter:expr, $delim:expr) => {{
        let mut first = true;
        for elem in $iter {
            if first {
                w!($dst, $fmt, elem);
                first = false;
            } else {
                w!($dst, concat!($delim, $fmt), elem);
            }
        }
    }};
    ($dst:expr, $fmt:expr, $iter:expr) => {
        w_iter!($dst, $fmt, $iter, " ")
    };
}
#[macro_export]
macro_rules! w_iter_ln {
    ($dst:expr, $($t:tt)*) => {{
        w_iter!($dst, $($t)*);
        wln!($dst);
    }}
}
#[macro_export]
macro_rules! e {
    ($($t:tt)*) => {
        #[cfg(debug_assertions)]
        eprint!($($t)*)
    }
}
#[macro_export]
macro_rules! eln {
    ($($t:tt)*) => {
        #[cfg(debug_assertions)]
        eprintln!($($t)*)
    }
}
#[macro_export]
macro_rules! __tstr {
    ($h:expr $(, $t:expr)+) => { concat!(__tstr!($($t),+), ", ", __tstr!(@)) };
    ($h:expr) => { concat!(__tstr!(), " ",  __tstr!(@)) };
    () => { "\x1B[94m[{}:{}]\x1B[0m" };
    (@) => { "\x1B[1;92m{}\x1B[0m = {:?}" }
}
#[macro_export]
macro_rules! d {
    ($($a:expr),*) => { eln!(__tstr!($($a),*), file!(), line!(), $(stringify!($a), $a),*) };
}

pub mod kyoproio {
    use std::{
        fmt::Display,
        io::{self, prelude::*},
        iter::FromIterator,
        marker::PhantomData,
        mem::{self, MaybeUninit},
        str,
    };

    pub trait Input {
        fn bytes(&mut self) -> &[u8];
        fn str(&mut self) -> &str {
            str::from_utf8(self.bytes()).unwrap()
        }
        fn parse<T: Parse>(&mut self) -> T {
            T::parse(self)
        }
        fn parse_iter<T: Parse>(&mut self) -> ParseIter<T, Self> {
            ParseIter(self, PhantomData)
        }
        fn collect<T: Parse, B: FromIterator<T>>(&mut self, n: usize) -> B {
            self.parse_iter().take(n).collect()
        }
        fn map<T: Parse, U, F: FnMut(T) -> U, B: FromIterator<U>>(&mut self, n: usize, f: F) -> B {
            self.parse_iter().take(n).map(f).collect()
        }
    }
    impl<I: Input> Input for &mut I {
        fn bytes(&mut self) -> &[u8] {
            (**self).bytes()
        }
    }
    pub struct Scanner<R> {
        src: R,
        buf: Vec<u8>,
        pos: usize,
        len: usize,
    }
    impl<R: Read> Scanner<R> {
        pub fn new(src: R) -> Self {
            Self {
                src,
                buf: vec![0; 1 << 16],
                pos: 0,
                len: 0,
            }
        }
        fn read(&mut self) -> usize {
            if self.pos > 0 {
                self.buf.copy_within(self.pos..self.len, 0);
                self.len -= self.pos;
                self.pos = 0;
            } else if self.len >= self.buf.len() {
                self.buf.resize(2 * self.buf.len(), 0);
            }
            let n = self.src.read(&mut self.buf[self.len..]).unwrap();
            self.len += n;
            assert!(self.len <= self.buf.len());
            n
        }
    }
    impl<R: Read> Input for Scanner<R> {
        fn bytes(&mut self) -> &[u8] {
            loop {
                while let Some(d) = unsafe { self.buf.get_unchecked(self.pos..self.len) }
                    .iter()
                    .position(u8::is_ascii_whitespace)
                {
                    let p = self.pos;
                    self.pos += d + 1;
                    if d > 0 {
                        return unsafe { self.buf.get_unchecked(p..p + d) };
                    }
                }
                if self.read() == 0 {
                    let p = self.pos;
                    self.pos = self.len;
                    return unsafe { self.buf.get_unchecked(p..self.len) };
                }
            }
        }
    }
    pub struct ParseIter<'a, T, I: ?Sized>(&'a mut I, PhantomData<*const T>);
    impl<'a, T: Parse, I: Input + ?Sized> Iterator for ParseIter<'a, T, I> {
        type Item = T;
        fn next(&mut self) -> Option<T> {
            Some(self.0.parse())
        }
        fn size_hint(&self) -> (usize, Option<usize>) {
            (!0, None)
        }
    }
    pub trait Parse: Sized {
        fn parse<I: Input + ?Sized>(src: &mut I) -> Self;
    }
    macro_rules! from_bytes {
        ($($T:ty)*) => {$(
            impl Parse for $T {
                fn parse<I: Input + ?Sized>(src: &mut I) -> Self {
                    src.bytes().into()
                }
            }
        )*}
    }
    from_bytes!(Vec<u8> Box<[u8]>);
    macro_rules! from_str {
        ($($T:ty)*) => {$(
            impl Parse for $T {
                fn parse<I: Input + ?Sized>(src: &mut I) -> Self {
                    src.str().parse::<$T>().unwrap()
                }
            }
        )*}
    }
    from_str!(String char bool f32 f64);
    macro_rules! int {
        ($($I:ty: $U:ty)*) => {$(
            impl Parse for $I {
                fn parse<I: Input + ?Sized>(src: &mut I) -> Self {
                    let f = |s: &[u8]| s.iter().fold(0, |x, b| 10 * x + (b & 0xf) as $I);
                    let s = src.bytes();
                    if let Some((&b'-', t)) = s.split_first() { -f(t) } else { f(s) }
                }
            }
            impl Parse for $U {
                fn parse<I: Input + ?Sized>(src: &mut I) -> Self {
                    src.bytes().iter().fold(0, |x, b| 10 * x + (b & 0xf) as $U)
                }
            }
        )*}
    }
    int!(isize:usize i8:u8 i16:u16 i32:u32 i64:u64 i128:u128);
    macro_rules! tuple {
        ($H:ident $($T:ident)*) => {
            impl<$H: Parse, $($T: Parse),*> Parse for ($H, $($T),*) {
                fn parse<I: Input + ?Sized>(src: &mut I) -> Self {
                    ($H::parse(src), $($T::parse(src)),*)
                }
            }
            tuple!($($T)*);
        };
        () => {}
    }
    tuple!(A B C D E F G);
    macro_rules! array {
        ($($N:literal)*) => {$(
            impl<T: Parse> Parse for [T; $N] {
                fn parse<I: Input + ?Sized>(src: &mut I) -> Self {
                    unsafe {
                        let mut arr: [MaybeUninit<T>; $N] = MaybeUninit::uninit().assume_init();
                        for elem in &mut arr {
                            *elem = MaybeUninit::new(src.parse());
                        }
                        mem::transmute_copy(&arr)
                    }
                }
            }
        )*}
    }
    array!(1 2 3 4 5 6 7 8);
}