結果

問題 No.1331 Moving Penguin
ユーザー koba-e964koba-e964
提出日時 2021-01-10 22:49:36
言語 Rust
(1.77.0 + proconio)
結果
AC  
実行時間 471 ms / 1,500 ms
コード長 7,510 bytes
コンパイル時間 17,546 ms
コンパイル使用メモリ 378,776 KB
実行使用メモリ 254,464 KB
最終ジャッジ日時 2024-11-07 15:11:14
合計ジャッジ時間 33,847 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 32 ms
20,096 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 451 ms
254,336 KB
testcase_05 AC 445 ms
254,464 KB
testcase_06 AC 433 ms
254,336 KB
testcase_07 AC 433 ms
254,336 KB
testcase_08 AC 438 ms
254,336 KB
testcase_09 AC 441 ms
254,336 KB
testcase_10 AC 440 ms
254,336 KB
testcase_11 AC 453 ms
254,336 KB
testcase_12 AC 443 ms
254,464 KB
testcase_13 AC 437 ms
254,464 KB
testcase_14 AC 439 ms
254,336 KB
testcase_15 AC 432 ms
254,464 KB
testcase_16 AC 432 ms
254,208 KB
testcase_17 AC 439 ms
254,464 KB
testcase_18 AC 440 ms
254,336 KB
testcase_19 AC 438 ms
254,336 KB
testcase_20 AC 437 ms
254,208 KB
testcase_21 AC 444 ms
254,336 KB
testcase_22 AC 438 ms
254,464 KB
testcase_23 AC 441 ms
254,336 KB
testcase_24 AC 435 ms
254,464 KB
testcase_25 AC 434 ms
254,336 KB
testcase_26 AC 447 ms
254,336 KB
testcase_27 AC 443 ms
254,336 KB
testcase_28 AC 450 ms
254,336 KB
testcase_29 AC 438 ms
254,336 KB
testcase_30 AC 149 ms
85,632 KB
testcase_31 AC 256 ms
144,896 KB
testcase_32 AC 132 ms
76,544 KB
testcase_33 AC 199 ms
114,048 KB
testcase_34 AC 299 ms
170,624 KB
testcase_35 AC 464 ms
254,336 KB
testcase_36 AC 471 ms
254,336 KB
testcase_37 AC 462 ms
254,464 KB
testcase_38 AC 158 ms
90,752 KB
testcase_39 AC 427 ms
245,504 KB
testcase_40 AC 222 ms
128,128 KB
testcase_41 AC 439 ms
254,336 KB
testcase_42 AC 457 ms
254,336 KB
testcase_43 AC 455 ms
254,336 KB
testcase_44 AC 460 ms
254,336 KB
testcase_45 AC 460 ms
254,336 KB
testcase_46 AC 461 ms
254,336 KB
testcase_47 AC 460 ms
254,464 KB
testcase_48 AC 443 ms
254,464 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#[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"));
}

trait Change {
    fn chmax(&mut self, x: Self);
    fn chmin(&mut self, x: Self);
}
impl<T: PartialOrd> Change for T {
    fn chmax(&mut self, x: T) {
        if *self < x { *self = x; }
    }
    fn chmin(&mut self, x: T) {
        if *self > x { *self = x; }
    }
}

#[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 MInt = 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)*););
    }
    #[allow(unused)]
    macro_rules! putvec {
        ($v:expr) => {
            for i in 0..$v.len() {
                puts!("{}{}", $v[i], if i + 1 == $v.len() {"\n"} else {" "});
            }
        }
    }
    input! {
        n: usize,
        a: [usize; n],
    }
    let mut dp = vec![MInt::new(0); n];
    const B: usize = 320;
    let mut acc = vec![vec![MInt::new(0); n]; B];
    dp[n - 1] += 1;
    for i in 1..B {
        acc[i][n - 1] += 1;
    }
    for i in (0..n - 1).rev() {
        let mut val = dp[i + 1];
        if a[i] >= B {
            let mut j = i + a[i];
            while j < n {
                val += dp[j];
                j += a[i];
            }
        } else {
            if a[i] == 1 {
                val = acc[1][i + 1];
            } else {
                if i + a[i] < n {
                    val += acc[a[i]][i + a[i]];
                }
            }
        }
        dp[i] = val;
        for j in 1..B {
            acc[j][i] = if i + j < n { acc[j][i + j] } else { MInt::new(0) }
            + dp[i];
        }
    }
    puts!("{}\n", dp[0]);
}

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