#853265 (Rust) No.2215 Slide Subset Sum

• 問題: No.2215 Slide Subset Sum
• ユーザー: koba-e964
• 提出日時: 2023-03-26 19:28:29
• 言語: Rust (1.77.0)
• 結果: AC
• 実行時間: 577 ms / 3,000 ms
• コード長: 5,814 bytes
• コンパイル時間: 3,392 ms
• コンパイル使用メモリ: 185,388 KB
• 実行使用メモリ: 333,024 KB
• 最終ジャッジ日時: 2023-10-19 13:49:35
• 合計ジャッジ時間: 18,548 ms
• ジャッジサーバーID （参考情報）: judge15 / judge12

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	59 ms; 4,348 KB
testcase_01	AC	339 ms; 4,348 KB
testcase_02	AC	343 ms; 4,348 KB
testcase_03	AC	345 ms; 4,348 KB
testcase_04	AC	384 ms; 9,880 KB
testcase_05	AC	1 ms; 4,348 KB
testcase_06	AC	1 ms; 4,348 KB
testcase_07	AC	1 ms; 4,348 KB
testcase_08	AC	1 ms; 4,348 KB
testcase_09	AC	1 ms; 4,348 KB
testcase_10	AC	1 ms; 4,348 KB
testcase_11	AC	1 ms; 4,348 KB
testcase_12	AC	1 ms; 4,348 KB
testcase_13	AC	1 ms; 4,348 KB
testcase_14	AC	1 ms; 4,348 KB
testcase_15	AC	1 ms; 4,348 KB
testcase_16	AC	1 ms; 4,348 KB
testcase_17	AC	431 ms; 152,056 KB
testcase_18	AC	388 ms; 130,836 KB
testcase_19	AC	367 ms; 7,756 KB
testcase_20	AC	334 ms; 168,768 KB
testcase_21	AC	381 ms; 40,384 KB
testcase_22	AC	355 ms; 181,780 KB
testcase_23	AC	577 ms; 298,412 KB
testcase_24	AC	502 ms; 300,200 KB
testcase_25	AC	464 ms; 266,512 KB
testcase_26	AC	359 ms; 182,828 KB
testcase_27	AC	13 ms; 4,348 KB
testcase_28	AC	22 ms; 12,448 KB
testcase_29	AC	28 ms; 8,568 KB
testcase_30	AC	150 ms; 4,348 KB
testcase_31	AC	182 ms; 109,520 KB
testcase_32	AC	31 ms; 6,064 KB
testcase_33	AC	236 ms; 26,248 KB
testcase_34	AC	220 ms; 76,908 KB
testcase_35	AC	26 ms; 4,348 KB
testcase_36	AC	86 ms; 49,492 KB
testcase_37	AC	539 ms; 333,024 KB
testcase_38	AC	49 ms; 26,784 KB
testcase_39	AC	340 ms; 4,348 KB
testcase_40	AC	28 ms; 4,348 KB
testcase_41	AC	2 ms; 4,348 KB
testcase_42	AC	471 ms; 168,236 KB
testcase_43	AC	397 ms; 19,960 KB
testcase_44	AC	399 ms; 19,960 KB
testcase_45	AC	438 ms; 250,664 KB
testcase_46	AC	438 ms; 250,664 KB

ソースコード

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 ; $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)]
        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>;

// https://yukicoder.me/problems/no/2215 (4)
// 1+x^a の積 mod (x^K-1) の定数項が答えだが、1+x^a と x^K-1 が互いに素とは限らないので 1+x^a で悪そうさは考えにくい。
// M 要素ごとにブロックに分け、ブロックの左と右からの累積積を覚えておくと各 i に対して O(K)-time で計算ができる。
// O(NK)-space, O(NK)-time である。
fn main() {
    let out = std::io::stdout();
    let mut out = BufWriter::new(out.lock());
    macro_rules! puts {($($format:tt)*) => (let _ = write!(out,$($format)*););}
    input! {
        n: usize, m: usize, k: usize,
        a: [usize; n],
    }
    let mut a = a;
    a.extend_from_slice(&vec![0; m]);
    let mut lft = vec![vec![MInt::new(0); k]; m + 1];
    let mut rgt = vec![vec![MInt::new(0); k]; m + 1];
    lft[0][0] += 1;
    rgt[0][0] += 1;
    for i in 0..n - m + 1 {
        if i % m == 0 {
            for j in 0..m {
                let a = a[i + m - 1 - j];
                for l in 0..k {
                    lft[j + 1][l] = lft[j][l];
                }
                for l in 0..k {
                    let tmp = lft[j][l];
                    lft[j + 1][(l + a) % k] += tmp;
                }
            }
            for j in 0..m {
                let a = a[i + m + j];
                for l in 0..k {
                    rgt[j + 1][l] = rgt[j][l];
                }
                for l in 0..k {
                    let tmp = rgt[j][l];
                    rgt[j + 1][(l + a) % k] += tmp;
                }
            }
        }
        let nxt = (i + m) / m * m;
        let l = &lft[nxt - i];
        let r = &rgt[i + m - nxt];
        let mut ans = l[0] * r[0] - 1;
        for i in 1..k {
            ans += l[i] * r[k - i];
        }
        puts!("{}\n", ans);
    }
}