#553276 (Rust) No.1227 I hate ThREE

提出ソース

結果

問題	No.1227 I hate ThREE
ユーザー	o2c
提出日時	2020-09-15 10:17:56
言語	Rust (1.77.0 + proconio)
結果	AC
実行時間	111 ms / 2,000 ms
コード長	6,095 bytes
コンパイル時間	14,095 ms
コンパイル使用メモリ	402,112 KB
実行使用メモリ	28,544 KB
最終ジャッジ日時	2024-06-22 01:36:00
合計ジャッジ時間	13,448 ms
ジャッジサーバーID （参考情報）	judge2 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 6,812 KB
testcase_01	AC	1 ms 6,944 KB
testcase_02	AC	1 ms 6,944 KB
testcase_03	AC	4 ms 6,944 KB
testcase_04	AC	4 ms 6,944 KB
testcase_05	AC	2 ms 6,944 KB
testcase_06	AC	1 ms 6,944 KB
testcase_07	AC	1 ms 6,940 KB
testcase_08	AC	1 ms 6,944 KB
testcase_09	AC	0 ms 6,940 KB
testcase_10	AC	1 ms 6,944 KB
testcase_11	AC	1 ms 6,940 KB
testcase_12	AC	1 ms 6,944 KB
testcase_13	AC	2 ms 6,944 KB
testcase_14	AC	7 ms 6,940 KB
testcase_15	AC	10 ms 6,940 KB
testcase_16	AC	29 ms 9,472 KB
testcase_17	AC	17 ms 6,940 KB
testcase_18	AC	43 ms 12,928 KB
testcase_19	AC	30 ms 9,984 KB
testcase_20	AC	59 ms 16,256 KB
testcase_21	AC	1 ms 6,944 KB
testcase_22	AC	44 ms 13,056 KB
testcase_23	AC	97 ms 27,520 KB
testcase_24	AC	106 ms 28,544 KB
testcase_25	AC	100 ms 28,544 KB
testcase_26	AC	87 ms 21,376 KB
testcase_27	AC	98 ms 23,040 KB
testcase_28	AC	100 ms 23,808 KB
testcase_29	AC	71 ms 18,176 KB
testcase_30	AC	76 ms 19,328 KB
testcase_31	AC	78 ms 19,840 KB
testcase_32	AC	88 ms 20,864 KB
testcase_33	AC	111 ms 25,344 KB
testcase_34	AC	84 ms 20,352 KB
testcase_35	AC	105 ms 24,192 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

pub fn readln() -> String {
    let mut line = String::new();
    ::std::io::stdin()
        .read_line(&mut line)
        .unwrap_or_else(|e| panic!("{}", e));
    line
}
macro_rules !read {($($t :tt ) ,*;$n :expr ) =>{{let stdin =::std ::io ::stdin () ;let ret =::std ::io ::BufRead ::lines (stdin .lock () ) .take ($n ) .map (|line |{let line =line .unwrap () ;let mut it =line .split_whitespace () ;_read !(it ;$($t ) ,*) } ) .collect ::<Vec <_ >>() ;ret } } ;($($t :tt ) ,*) =>{{let line =readln () ;let mut it =line .split_whitespace () ;_read !(it ;$($t ) ,*) } } ;}
macro_rules !_read {($it :ident ;[char ] ) =>{_read !($it ;String ) .chars () .collect ::<Vec <_ >>() } ;($it :ident ;[u8 ] ) =>{Vec ::from (_read !($it ;String ) .into_bytes () ) } ;($it :ident ;usize1 ) =>{$it .next () .unwrap_or_else (||panic !("input mismatch" ) ) .parse ::<usize >() .unwrap_or_else (|e |panic !("{}" ,e ) ) -1 } ;($it :ident ;[usize1 ] ) =>{$it .map (|s |s .parse ::<usize >() .unwrap_or_else (|e |panic !("{}" ,e ) ) -1 ) .collect ::<Vec <_ >>() } ;($it :ident ;[$t :ty ] ) =>{$it .map (|s |s .parse ::<$t >() .unwrap_or_else (|e |panic !("{}" ,e ) ) ) .collect ::<Vec <_ >>() } ;($it :ident ;$t :ty ) =>{$it .next () .unwrap_or_else (||panic !("input mismatch" ) ) .parse ::<$t >() .unwrap_or_else (|e |panic !("{}" ,e ) ) } ;($it :ident ;$($t :tt ) ,+) =>{($(_read !($it ;$t ) ) ,*) } ;}

fn main() {
    let (n, c) = read!(usize, usize);
    let mut to = vec![vec![]; n];
    for _ in 0..n - 1 {
        let (u, v) = read!(usize1, usize1);
        to[u].push(v);
        to[v].push(u);
    }

    let (s, d) = {
        let mut d = vec![0; n];
        dfs_g(0, 0, &to, n, &mut d);
        let mut s = 0;
        let mut dn = n;
        for i in 0..n {
            if d[i] < dn {
                dn = d[i];
                s = i;
            }
        }
        (s, dn)
    };

    let cm = std::cmp::min(c, 6 * d + 1);
    let mut dp = vec![vec![Mint(1); cm + 1]; n];
    let mut visit = vec![vec![false; cm + 1]; n];
    let mut ans = Mint(0);
    for i in 1..=cm {
        ans += dfs(s, s, &to, i as i64, cm, &mut dp, &mut visit);
    }

    if cm != c {
        ans += dp[s][3 * d + 1] * (c - (6 * d + 1)) as i64;
    }
    println!("{}", ans);
}

