#851904 (Rust) No.2144 MM

• 問題: No.2144 MM
• ユーザー: koba-e964
• 提出日時: 2023-03-23 22:43:02
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 19 ms / 2,000 ms
• コード長: 5,215 bytes
• コンパイル時間: 11,112 ms
• コンパイル使用メモリ: 394,088 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-09-18 15:41:40
• 合計ジャッジ時間: 12,712 ms
• ジャッジサーバーID （参考情報）: judge3 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	0 ms; 5,248 KB
testcase_01	AC	0 ms; 5,376 KB
testcase_02	AC	0 ms; 5,376 KB
testcase_03	AC	1 ms; 5,376 KB
testcase_04	AC	1 ms; 5,376 KB
testcase_05	AC	1 ms; 5,376 KB
testcase_06	AC	1 ms; 5,376 KB
testcase_07	AC	14 ms; 5,376 KB
testcase_08	AC	19 ms; 5,376 KB
testcase_09	AC	14 ms; 5,376 KB
testcase_10	AC	19 ms; 5,376 KB
testcase_11	AC	18 ms; 5,376 KB
testcase_12	AC	19 ms; 5,376 KB
testcase_13	AC	19 ms; 5,376 KB
testcase_14	AC	19 ms; 5,376 KB
testcase_15	AC	16 ms; 5,376 KB
testcase_16	AC	5 ms; 5,376 KB
testcase_17	AC	15 ms; 5,376 KB
testcase_18	AC	5 ms; 5,376 KB
testcase_19	AC	15 ms; 5,376 KB
testcase_20	AC	14 ms; 5,376 KB
testcase_21	AC	10 ms; 5,376 KB
testcase_22	AC	3 ms; 5,376 KB
testcase_23	AC	14 ms; 5,376 KB
testcase_24	AC	5 ms; 5,376 KB
testcase_25	AC	1 ms; 5,376 KB
testcase_26	AC	1 ms; 5,376 KB
testcase_27	AC	1 ms; 5,376 KB
testcase_28	AC	1 ms; 5,376 KB
testcase_29	AC	1 ms; 5,376 KB
testcase_30	AC	1 ms; 5,376 KB
testcase_31	AC	1 ms; 5,376 KB
testcase_32	AC	1 ms; 5,376 KB
testcase_33	AC	1 ms; 5,376 KB
testcase_34	AC	1 ms; 5,376 KB
testcase_35	AC	1 ms; 5,376 KB
testcase_36	AC	1 ms; 5,376 KB
testcase_37	AC	1 ms; 5,376 KB

ソースコード

#[allow(unused_imports)]
use std::cmp::*;
#[allow(unused_imports)]
use std::collections::*;
// 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>;

fn main() {
    input! {
        n: usize, m: i64,
        a: [i64; n],
    }
    let mut s = 0;
    for i in 0..n {
        if i % 2 == 0 {
            s += a[i];
        } else {
            s += m - a[i];
        }
    }
    if s % m != 0 {
        println!("-1");
        return;
    }
    s = 0;
    let mut ans = MInt::new(0);
    let mut cur = MInt::new(1);
    let minv = MInt::new(m).inv();
    for i in (0..n).rev() {
        let olds = s;
        let (lo, hi) = if (i + n) % 2 == 0 {
            s = (s + a[i]) % m;
            ((olds + 1) % m, (s + 1) % m)
        } else {
            s = (s + m - a[i]) % m;
            (s, olds)
        };
        let bias = (n - i + 1) as i64 % 2;
        let mut tmp = cur;
        if (i + n) % 2 == 0 {
            tmp += 1;
        } else {
            tmp -= 1;
        }
        tmp *= minv;
        tmp *= a[i];
        if a[i] > 0 && (lo + m - bias - 1) % m > (hi + m - bias - 1) % m {
            if (i + n) % 2 == 0 {
                tmp -= 1;
            } else {
                tmp += 1;
            }
        }
        ans += tmp;
        cur *= m - 1;
    }
    println!("{}", ans + 1);
}