結果

問題 No.1331 Moving Penguin
ユーザー akakimidoriakakimidori
提出日時 2021-01-08 21:47:23
言語 Rust
(1.77.0 + proconio)
結果
AC  
実行時間 155 ms / 1,500 ms
コード長 7,220 bytes
コンパイル時間 13,191 ms
コンパイル使用メモリ 378,644 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-11-07 14:37:18
合計ジャッジ時間 20,285 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 11 ms
5,248 KB
testcase_01 AC 1 ms
5,248 KB
testcase_02 AC 1 ms
5,248 KB
testcase_03 AC 1 ms
5,248 KB
testcase_04 AC 130 ms
5,248 KB
testcase_05 AC 128 ms
5,248 KB
testcase_06 AC 128 ms
5,248 KB
testcase_07 AC 129 ms
5,248 KB
testcase_08 AC 128 ms
5,248 KB
testcase_09 AC 128 ms
5,248 KB
testcase_10 AC 127 ms
5,248 KB
testcase_11 AC 128 ms
5,248 KB
testcase_12 AC 128 ms
5,248 KB
testcase_13 AC 126 ms
5,248 KB
testcase_14 AC 126 ms
5,248 KB
testcase_15 AC 127 ms
5,248 KB
testcase_16 AC 126 ms
5,248 KB
testcase_17 AC 128 ms
5,248 KB
testcase_18 AC 129 ms
5,248 KB
testcase_19 AC 130 ms
5,248 KB
testcase_20 AC 129 ms
5,248 KB
testcase_21 AC 129 ms
5,248 KB
testcase_22 AC 127 ms
5,248 KB
testcase_23 AC 129 ms
5,248 KB
testcase_24 AC 129 ms
5,248 KB
testcase_25 AC 128 ms
5,248 KB
testcase_26 AC 131 ms
5,248 KB
testcase_27 AC 130 ms
5,248 KB
testcase_28 AC 132 ms
5,248 KB
testcase_29 AC 131 ms
5,248 KB
testcase_30 AC 45 ms
5,248 KB
testcase_31 AC 75 ms
5,248 KB
testcase_32 AC 39 ms
5,248 KB
testcase_33 AC 59 ms
5,248 KB
testcase_34 AC 88 ms
5,248 KB
testcase_35 AC 141 ms
5,248 KB
testcase_36 AC 141 ms
5,248 KB
testcase_37 AC 141 ms
5,248 KB
testcase_38 AC 47 ms
5,248 KB
testcase_39 AC 127 ms
5,248 KB
testcase_40 AC 66 ms
5,248 KB
testcase_41 AC 132 ms
5,248 KB
testcase_42 AC 152 ms
5,248 KB
testcase_43 AC 152 ms
5,248 KB
testcase_44 AC 155 ms
5,248 KB
testcase_45 AC 152 ms
5,248 KB
testcase_46 AC 152 ms
5,248 KB
testcase_47 AC 153 ms
5,248 KB
testcase_48 AC 127 ms
5,248 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// ---------- begin ModInt ----------
mod modint {

    #[allow(dead_code)]
    pub struct Mod;
    impl ConstantModulo for Mod {
        const MOD: u32 = 1_000_000_007;
    }

    #[allow(dead_code)]
    pub struct StaticMod;
    static mut STATIC_MOD: u32 = 0;
    impl Modulo for StaticMod {
        fn modulo() -> u32 {
            unsafe { STATIC_MOD }
        }
    }

    #[allow(dead_code)]
    impl StaticMod {
        pub fn set_modulo(p: u32) {
            unsafe {
                STATIC_MOD = p;
            }
        }
    }

    use std::marker::*;
    use std::ops::*;

    pub trait Modulo {
        fn modulo() -> u32;
    }

    pub trait ConstantModulo {
        const MOD: u32;
    }

    impl<T> Modulo for T
    where
        T: ConstantModulo,
    {
        fn modulo() -> u32 {
            T::MOD
        }
    }

    pub struct ModInt<T>(pub u32, PhantomData<T>);

    impl<T> Clone for ModInt<T> {
        fn clone(&self) -> Self {
            ModInt::new_unchecked(self.0)
        }
    }

    impl<T> Copy for ModInt<T> {}

    impl<T: Modulo> Add for ModInt<T> {
        type Output = ModInt<T>;
        fn add(self, rhs: Self) -> Self::Output {
            let mut d = self.0 + rhs.0;
            if d >= T::modulo() {
                d -= T::modulo();
            }
            ModInt::new_unchecked(d)
        }
    }

    impl<T: Modulo> AddAssign for ModInt<T> {
        fn add_assign(&mut self, rhs: Self) {
            *self = *self + rhs;
        }
    }

