結果

問題 No.1353 Limited Sequence
ユーザー koba-e964koba-e964
提出日時 2023-08-10 14:08:22
言語 Rust
(1.77.0)
結果
AC  
実行時間 236 ms / 2,000 ms
コード長 4,693 bytes
コンパイル時間 903 ms
コンパイル使用メモリ 154,060 KB
実行使用メモリ 33,428 KB
最終ジャッジ日時 2023-08-10 14:08:29
合計ジャッジ時間 5,983 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
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 0 ms
4,376 KB
testcase_04 AC 1 ms
4,376 KB
testcase_05 AC 1 ms
4,376 KB
testcase_06 AC 1 ms
4,380 KB
testcase_07 AC 1 ms
4,376 KB
testcase_08 AC 1 ms
4,376 KB
testcase_09 AC 1 ms
4,380 KB
testcase_10 AC 1 ms
4,376 KB
testcase_11 AC 1 ms
4,376 KB
testcase_12 AC 129 ms
14,896 KB
testcase_13 AC 156 ms
10,920 KB
testcase_14 AC 24 ms
10,124 KB
testcase_15 AC 55 ms
18,860 KB
testcase_16 AC 8 ms
4,376 KB
testcase_17 AC 11 ms
7,224 KB
testcase_18 AC 82 ms
15,148 KB
testcase_19 AC 236 ms
25,668 KB
testcase_20 AC 42 ms
9,360 KB
testcase_21 AC 8 ms
4,376 KB
testcase_22 AC 11 ms
5,912 KB
testcase_23 AC 134 ms
13,316 KB
testcase_24 AC 51 ms
9,356 KB
testcase_25 AC 182 ms
21,180 KB
testcase_26 AC 64 ms
10,668 KB
testcase_27 AC 27 ms
5,344 KB
testcase_28 AC 29 ms
11,728 KB
testcase_29 AC 19 ms
4,380 KB
testcase_30 AC 64 ms
8,388 KB
testcase_31 AC 38 ms
7,972 KB
testcase_32 AC 30 ms
13,836 KB
testcase_33 AC 14 ms
6,656 KB
testcase_34 AC 54 ms
19,904 KB
testcase_35 AC 15 ms
7,760 KB
testcase_36 AC 24 ms
8,548 KB
testcase_37 AC 192 ms
33,408 KB
testcase_38 AC 186 ms
33,428 KB
testcase_39 AC 187 ms
33,380 KB
testcase_40 AC 195 ms
33,416 KB
testcase_41 AC 191 ms
33,424 KB
testcase_42 AC 191 ms
33,368 KB
testcase_43 AC 204 ms
33,424 KB
testcase_44 AC 190 ms
33,424 KB
testcase_45 AC 187 ms
33,360 KB
testcase_46 AC 208 ms
33,416 KB
testcase_47 AC 76 ms
33,416 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

use std::cmp::*;
// 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 ; $len:expr ]) => {
        (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/abc198/submissions/21774342
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> Default for ModInt<M> {
        fn default() -> Self { Self::new_internal(0) }
    }
    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> 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)]
        pub struct $struct_name {}
        impl mod_int::Mod for $struct_name { fn m() -> i64 { $modulo } }
    }
}
const MOD: i64 = 998_244_353;
define_mod!(P, MOD);
type MInt = mod_int::ModInt<P>;

fn calc(n: usize, r: usize, a: &[usize]) -> MInt {
    let mut dp = vec![vec![MInt::new(0); n]; r + 1];
    let mut sum = vec![MInt::new(0); r + 1];
    sum[0] += 1;
    for i in 1..r + 1 {
        for j in 0..n {
            let mut me = MInt::new(0);
            for k in 1..=min(a[j], i / (j + 1)) {
                me += sum[i - (j + 1) * k] - dp[i - (j + 1) * k][j];
            }
            dp[i][j] = me;
            sum[i] += me;
        }
    }
    let mut ans = MInt::new(0);
    for i in 0..r + 1 {
        ans += sum[i];
    }
    ans
}

fn main() {
    input! {
        n: usize, l: usize, r: usize,
        a: [usize; n],
    }
    println!("{}", calc(n, r, &a) - calc(n, l - 1, &a));
}
0