#420765 (Rust) No.801 エレベーター

• 問題: No.801 エレベーター
• ユーザー: koba-e964
• 提出日時: 2020-01-23 11:51:01
• 言語: Rust (1.77.0)
• 結果: AC
• 実行時間: 147 ms / 2,000 ms
• コード長: 5,744 bytes
• コンパイル時間: 4,091 ms
• コンパイル使用メモリ: 162,680 KB
• 実行使用メモリ: 71,564 KB
• 最終ジャッジ日時: 2023-09-26 02:23:19
• 合計ジャッジ時間: 9,179 ms
• ジャッジサーバーID （参考情報）: judge14 / judge11

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 4,380 KB
testcase_01	AC	1 ms; 4,376 KB
testcase_02	AC	1 ms; 4,380 KB
testcase_03	AC	3 ms; 4,380 KB
testcase_04	AC	3 ms; 4,380 KB
testcase_05	AC	3 ms; 4,380 KB
testcase_06	AC	3 ms; 4,380 KB
testcase_07	AC	2 ms; 4,376 KB
testcase_08	AC	3 ms; 4,380 KB
testcase_09	AC	2 ms; 4,380 KB
testcase_10	AC	3 ms; 4,380 KB
testcase_11	AC	3 ms; 4,380 KB
testcase_12	AC	3 ms; 4,376 KB
testcase_13	AC	146 ms; 71,304 KB
testcase_14	AC	146 ms; 71,508 KB
testcase_15	AC	145 ms; 71,284 KB
testcase_16	AC	145 ms; 71,268 KB
testcase_17	AC	144 ms; 71,276 KB
testcase_18	AC	145 ms; 71,012 KB
testcase_19	AC	144 ms; 71,348 KB
testcase_20	AC	145 ms; 71,236 KB
testcase_21	AC	147 ms; 71,276 KB
testcase_22	AC	145 ms; 71,292 KB
testcase_23	AC	139 ms; 71,288 KB
testcase_24	AC	139 ms; 71,044 KB
testcase_25	AC	138 ms; 71,240 KB
testcase_26	AC	139 ms; 71,312 KB
testcase_27	AC	141 ms; 71,312 KB
testcase_28	AC	140 ms; 71,564 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, ( $($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);
        (0..len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    }};

    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}

/// 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> ::std::fmt::Debug for ModInt<M> {
        fn fmt(&self, f: &mut ::std::fmt::Formatter) -> ::std::fmt::Result {
            self.x.fmt(f)
        }
    }
    impl<M: Mod> From<i64> for ModInt<M> {
        fn from(x: i64) -> Self { Self::new(x) }
    }
} // 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)*) => (write!(out,$($format)*).unwrap());
    }
    input! {
        n: usize,
        m: usize,
        k: usize,
        lr: [(usize1, usize); m],
    }
    let mut dp = vec![vec![ModInt::new(0); n + 1]; k + 1];
    for i in 1..n + 1 {
        dp[0][i] = ModInt::new(1);
    }
    for i in 0..k {
        let mut tmp = vec![ModInt::new(0); n + 1];
        for &(l, r) in &lr {
            let bulk = dp[i][r] - dp[i][l];
            tmp[r] -= bulk;
            tmp[l] += bulk;
        }
        for j in 0..n {
            let val = tmp[j];
            tmp[j + 1] += val;
        }
        for j in 0..n {
            dp[i + 1][j + 1] = dp[i + 1][j] + tmp[j];
        }
    }
    puts!("{}\n", dp[k][n] - dp[k][n - 1]);
}

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();
}