結果

問題 No.1696 Nonnil
ユーザー akakimidoriakakimidori
提出日時 2021-11-16 09:50:29
言語 Rust
(1.77.0 + proconio)
結果
AC  
実行時間 81 ms / 3,500 ms
コード長 6,364 bytes
コンパイル時間 13,448 ms
コンパイル使用メモリ 379,840 KB
実行使用メモリ 15,608 KB
最終ジャッジ日時 2024-12-16 03:18:53
合計ジャッジ時間 17,182 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 1 ms
5,248 KB
testcase_02 AC 1 ms
5,248 KB
testcase_03 AC 37 ms
10,752 KB
testcase_04 AC 1 ms
5,248 KB
testcase_05 AC 1 ms
5,248 KB
testcase_06 AC 1 ms
5,248 KB
testcase_07 AC 1 ms
5,248 KB
testcase_08 AC 28 ms
10,752 KB
testcase_09 AC 9 ms
5,248 KB
testcase_10 AC 13 ms
5,248 KB
testcase_11 AC 11 ms
5,248 KB
testcase_12 AC 12 ms
5,248 KB
testcase_13 AC 10 ms
5,248 KB
testcase_14 AC 61 ms
13,496 KB
testcase_15 AC 27 ms
5,448 KB
testcase_16 AC 76 ms
15,352 KB
testcase_17 AC 43 ms
11,244 KB
testcase_18 AC 38 ms
8,628 KB
testcase_19 AC 1 ms
5,248 KB
testcase_20 AC 1 ms
5,248 KB
testcase_21 AC 31 ms
8,944 KB
testcase_22 AC 42 ms
10,024 KB
testcase_23 AC 42 ms
9,632 KB
testcase_24 AC 40 ms
9,164 KB
testcase_25 AC 61 ms
12,920 KB
testcase_26 AC 46 ms
11,644 KB
testcase_27 AC 64 ms
13,816 KB
testcase_28 AC 60 ms
11,256 KB
testcase_29 AC 39 ms
10,212 KB
testcase_30 AC 31 ms
8,048 KB
testcase_31 AC 45 ms
11,364 KB
testcase_32 AC 52 ms
12,528 KB
testcase_33 AC 58 ms
11,936 KB
testcase_34 AC 32 ms
9,624 KB
testcase_35 AC 43 ms
10,980 KB
testcase_36 AC 73 ms
15,480 KB
testcase_37 AC 75 ms
15,608 KB
testcase_38 AC 74 ms
15,476 KB
testcase_39 AC 80 ms
15,500 KB
testcase_40 AC 81 ms
15,480 KB
testcase_41 AC 47 ms
7,992 KB
testcase_42 AC 30 ms
9,600 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

use std::marker::*;
use std::ops::*;

pub trait Modulo {
    fn modulo() -> u32;
}

pub struct ConstantModulo<const M: u32>;

impl<const M: u32> Modulo for ConstantModulo<{ M }> {
    fn modulo() -> u32 {
        M
    }
}

pub struct ModInt<T>(u32, PhantomData<T>);

impl<T> Clone for ModInt<T> {
    fn clone(&self) -> Self {
        Self::new_unchecked(self.0)
    }
}

impl<T> Copy for ModInt<T> {}

impl<T: Modulo> Add for ModInt<T> {
    type Output = ModInt<T>;
    fn add(self, rhs: Self) -> Self::Output {
        let mut v = self.0 + rhs.0;
        if v >= T::modulo() {
            v -= T::modulo();
        }
        Self::new_unchecked(v)
    }
}

impl<T: Modulo> AddAssign for ModInt<T> {
    fn add_assign(&mut self, rhs: Self) {
        *self = *self + rhs;
    }
}

impl<T: Modulo> Sub for ModInt<T> {
    type Output = ModInt<T>;
    fn sub(self, rhs: Self) -> Self::Output {
        let mut v = self.0 - rhs.0;
        if self.0 < rhs.0 {
            v += T::modulo();
        }
        Self::new_unchecked(v)
    }
}

impl<T: Modulo> SubAssign for ModInt<T> {
    fn sub_assign(&mut self, rhs: Self) {
        *self = *self - rhs;
    }
}

impl<T: Modulo> Mul for ModInt<T> {
    type Output = ModInt<T>;
    fn mul(self, rhs: Self) -> Self::Output {
        let v = self.0 as u64 * rhs.0 as u64 % T::modulo() as u64;
        Self::new_unchecked(v as u32)
    }
}

