結果

問題 No.1696 Nonnil
ユーザー koba-e964koba-e964
提出日時 2021-10-02 18:00:26
言語 Rust
(1.77.0 + proconio)
結果
AC  
実行時間 69 ms / 3,500 ms
コード長 6,550 bytes
コンパイル時間 12,452 ms
コンパイル使用メモリ 377,700 KB
実行使用メモリ 54,796 KB
最終ジャッジ日時 2024-07-20 12:58:40
合計ジャッジ時間 15,354 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 1 ms
5,376 KB
testcase_02 AC 1 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 1 ms
5,376 KB
testcase_08 AC 1 ms
5,376 KB
testcase_09 AC 6 ms
5,376 KB
testcase_10 AC 9 ms
5,376 KB
testcase_11 AC 7 ms
5,376 KB
testcase_12 AC 7 ms
5,376 KB
testcase_13 AC 7 ms
5,376 KB
testcase_14 AC 33 ms
19,728 KB
testcase_15 AC 16 ms
7,432 KB
testcase_16 AC 37 ms
22,544 KB
testcase_17 AC 22 ms
15,888 KB
testcase_18 AC 22 ms
12,556 KB
testcase_19 AC 1 ms
5,376 KB
testcase_20 AC 1 ms
5,376 KB
testcase_21 AC 17 ms
12,176 KB
testcase_22 AC 26 ms
15,116 KB
testcase_23 AC 25 ms
14,088 KB
testcase_24 AC 24 ms
13,960 KB
testcase_25 AC 40 ms
20,364 KB
testcase_26 AC 30 ms
16,784 KB
testcase_27 AC 35 ms
19,852 KB
testcase_28 AC 38 ms
16,520 KB
testcase_29 AC 24 ms
14,352 KB
testcase_30 AC 18 ms
11,920 KB
testcase_31 AC 22 ms
15,760 KB
testcase_32 AC 26 ms
17,044 KB
testcase_33 AC 37 ms
17,808 KB
testcase_34 AC 19 ms
12,948 KB
testcase_35 AC 25 ms
15,888 KB
testcase_36 AC 69 ms
54,796 KB
testcase_37 AC 68 ms
48,148 KB
testcase_38 AC 69 ms
47,632 KB
testcase_39 AC 49 ms
28,176 KB
testcase_40 AC 57 ms
34,704 KB
testcase_41 AC 29 ms
11,272 KB
testcase_42 AC 1 ms
5,376 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),* )) => { ($(read_value!($next, $t)),*) };
    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };
    ($next:expr, usize1) => (read_value!($next, usize) - 1);
    ($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, 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>;

trait Bisect<T> {
    fn lower_bound(&self, val: &T) -> usize;
    fn upper_bound(&self, val: &T) -> usize;
}

impl<T: Ord> Bisect<T> for [T] {
    fn lower_bound(&self, val: &T) -> usize {
        let mut pass = self.len() + 1;
        let mut fail = 0;
        while pass - fail > 1 {
            let mid = (pass + fail) / 2;
            if &self[mid - 1] >= val {
                pass = mid;
            } else {
                fail = mid;
            }
        }
        pass - 1
    }
    fn upper_bound(&self, val: &T) -> usize {
        let mut pass = self.len() + 1;
        let mut fail = 0;
        while pass - fail > 1 {
            let mid = (pass + fail) / 2;
            if &self[mid - 1] > val {
                pass = mid;
            } else {
                fail = mid;
            }
        }
        pass - 1
    }
}

// Tags: many-intervals, dp, diagonal-cumulative-sum, unusual-cumulative-sum
fn main() {
    input! {
        n: i64, k: usize,
        m: usize,
        lr: [(usize1, usize); m],
    }
    let mut lr = lr;
    const INF: usize = 1 << 30; 
    {
        let mut buc = vec![INF; k];
        for &(l, r) in &lr {
            buc[l] = min(buc[l], r);
        }
        lr = vec![];
        let mut mi = k + 2;
        for i in (0..k).rev() {
            if buc[i] < mi {
                lr.push((i, buc[i]));
                mi = min(mi, buc[i]);
            }
        }
        lr.reverse();
    }
    let m = lr.len();
    let mut dp = vec![vec![MInt::new(0); k + 1]; m];
    let mut acc = vec![vec![MInt::new(0); k + 1]; m + 1];
    let mut acc_diag = vec![vec![MInt::new(0); k + 1]; m + 1];
    acc[m][k] = 1.into();
    acc_diag[m][0] = 1.into();
    for i in (0..m).rev() {
        let (l, r) = lr[i];
        let mut me = vec![MInt::new(0); k + 1];
        let idx = lr.lower_bound(&(r, 0));
        for j in r..k + 1 {
            me[j - (r - l)] -= acc[idx][j];
        }
        if i + 1 < idx {
            let (lnxt, rnxt) = lr[i + 1];
            assert!(r < rnxt);
            assert!(lnxt < r);
            for j in 0..k - l + 1 {
                me[j + l] += acc_diag[idx][j];
                me[j + l] -= acc_diag[i + 1][j];
            }
        }
        for j in l..k + 1 {
            acc[i][j] = acc[i + 1][j] + me[j];
            acc_diag[i][j - l] = acc_diag[i + 1][j - l] + me[j];
            dp[i][j] = me[j];
        }
    }
    let mut tot = MInt::new(0);
    for i in 0..k + 1 {
        tot += acc[0][i] * MInt::new(i as i64).pow(n);
    }
    println!("{}", tot);
}
0