    impl<T: Modulo> Sub for ModInt<T> {
        type Output = ModInt<T>;
        fn sub(self, rhs: Self) -> Self::Output {
            let mut d = T::modulo() + self.0 - rhs.0;
            if d >= T::modulo() {
                d -= T::modulo();
            }
            ModInt::new_unchecked(d)
        }
    }

    impl<T: Modulo> SubAssign for ModInt<T> {
        fn sub_assign(&mut self, rhs: Self) {
            *self = *self - rhs;
        }
    }

    impl<T: Modulo> Mul for ModInt<T> {
        type Output = ModInt<T>;
        fn mul(self, rhs: Self) -> Self::Output {
            let v = self.0 as u64 * rhs.0 as u64 % T::modulo() as u64;
            ModInt::new_unchecked(v as u32)
        }
    }

    impl<T: Modulo> MulAssign for ModInt<T> {
        fn mul_assign(&mut self, rhs: Self) {
            *self = *self * rhs;
        }
    }

    impl<T: Modulo> Neg for ModInt<T> {
        type Output = ModInt<T>;
        fn neg(self) -> Self::Output {
            if self.0 == 0 {
                Self::zero()
            } else {
                Self::new_unchecked(T::modulo() - self.0)
            }
        }
    }

    impl<T> std::fmt::Display for ModInt<T> {
        fn fmt<'a>(&self, f: &mut std::fmt::Formatter<'a>) -> std::fmt::Result {
            write!(f, "{}", self.0)
        }
    }

    impl<T> std::fmt::Debug for ModInt<T> {
        fn fmt<'a>(&self, f: &mut std::fmt::Formatter<'a>) -> std::fmt::Result {
            write!(f, "{}", self.0)
        }
    }

    impl<T: Modulo> std::str::FromStr for ModInt<T> {
        type Err = std::num::ParseIntError;
        fn from_str(s: &str) -> Result<Self, Self::Err> {
            let val = s.parse::<u32>()?;
            Ok(ModInt::new(val))
        }
    }

    impl<T: Modulo> From<usize> for ModInt<T> {
        fn from(val: usize) -> ModInt<T> {
            ModInt::new_unchecked((val % T::modulo() as usize) as u32)
        }
    }

    impl<T: Modulo> From<u64> for ModInt<T> {
        fn from(val: u64) -> ModInt<T> {
            ModInt::new_unchecked((val % T::modulo() as u64) as u32)
        }
    }

    impl<T: Modulo> From<i64> for ModInt<T> {
        fn from(val: i64) -> ModInt<T> {
            let m = T::modulo() as i64;
            ModInt::new((val % m + m) as u32)
        }
    }

    #[allow(dead_code)]
    impl<T> ModInt<T> {
        pub fn new_unchecked(d: u32) -> Self {
            ModInt(d, PhantomData)
        }
        pub fn zero() -> Self {
            ModInt::new_unchecked(0)
        }
        pub fn one() -> Self {
            ModInt::new_unchecked(1)
        }
        pub fn is_zero(&self) -> bool {
            self.0 == 0
        }
    }

    #[allow(dead_code)]
    impl<T: Modulo> ModInt<T> {
        pub fn new(d: u32) -> Self {
            ModInt::new_unchecked(d % T::modulo())
        }
        pub fn pow(&self, mut n: u64) -> Self {
            let mut t = Self::one();
            let mut s = *self;
            while n > 0 {
                if n & 1 == 1 {
                    t *= s;
                }
                s *= s;
                n >>= 1;
            }
            t
        }
        pub fn inv(&self) -> Self {
            assert!(self.0 != 0);
            self.pow(T::modulo() as u64 - 2)
        }
    }

    #[allow(dead_code)]
    pub fn mod_pow(r: u64, mut n: u64, m: u64) -> u64 {
        let mut t = 1 % m;
        let mut s = r % m;
        while n > 0 {
            if n & 1 == 1 {
                t = t * s % m;
            }
            s = s * s % m;
            n >>= 1;
        }
        t
    }
}
// ---------- end ModInt ----------
// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

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

macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------

use modint::*;
type M = ModInt<Mod>;

fn run() {
    input! {
        n: usize,
        a: [usize; n],
    }
    let mut dp = vec![M::zero(); n + 1];
    dp[0] = M::one();
    let batch = 300;
    let mut sum = vec![vec![M::zero(); batch]; batch + 1];
    for (i, &a) in a.iter().enumerate() {
        for (j, sum) in sum.iter().enumerate().skip(1) {
            dp[i] += sum[i % j];
        }
        let way = dp[i];
        if a <= batch {
            sum[a][i % a] += way;
        } else {
            for j in ((i + a)..n).step_by(a) {
                dp[j] += way;
            }
        }
        if a > 1 {
            dp[i + 1] += way;
        }
    }
    println!("{}", dp[n - 1]);
}

fn main() {
    run();
}
0