impl<T: Modulo> MulAssign for ModInt<T> {
    fn mul_assign(&mut self, rhs: Self) {
        *self = *self * rhs;
    }
}

impl<T: Modulo> Neg for ModInt<T> {
    type Output = ModInt<T>;
    fn neg(self) -> Self::Output {
        if self.is_zero() {
            Self::zero()
        } else {
            Self::new_unchecked(T::modulo() - self.0)
        }
    }
}

impl<T> std::fmt::Display for ModInt<T> {
    fn fmt<'a>(&self, f: &mut std::fmt::Formatter<'a>) -> std::fmt::Result {
        write!(f, "{}", self.0)
    }
}

impl<T> std::fmt::Debug for ModInt<T> {
    fn fmt<'a>(&self, f: &mut std::fmt::Formatter<'a>) -> std::fmt::Result {
        write!(f, "{}", self.0)
    }
}

impl<T: Modulo> std::str::FromStr for ModInt<T> {
    type Err = std::num::ParseIntError;
    fn from_str(s: &str) -> Result<Self, Self::Err> {
        let val = s.parse::<u32>()?;
        Ok(ModInt::new(val))
    }
}

impl<T: Modulo> From<usize> for ModInt<T> {
    fn from(val: usize) -> ModInt<T> {
        ModInt::new_unchecked((val % T::modulo() as usize) as u32)
    }
}

impl<T: Modulo> From<u64> for ModInt<T> {
    fn from(val: u64) -> ModInt<T> {
        ModInt::new_unchecked((val % T::modulo() as u64) as u32)
    }
}

impl<T> ModInt<T> {
    pub fn new_unchecked(n: u32) -> Self {
        ModInt(n, PhantomData)
    }
    pub fn zero() -> Self {
        ModInt::new_unchecked(0)
    }
    pub fn one() -> Self {
        ModInt::new_unchecked(1)
    }
    pub fn is_zero(&self) -> bool {
        self.0 == 0
    }
}

impl<T: Modulo> ModInt<T> {
    pub fn new(d: u32) -> Self {
        ModInt::new_unchecked(d % T::modulo())
    }
    pub fn pow(&self, mut n: u64) -> Self {
        let mut t = Self::one();
        let mut s = *self;
        while n > 0 {
            if n & 1 == 1 {
                t *= s;
            }
            s *= s;
            n >>= 1;
        }
        t
    }
    pub fn inv(&self) -> Self {
        assert!(!self.is_zero());
        self.pow(T::modulo() as u64 - 2)
    }
}

// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};
    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------

type M = ModInt<ConstantModulo<998_244_353>>;

fn run() {
    input! {
        n: usize,
        k: usize,
        m: usize,
        p: [(usize1, usize); m],
    }
    let mut p = p;
    p.sort_by_key(|p| (p.1, !p.0));
    p.dedup_by(|a, b| a.0 <= b.0);
    // dp[x][y]: x個使った、最後に使ったのがy な方法の数
    let mut dp = vec![vec![M::zero(); k + 1]; k + 1];
    let mut sum = vec![M::zero(); k + 1];
    dp[0][k] = M::one();
    sum[0] = M::one();
    let mut last = k + 1;
    let mut x = p.len();
    for i in (0..k).rev() {
        for j in (1..=k).rev() {
            dp[j][i] = sum[j - 1];
            sum[j] = sum[j] + sum[j - 1];
        }
        if x > 0 && p[x - 1].0 == i {
            let r = p[x - 1].1;
            for p in r..last {
                for j in 0..=k {
                    sum[j] -= dp[j][p];
                }
            }
            last = r;
            x -= 1;
        }
    }
    let mut pow = vec![M::zero(); k + 1];
    for i in 0..=k {
        pow[i] = M::new(i as u32).pow(n as u64);
    }
    let mut binom = vec![M::zero(); k + 1];
    binom[0] = M::one();
    let mut ans = M::zero();
    for (len, way) in sum.iter().enumerate().skip(1) {
        for i in (1..=len).rev() {
            binom[i] = binom[i] + binom[i - 1];
        }
        let mut v = M::zero();
        let mut sign = M::one();
        for j in (1..=len).rev() {
            v += sign * binom[j] * pow[j];
            sign = -sign;
        }
        ans += v * *way;
    }
    println!("{}", ans);
}

fn main() {
    run();
}
0