#447358 (Rust) No.1011 Infinite Stairs

• 問題: No.1011 Infinite Stairs
• ユーザー: cotton_fn_
• 提出日時: 2020-03-21 03:10:49
• 言語: Rust (1.77.0 + proconio)
• 結果: TLE
• 実行時間: -
• コード長: 5,395 bytes
• コンパイル時間: 13,490 ms
• コンパイル使用メモリ: 377,072 KB
• 実行使用メモリ: 12,072 KB
• 最終ジャッジ日時: 2024-12-16 06:41:16
• 合計ジャッジ時間: 54,551 ms
• ジャッジサーバーID （参考情報）: judge3 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 9,768 KB
testcase_01	AC	1 ms; 9,632 KB
testcase_02	AC	24 ms; 10,148 KB
testcase_03	TLE	-
testcase_04	TLE	-
testcase_05	TLE	-
testcase_06	AC	1 ms; 10,496 KB
testcase_07	AC	937 ms; 7,808 KB
testcase_08	AC	1 ms; 10,496 KB
testcase_09	AC	1 ms; 7,936 KB
testcase_10	AC	390 ms; 9,768 KB
testcase_11	TLE	-
testcase_12	AC	80 ms; 8,192 KB
testcase_13	TLE	-
testcase_14	AC	63 ms; 7,680 KB
testcase_15	AC	757 ms; 9,380 KB
testcase_16	TLE	-
testcase_17	TLE	-
testcase_18	TLE	-
testcase_19	AC	13 ms; 5,248 KB
testcase_20	AC	482 ms; 5,248 KB
testcase_21	TLE	-
testcase_22	TLE	-
testcase_23	TLE	-
testcase_24	AC	1,445 ms; 5,248 KB
testcase_25	TLE	-
testcase_26	AC	1,037 ms; 9,892 KB

ソースコード

#![allow(unused)]

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

fn main() -> io::Result<()> {
    std::thread::Builder::new()
        .stack_size(50 * 1024 * 1024)
        .spawn(solve)?
        .join()
        .unwrap();
    Ok(())
}

fn solve() {
    let stdin = io::stdin();
    let mut kin = Input::new(stdin.lock());
    let stdout = io::stdout();
    let mut out = io::BufWriter::new(stdout.lock());
    macro_rules! output {
        ($($args:expr),+) => { write!(&mut out, $($args),+) };
    }
    macro_rules! outputln {
        ($($args:expr),+) => { output!($($args),+); outputln!() };
        () => { output!("\n"); if cfg!(debug_assertions) { out.flush(); } }
    }

    const MOD: i64 = 1e9 as i64 + 7;
    let [n, d, k]: [usize; 3] = kin.input();
    let mut dp = vec![0; d * n + 1];
    dp[0] = 1;
    let mut dp_next = Vec::new();
    for _ in 0..n {
        dp_next.clear();
        dp_next.resize(dp.len(), 0);
        for i in 0..dp.len() - d {
            for j in 1..=d {
                dp_next[i + j] += dp[i];
                dp_next[i + j] %= MOD;
            }
        }
        swap(&mut dp, &mut dp_next);
    }
    outputln!("{}", dp[k]);
}

// -----------------------------------------------------------------------------
pub mod kyoproio {
    #![warn(unused)]

    pub use std::io::prelude::*;

    pub struct Input<R> {
        src: R,
        buf: String,
        pos: usize,
    }
    impl<R: BufRead> Input<R> {
        pub fn new(src: R) -> Self {
            Self {
                src,
                buf: String::with_capacity(1024),
                pos: 0,
            }
        }
        pub fn str(&mut self) -> &str {
            loop {
                if self.pos >= self.buf.len() {
                    self.buf.clear();
                    let len = self.src.read_line(&mut self.buf).expect("io error");
                    self.pos = 0;
                    if len == 0 {
                        return &self.buf;
                    }
                }
                let range = self.pos
                    ..self.buf[self.pos..]
                        .find(|c: char| c.is_ascii_whitespace())
                        .map(|i| i + self.pos)
                        .unwrap_or_else(|| self.buf.len());
                self.pos = range.end + 1;
                if range.end - range.start > 0 {
                    return &self.buf[range];
                }
            }
        }
        pub fn bytes(&mut self) -> &[u8] {
            self.str().as_ref()
        }
        pub fn input<T: InputParse>(&mut self) -> T {
            self.input_fallible().expect("input error")
        }
        pub fn input_fallible<T: InputParse>(&mut self) -> Result<T> {
            T::input(self)
        }
        pub fn iter<T: InputParse>(&mut self) -> Iter<T, R> {
            Iter {
                input: self,
                _t: std::marker::PhantomData,
            }
        }
    }
    pub struct Iter<'a, T, R> {
        input: &'a mut Input<R>,
        _t: std::marker::PhantomData<T>,
    }
    impl<'a, T: InputParse, R: BufRead> Iterator for Iter<'a, T, R> {
        type Item = T;
        fn next(&mut self) -> Option<Self::Item> {
            Some(self.input.input())
        }
    }
    type Result<T> = std::result::Result<T, Box<dyn std::error::Error + 'static>>;
    pub trait InputParse: Sized {
        fn input<R: BufRead>(input: &mut Input<R>) -> Result<Self>;
    }
    macro_rules! input_from_str_impls {
        { $($T:ty)* } => {
            $(impl InputParse for $T {
                fn input<R: BufRead>(input: &mut Input<R>) -> Result<Self> {
                    input.str().parse::<$T>().map_err(|e| e.into())
                }
            })*
        };
    }
    macro_rules! input_tuple_impls {
        { $(($($T:ident),+))* } => {
            $(impl<$($T: InputParse),+> InputParse for ($($T),+) {
                fn input<R: BufRead>(input: &mut Input<R>) -> Result<Self> {
                    Ok(($($T::input(input)?),+))
                }
            })*
        };
    }
    macro_rules! input_array_impls {
       { $($N:expr)* } => {
            $(impl<T: InputParse> InputParse for [T; $N] {
                fn input<R: BufRead>(input: &mut Input<R>) -> Result<Self> {
                    use std::{ mem::MaybeUninit, ptr };
                    let mut a = MaybeUninit::<[T; $N]>::uninit();
                    unsafe {
                        for i in 0..$N {
                            match T::input(input) {
                                Ok(v) => ptr::write(&mut (*a.as_mut_ptr())[i], v),
                                Err(e) => {
                                    ptr::drop_in_place(&mut (*a.as_mut_ptr())[..i]);
                                    return Err(e);
                                }
                            }
                        }
                        Ok(a.assume_init())
                    }
                }
            })*
        };
    }
    input_from_str_impls! {
        String char bool f32 f64
        isize i8 i16 i32 i64 i128
        usize u8 u16 u32 u64 u128
    }
    input_tuple_impls! {
        (A, B)
        (A, B, C)
        (A, B, C, D)
        (A, B, C, D, E)
        (A, B, C, D, E, F)
        (A, B, C, D, E, F, G)
    }
    input_array_impls! {
        1 2 3 4 5 6 7 8
    }
}