結果

問題 No.2936 Sum of Square of Mex
ユーザー koba-e964koba-e964
提出日時 2024-10-22 13:37:46
言語 Rust
(1.77.0 + proconio)
結果
WA  
実行時間 -
コード長 6,116 bytes
コンパイル時間 13,266 ms
コンパイル使用メモリ 402,392 KB
実行使用メモリ 6,824 KB
最終ジャッジ日時 2024-10-22 13:38:01
合計ジャッジ時間 14,910 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,816 KB
testcase_01 AC 1 ms
6,816 KB
testcase_02 AC 5 ms
6,820 KB
testcase_03 WA -
testcase_04 AC 1 ms
6,816 KB
testcase_05 AC 2 ms
6,820 KB
testcase_06 AC 1 ms
6,820 KB
testcase_07 WA -
testcase_08 AC 24 ms
6,820 KB
testcase_09 WA -
testcase_10 AC 15 ms
6,820 KB
testcase_11 WA -
testcase_12 AC 16 ms
6,816 KB
testcase_13 WA -
testcase_14 WA -
testcase_15 AC 21 ms
6,816 KB
testcase_16 AC 29 ms
6,816 KB
testcase_17 AC 28 ms
6,816 KB
testcase_18 AC 29 ms
6,820 KB
testcase_19 AC 28 ms
6,820 KB
testcase_20 AC 29 ms
6,820 KB
testcase_21 AC 29 ms
6,816 KB
testcase_22 AC 28 ms
6,820 KB
testcase_23 AC 30 ms
6,816 KB
testcase_24 AC 7 ms
6,820 KB
testcase_25 WA -
testcase_26 AC 28 ms
6,816 KB
testcase_27 AC 29 ms
6,820 KB
testcase_28 AC 29 ms
6,820 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

use std::io::Read;

fn get_word() -> String {
    let stdin = std::io::stdin();
    let mut stdin=stdin.lock();
    let mut u8b: [u8; 1] = [0];
    loop {
        let mut buf: Vec<u8> = Vec::with_capacity(16);
        loop {
            let res = stdin.read(&mut u8b);
            if res.unwrap_or(0) == 0 || u8b[0] <= b' ' {
                break;
            } else {
                buf.push(u8b[0]);
            }
        }
        if buf.len() >= 1 {
            let ret = String::from_utf8(buf).unwrap();
            return ret;
        }
    }
}

fn get<T: std::str::FromStr>() -> T { get_word().parse().ok().unwrap() }

/// 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> ::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)]
        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>;

// Depends on MInt.rs
fn fact_init(w: usize) -> (Vec<MInt>, Vec<MInt>) {
    let mut fac = vec![MInt::new(1); w];
    let mut invfac = vec![0.into(); w];
    for i in 1..w {
        fac[i] = fac[i - 1] * i as i64;
    }
    invfac[w - 1] = fac[w - 1].inv();
    for i in (0..w - 1).rev() {
        invfac[i] = invfac[i + 1] * (i as i64 + 1);
    }
    (fac, invfac)
}

// https://yukicoder.me/problems/no/2936 (4)
// -> 0 <= x < N の場合と x = N の場合 (A が permutation) に分けたが WA。
// -> x = M + 1 の場合だけを特別扱いすべきであることに気づいた。
fn main() {
    let n: usize = get();
    let m: i64 = get();
    let (fac, invfac) = fact_init(n + 4);
    let mut tot = MInt::new(0);
    for i in 0..n + 1 {
        if i as i64 > m { continue; }
        let mut coef = fac[n + 3] * invfac[i + 3] * invfac[n - i] * (i + 1) as i64 * (i + 2) as i64;
        coef -= fac[n + 2] * invfac[i + 2] * invfac[n - i] * (i + 1) as i64 * 3;
        coef += fac[n + 1] * invfac[i + 1] * invfac[n - i];
        let mut tmp = MInt::new(m - i as i64).pow(n as i64) * coef;
        if i % 2 == 1 {
            tmp = -tmp;
        }
        tot += tmp;
    }
    if n as i64 >= m + 1 {
        // Surj(n, m + 1)
        let mm = m as usize;
        for j in 0..mm + 2 {
            let mut tmp = fac[mm + 1] * invfac[j] * invfac[mm + 1 - j]
                * MInt::new(m + 1 - j as i64).pow(n as i64);
            if j % 2 == 1 {
                tmp = -tmp;
            }
            tot += tmp * MInt::new(m as i64 + 1).pow(2);
        }
    }
    println!("{}", tot);
}
0