#509356 (Rust) No.1111 コード進行

• 問題: No.1111 コード進行
• ユーザー: koba-e964
• 提出日時: 2020-07-10 21:29:02
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 282 ms / 2,000 ms
• コード長: 7,024 bytes
• コンパイル時間: 16,256 ms
• コンパイル使用メモリ: 377,480 KB
• 実行使用メモリ: 217,088 KB
• 最終ジャッジ日時: 2024-10-11 07:49:07
• 合計ジャッジ時間: 18,919 ms
• ジャッジサーバーID （参考情報）: judge3 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,248 KB
testcase_02	AC	1 ms; 5,248 KB
testcase_03	AC	1 ms; 5,248 KB
testcase_04	AC	1 ms; 5,248 KB
testcase_05	AC	5 ms; 5,248 KB
testcase_06	AC	8 ms; 6,912 KB
testcase_07	AC	7 ms; 6,272 KB
testcase_08	AC	3 ms; 5,248 KB
testcase_09	AC	5 ms; 5,248 KB
testcase_10	AC	10 ms; 8,704 KB
testcase_11	AC	4 ms; 5,248 KB
testcase_12	AC	8 ms; 6,656 KB
testcase_13	AC	6 ms; 5,504 KB
testcase_14	AC	12 ms; 9,088 KB
testcase_15	AC	3 ms; 5,248 KB
testcase_16	AC	8 ms; 7,552 KB
testcase_17	AC	10 ms; 9,088 KB
testcase_18	AC	3 ms; 5,248 KB
testcase_19	AC	3 ms; 5,248 KB
testcase_20	AC	4 ms; 5,248 KB
testcase_21	AC	2 ms; 5,248 KB
testcase_22	AC	15 ms; 11,136 KB
testcase_23	AC	6 ms; 5,248 KB
testcase_24	AC	7 ms; 5,888 KB
testcase_25	AC	14 ms; 10,496 KB
testcase_26	AC	8 ms; 6,656 KB
testcase_27	AC	3 ms; 5,248 KB
testcase_28	AC	144 ms; 109,440 KB
testcase_29	AC	64 ms; 46,848 KB
testcase_30	AC	102 ms; 73,216 KB
testcase_31	AC	17 ms; 14,080 KB
testcase_32	AC	98 ms; 66,304 KB
testcase_33	AC	68 ms; 43,392 KB
testcase_34	AC	109 ms; 79,360 KB
testcase_35	AC	141 ms; 102,144 KB
testcase_36	AC	144 ms; 108,416 KB
testcase_37	AC	40 ms; 28,416 KB
testcase_38	AC	35 ms; 21,376 KB
testcase_39	AC	112 ms; 72,192 KB
testcase_40	AC	149 ms; 99,840 KB
testcase_41	AC	156 ms; 121,856 KB
testcase_42	AC	70 ms; 50,560 KB
testcase_43	AC	72 ms; 44,416 KB
testcase_44	AC	32 ms; 25,088 KB
testcase_45	AC	100 ms; 74,752 KB
testcase_46	AC	13 ms; 7,168 KB
testcase_47	AC	282 ms; 217,088 KB
testcase_48	AC	12 ms; 7,168 KB
testcase_49	AC	12 ms; 7,168 KB

ソースコード

#[allow(unused_imports)]
use std::cmp::*;
#[allow(unused_imports)]
use std::collections::*;
use std::io::{Write, BufWriter};
// https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes
                .by_ref()
                .map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};
    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

macro_rules! read_value {
    ($next:expr, [graph1; $len:expr]) => {{
        let mut g = vec![vec![]; $len];
        let ab = read_value!($next, [(usize1, usize1)]);
        for (a, b) in ab {
            g[a].push(b);
            g[b].push(a);
        }
        g
    }};
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };
    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };
    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };
    ($next:expr, usize1) => (read_value!($next, usize) - 1);
    ($next:expr, [ $t:tt ]) => {{
        let len = read_value!($next, usize);
        read_value!($next, [$t; len])
    }};
    ($next:expr, $t:ty) => ($next().parse::<$t>().expect("Parse error"));
}

#[allow(unused)]
macro_rules! debug {
    ($($format:tt)*) => (write!(std::io::stderr(), $($format)*).unwrap());
}
#[allow(unused)]
macro_rules! debugln {
    ($($format:tt)*) => (writeln!(std::io::stderr(), $($format)*).unwrap());
}

