結果

問題 No.2133 Take it easy!
ユーザー koba-e964koba-e964
提出日時 2023-07-06 09:46:16
言語 Rust
(1.77.0)
結果
AC  
実行時間 1,251 ms / 2,000 ms
コード長 7,539 bytes
コンパイル時間 1,729 ms
コンパイル使用メモリ 162,872 KB
実行使用メモリ 5,296 KB
最終ジャッジ日時 2023-09-27 10:54:11
合計ジャッジ時間 13,267 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,376 KB
testcase_01 AC 1 ms
4,376 KB
testcase_02 AC 3 ms
4,376 KB
testcase_03 AC 32 ms
5,280 KB
testcase_04 AC 6 ms
4,688 KB
testcase_05 AC 133 ms
4,376 KB
testcase_06 AC 220 ms
4,380 KB
testcase_07 AC 1,238 ms
4,776 KB
testcase_08 AC 28 ms
5,288 KB
testcase_09 AC 32 ms
5,200 KB
testcase_10 AC 31 ms
5,000 KB
testcase_11 AC 152 ms
4,556 KB
testcase_12 AC 227 ms
4,480 KB
testcase_13 AC 143 ms
5,288 KB
testcase_14 AC 654 ms
5,276 KB
testcase_15 AC 147 ms
5,020 KB
testcase_16 AC 127 ms
4,376 KB
testcase_17 AC 120 ms
4,380 KB
testcase_18 AC 1,191 ms
4,984 KB
testcase_19 AC 1,251 ms
4,380 KB
testcase_20 AC 34 ms
4,376 KB
testcase_21 AC 890 ms
4,952 KB
testcase_22 AC 501 ms
4,380 KB
testcase_23 AC 593 ms
5,296 KB
testcase_24 AC 769 ms
5,208 KB
testcase_25 AC 594 ms
5,280 KB
testcase_26 AC 1 ms
4,376 KB
testcase_27 AC 1 ms
4,380 KB
testcase_28 AC 5 ms
5,120 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#[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),* )) => { ($(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> 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)]
        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)
}

fn divide_segments(mut lr: Vec<(usize, usize)>) -> Vec<(usize, usize)> {
    let mut ans = vec![];
    while let Some((mut l, mut r)) = lr.pop() {
        eprintln!("{:?} {:?} {:?}", ans, lr, (l, r));
        let mut new = vec![];
        for &(x, y) in &ans {
            if y <= l || r <= x {
                new.push((x, y));
                continue;
            }
            if (l <= x && y <= r) || (x <= l && r <= y) {
                new.push((x, y));
                continue;
            }
            if x < l {
                lr.push((x, l));
                lr.push((l, y));
                lr.push((y, r));
                l = 0;
                r = 0;
                continue;
            }
            assert!(l < x);
            lr.push((l, x));
            lr.push((x, r));
            lr.push((r, y));
            l = 0;
            r = 0;
        }
        if l < r {
            new.push((l, r));
        }
        ans = new;
    }
    ans.sort_by_key(|&(l, r)| (r - l, l));
    ans.dedup();
    ans
}

fn main() {
    input! {
        n: usize, q: usize,
        lr: [(usize1, usize); q],
    }
    let (fac, invfac) = fact_init(n + 1);
    let trans = divide_segments(lr);
    if trans.len() <= 30 {
        eprintln!("{:?}", trans);
    }
    let mut ans = MInt::new(1);
    let mut rem = n;
    let mut seen = vec![false; n + 1];
    for &(l, r) in &trans {
        let mut count = 0;
        for i in l..r {
            if !seen[i] {
                seen[i] = true;
                count += 1;
                rem -= 1;
            }
        }
        if count % 2 == 1 {
            ans = 0.into();
        } else {
            ans *= fac[count] * invfac[count / 2] * invfac[count / 2 + 1];
        }
    }
    let paths = |x: usize| {
        if x <= rem && (x + rem) % 2 == 0 {
            fac[rem] * invfac[(rem - x) / 2] * invfac[(rem + x) / 2]
        } else {
            MInt::new(0)
        }
    };
    let ge = if rem % 2 == 0 {
        paths(0) - paths(2)
    } else {
        paths(1) - paths(3)
    };
    ans *= fac[n - n / 2] * fac[n / 2];
    println!("{}", ge * ans);
}
0