#704462 (Rust) No.1116 Cycles of Dense Graph

• 問題: No.1116 Cycles of Dense Graph
• ユーザー: koba-e964
• 提出日時: 2021-10-03 19:20:21
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 671 ms / 2,000 ms
• コード長: 9,312 bytes
• コンパイル時間: 21,796 ms
• コンパイル使用メモリ: 378,180 KB
• 実行使用メモリ: 41,216 KB
• 最終ジャッジ日時: 2024-07-21 14:16:51
• 合計ジャッジ時間: 22,319 ms
• ジャッジサーバーID （参考情報）: judge2 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 5,248 KB
testcase_01	AC	411 ms; 5,248 KB
testcase_02	AC	10 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	2 ms; 5,376 KB
testcase_05	AC	22 ms; 5,376 KB
testcase_06	AC	146 ms; 5,376 KB
testcase_07	AC	11 ms; 5,376 KB
testcase_08	AC	2 ms; 5,376 KB
testcase_09	AC	3 ms; 5,376 KB
testcase_10	AC	4 ms; 5,376 KB
testcase_11	AC	78 ms; 5,376 KB
testcase_12	AC	22 ms; 5,376 KB
testcase_13	AC	1 ms; 5,376 KB
testcase_14	AC	4 ms; 5,376 KB
testcase_15	AC	2 ms; 5,376 KB
testcase_16	AC	22 ms; 5,376 KB
testcase_17	AC	2 ms; 5,376 KB
testcase_18	AC	8 ms; 5,376 KB
testcase_19	AC	37 ms; 5,376 KB
testcase_20	AC	19 ms; 7,680 KB
testcase_21	AC	8 ms; 5,376 KB
testcase_22	AC	107 ms; 18,432 KB
testcase_23	AC	2 ms; 5,376 KB
testcase_24	AC	654 ms; 33,280 KB
testcase_25	AC	1 ms; 5,376 KB
testcase_26	AC	668 ms; 37,376 KB
testcase_27	AC	1 ms; 5,376 KB
testcase_28	AC	13 ms; 7,296 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	2 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	671 ms; 41,088 KB
testcase_37	AC	214 ms; 41,216 KB
testcase_38	AC	235 ms; 40,960 KB
testcase_39	AC	599 ms; 5,888 KB
testcase_40	AC	604 ms; 5,888 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),* )) => { ($(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> ::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)
}

trait Change { fn chmax(&mut self, x: Self); fn chmin(&mut self, x: Self); }
impl<T: PartialOrd> Change for T {
    fn chmax(&mut self, x: T) { if *self < x { *self = x; } }
    fn chmin(&mut self, x: T) { if *self > x { *self = x; } }
}

fn main() {
    // In order to avoid potential stack overflow, spawn a new thread.
    let stack_size = 104_857_600; // 100 MB
    let thd = std::thread::Builder::new().stack_size(stack_size);
    thd.spawn(|| solve()).unwrap().join().unwrap();
}

fn dfs(v: usize, par: usize,
       hm: &HashMap<usize, Vec<usize>>, vis: &mut HashSet<usize>) -> usize {
    if vis.contains(&v) {
        return 0;
    }
    vis.insert(v);
    let mut s = 1;
    for &w in &hm[&v] {
        if w == par { continue; }
        s += dfs(w, v, hm, vis);
    }
    s
}

fn solve() {
    let debug = true;
    input! {
        n: usize, m: usize,
        ab: [(usize1, usize1); m],
    }
    let (fac, invfac) = fact_init(n + m + 1);
    let mut acc = vec![vec![vec![MInt::new(0); n + 2]; m + 1]; 2 * m + 1];
    // acc[x][y][z] = \sum_{0 <= i < z} C(n - x, i) * (i + y - 1)! * 2^{y - 1}
    for x in 0..min(n, 2 * m) + 1 {
        let mut cur = MInt::new(2).inv();
        for y in 0..m + 1 {
            for i in if y == 0 { 1 } else { 0 }..n + 1 {
                let tmp = if i <= n - x {
                    fac[n - x] * invfac[n - x - i] * invfac[i] * fac[i + y - 1]
                } else {
                    0.into()
                };
                acc[x][y][i + 1] = acc[x][y][i] + tmp * cur;
            }
            cur *= 2;
        }
    }
    let mut tot = MInt::new(0);
    'outer:
    for bits in 0usize..1 << m {
        let odd = bits.count_ones() % 2 == 1;
        let mut hm = HashMap::new();
        for i in 0..m {
            if (bits & 1 << i) != 0 {
                let (a, b) = ab[i];
                hm.entry(a).or_insert(vec![]).push(b);
                hm.entry(b).or_insert(vec![]).push(a);
            }
        }
        let mut f = [0; 3];
        for (&_, v) in &hm {
            if v.len() >= 3 {
                continue 'outer;
            }
            f[v.len()] += 1;
        }
        let mut vis = HashSet::new();
        let mut np = 0;
        let mut np1 = 0;
        for (&k, v) in &hm {
            if v.len() == 1 {
                let c = dfs(k, n, &hm, &mut vis);
                if c > 0 {
                    np += 1;
                    if c == 2 {
                        np1 += 1;
                    }
                }
            }
        }
        let mut nc = 0;
        for (&k, _) in &hm {
            if !vis.contains(&k) {
                nc += 1;
                dfs(k, n, &hm, &mut vis);
            }
        }
        // The graph is a sum of paths and cycles.
        if debug {
            eprintln!("bits = {}, np = {}, np1 = {}, nc = {}", bits, np, np1, nc);
        }
        if np > 0 && nc > 0 {
            continue;
        }
        if nc > 0 {
            if nc >= 2 {
                continue;
            }
            if odd {
                tot -= 1;
            } else {
                tot += 1;
            }
            continue;
        }
        let nr = n - hm.len();
        let mut tmp = MInt::new(0);
        // Find \sum_{0 <= i <= nr, 0 <= j <= np1, 0 <= k <= np - np1}
        // C(nr, i) (i+j+k-1)! * 2^{j+k-1} [i + 2j + 3k >= 3]
        // where j = np1, k = np - np1
        {
            let j = np1;
            let k = np - np1;
            let imin = max(2 * j + 3 * k, 3) - (2 * j + 3 * k);
            let tbl = &acc[hm.len()][j + k];
            if imin <= nr {
                tmp += (tbl[nr + 1] - tbl[imin])
                    * fac[np1] * invfac[j] * invfac[np1 - j]
                    * fac[np - np1] * invfac[k] * invfac[np - np1 - k];
            }
        }
        if debug {
            eprintln!("tmp = {}", tmp);
        }
        if odd {
            tot -= tmp;
        } else {
            tot += tmp;
        }
    }
    println!("{}", tot);
}