/// Verified by https://atcoder.jp/contests/arc093/submissions/3968098
mod mod_int {
    use std::ops::*;
    pub trait Mod: Copy { fn m() -> i64; }
    #[derive(Copy, Clone, Hash, PartialEq, Eq, PartialOrd, Ord)]
    pub struct ModInt<M> { pub x: i64, phantom: ::std::marker::PhantomData<M> }
    impl<M: Mod> ModInt<M> {
        // x >= 0
        pub fn new(x: i64) -> Self { ModInt::new_internal(x % M::m()) }
        fn new_internal(x: i64) -> Self {
            ModInt { x: x, phantom: ::std::marker::PhantomData }
        }
        pub fn pow(self, mut e: i64) -> Self {
            debug_assert!(e >= 0);
            let mut sum = ModInt::new_internal(1);
            let mut cur = self;
            while e > 0 {
                if e % 2 != 0 { sum *= cur; }
                cur *= cur;
                e /= 2;
            }
            sum
        }
        #[allow(dead_code)]
        pub fn inv(self) -> Self { self.pow(M::m() - 2) }
    }
    impl<M: Mod, T: Into<ModInt<M>>> Add<T> for ModInt<M> {
        type Output = Self;
        fn add(self, other: T) -> Self {
            let other = other.into();
            let mut sum = self.x + other.x;
            if sum >= M::m() { sum -= M::m(); }
            ModInt::new_internal(sum)
        }
    }
    impl<M: Mod, T: Into<ModInt<M>>> Sub<T> for ModInt<M> {
        type Output = Self;
        fn sub(self, other: T) -> Self {
            let other = other.into();
            let mut sum = self.x - other.x;
            if sum < 0 { sum += M::m(); }
            ModInt::new_internal(sum)
        }
    }
    impl<M: Mod, T: Into<ModInt<M>>> Mul<T> for ModInt<M> {
        type Output = Self;
        fn mul(self, other: T) -> Self { ModInt::new(self.x * other.into().x % M::m()) }
    }
    impl<M: Mod, T: Into<ModInt<M>>> AddAssign<T> for ModInt<M> {
        fn add_assign(&mut self, other: T) { *self = *self + other; }
    }
    impl<M: Mod, T: Into<ModInt<M>>> SubAssign<T> for ModInt<M> {
        fn sub_assign(&mut self, other: T) { *self = *self - other; }
    }
    impl<M: Mod, T: Into<ModInt<M>>> MulAssign<T> for ModInt<M> {
        fn mul_assign(&mut self, other: T) { *self = *self * other; }
    }
    impl<M: Mod> Neg for ModInt<M> {
        type Output = Self;
        fn neg(self) -> Self { ModInt::new(0) - self }
    }
    impl<M> ::std::fmt::Display for ModInt<M> {
        fn fmt(&self, f: &mut ::std::fmt::Formatter) -> ::std::fmt::Result {
            self.x.fmt(f)
        }
    }
    impl<M: Mod> ::std::fmt::Debug for ModInt<M> {
        fn fmt(&self, f: &mut ::std::fmt::Formatter) -> ::std::fmt::Result {
            let (mut a, mut b, _) = red(self.x, M::m());
            if b < 0 {
                a = -a;
                b = -b;
            }
            write!(f, "{}/{}", a, b)
        }
    }
    impl<M: Mod> From<i64> for ModInt<M> {
        fn from(x: i64) -> Self { Self::new(x) }
    }
    // Finds the simplest fraction x/y congruent to r mod p.
    // The return value (x, y, z) satisfies x = y * r + z * p.
    fn red(r: i64, p: i64) -> (i64, i64, i64) {
        if r.abs() <= 10000 {
            return (r, 1, 0);
        }
        let mut nxt_r = p % r;
        let mut q = p / r;
        if 2 * nxt_r >= r {
            nxt_r -= r;
            q += 1;
        }
        if 2 * nxt_r <= -r {
            nxt_r += r;
            q -= 1;
        }
        let (x, z, y) = red(nxt_r, r);
        (x, y - q * z, z)
    }
} // mod mod_int

macro_rules! define_mod {
    ($struct_name: ident, $modulo: expr) => {
        #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash)]
        struct $struct_name {}
        impl mod_int::Mod for $struct_name { fn m() -> i64 { $modulo } }
    }
}
const MOD: i64 = 1_000_000_007;
define_mod!(P, MOD);
type ModInt = mod_int::ModInt<P>;

fn solve() {
    let out = std::io::stdout();
    let mut out = BufWriter::new(out.lock());
    macro_rules! puts {
        ($($format:tt)*) => (let _ = write!(out,$($format)*););
    }
    input! {
        n: usize, m: usize, k: usize,
        pqc: [(usize1, usize1, usize); m],
    }
    let mut dp = vec![vec![vec![ModInt::new(0); k + 1]; 300]; n + 1];
    for i in 0..300 {
        dp[0][i][0] += 1;
    }
    let mut g = vec![vec![]; 300];
    for &(p, q, c) in &pqc {
        g[p].push((q, c));
    }
    for i in 0..n {
        for j in 0..300 {
            for l in 0..k + 1 {
                let val = dp[i][j][l];
                if val == ModInt::new(0) {
                    continue;
                }
                for &(w, c) in &g[j] {
                    if l + c <= k {
                        dp[i + 1][w][l + c] += val;
                    }
                }
            }
        }
    }
    let mut sum = ModInt::new(0);
    for i in 0..300 {
        sum += dp[n-1][i][k];
    }
    puts!("{}\n", sum);
}

fn main() {
    // In order to avoid potential stack overflow, spawn a new thread.
    let stack_size = 104_857_600; // 100 MB
    let thd = std::thread::Builder::new().stack_size(stack_size);
    thd.spawn(|| solve()).unwrap().join().unwrap();
}