fn dfs_g(u: usize, p: usize, to: &Vec<Vec<usize>>, n: usize, d: &mut Vec<usize>) -> usize {
    let mut x = 0;
    for &v in to[u].iter() {
        if v == p {
            continue;
        }
        let c = dfs_g(v, u, to, n, d);
        d[u] = std::cmp::max(d[u], c);
        x += c;
    }
    d[u] = std::cmp::max(d[u], n - x);
    x + 1
}

fn dfs(
    u: usize,
    p: usize,
    to: &Vec<Vec<usize>>,
    s: i64,
    c: usize,
    dp: &mut Vec<Vec<Mint>>,
    visit: &mut Vec<Vec<bool>>,
) -> Mint {
    if s <= 0 || s > c as i64 {
        return Mint(0);
    }
    let s = s as usize;
    if visit[u][s] {
        return dp[u][s];
    }
    visit[u][s] = true;
    let mut x = Mint(1);
    for &v in to[u].iter() {
        if v == p {
            continue;
        }
        x *= dfs(v, u, to, s as i64 - 3, c, dp, visit) + dfs(v, u, to, s as i64 + 3, c, dp, visit);
    }
    dp[u][s] = x;
    x
}

const MOD: i64 = 1000000007;
#[derive(Copy, Clone, Debug)]
pub struct Mint(i64);
impl Mint {
    fn new(x: i64) -> Self {
        Mint(x.rem_euclid(MOD))
    }
    fn pow(self, n: usize) -> Self {
        match n {
            0 => Mint::new(1),
            _ => {
                let mut a = self.pow(n >> 1);
                a *= a;
                if n & 1 == 1 {
                    a *= self;
                }
                a
            }
        }
    }
    fn inv(self) -> Self {
        self.pow((MOD - 2) as usize)
    }
}
impl std::ops::Neg for Mint {
    type Output = Mint;
    fn neg(self) -> Self::Output {
        Self::new(-self.0)
    }
}
impl std::ops::AddAssign<Mint> for Mint {
    fn add_assign(&mut self, rhs: Self) {
        self.0 += rhs.0;
        self.0 %= MOD;
    }
}
impl std::ops::AddAssign<i64> for Mint {
    fn add_assign(&mut self, rhs: i64) {
        *self += Mint::new(rhs);
    }
}
impl<T> std::ops::Add<T> for Mint
where
    Mint: std::ops::AddAssign<T>,
{
    type Output = Self;
    fn add(self, other: T) -> Self {
        let mut res = self;
        res += other;
        res
    }
}
impl std::ops::SubAssign<Mint> for Mint {
    fn sub_assign(&mut self, rhs: Self) {
        self.0 -= rhs.0;
        if self.0 < 0 {
            self.0 += MOD;
        }
    }
}
impl std::ops::SubAssign<i64> for Mint {
    fn sub_assign(&mut self, rhs: i64) {
        *self -= Mint::new(rhs);
    }
}
impl<T> std::ops::Sub<T> for Mint
where
    Mint: std::ops::SubAssign<T>,
{
    type Output = Self;
    fn sub(self, other: T) -> Self {
        let mut res = self;
        res -= other;
        res
    }
}
impl std::ops::MulAssign<Mint> for Mint {
    fn mul_assign(&mut self, rhs: Self) {
        self.0 *= rhs.0;
        self.0 %= MOD;
    }
}
impl std::ops::MulAssign<i64> for Mint {
    fn mul_assign(&mut self, rhs: i64) {
        *self *= Mint::new(rhs);
    }
}
impl<T> std::ops::Mul<T> for Mint
where
    Mint: std::ops::MulAssign<T>,
{
    type Output = Self;
    fn mul(self, other: T) -> Self {
        let mut res = self;
        res *= other;
        res
    }
}
impl std::ops::DivAssign<Mint> for Mint {
    fn div_assign(&mut self, rhs: Self) {
        *self *= rhs.inv();
    }
}
impl std::ops::DivAssign<i64> for Mint {
    fn div_assign(&mut self, rhs: i64) {
        *self /= Mint::new(rhs);
    }
}
impl<T> std::ops::Div<T> for Mint
where
    Mint: std::ops::DivAssign<T>,
{
    type Output = Self;
    fn div(self, other: T) -> Self {
        let mut res = self;
        res /= other;
        res
    }
}
impl std::fmt::Display for Mint {
    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        write!(f, "{}", self.0)
    }
}
impl std::ops::Deref for Mint {
    type Target = i64;
    fn deref(&self) -> &Self::Target {
        &self.0
    }
}
impl std::ops::DerefMut for Mint {
    fn deref_mut(&mut self) -> &mut Self::Target {
        &mut self.0
    }
}

yukicoder

結果

テストケース

ソースコード