#1185393 (Rust) No.3695 同室と別室

• 問題: No.3695 同室と別室
• ユーザー: 👑 ArcAki
• 提出日時: 2026-09-09 21:53:19
• 言語: Rust (1.97.1 + proconio + num + itertools + ACL)
• 結果: AC
• 実行時間: 23 ms / 2,000 ms
• コード長: 10,826 bytes
• コンパイル時間: 3,051 ms
• コンパイル使用メモリ: 188,448 KB
• 実行使用メモリ: 6,528 KB
• 最終ジャッジ日時: 2026-09-09 21:53:38
• 合計ジャッジ時間: 5,475 ms
• ジャッジサーバーID （参考情報）: judge3_0 / judge1_0

ファイルパターン	結果
sample	AC * 2
other	AC * 13

ソースコード

#[allow(unused_imports)]
use std::{
    convert::{Infallible, TryFrom, TryInto as _}, fmt::{self, Debug, Display, Formatter,},
    fs::File, hash::{Hash, Hasher, BuildHasherDefault}, iter::{Product, Sum}, marker::PhantomData,
    ops::{Add, AddAssign, Sub, SubAssign, Div, DivAssign, Mul, MulAssign, 
        Neg, RangeBounds, BitAnd, BitAndAssign, BitOr, BitXor, BitXorAssign, BitOrAssign},
    str::FromStr, sync::{atomic::{self, AtomicU32, AtomicU64}, Once},
    collections::{*, btree_set::Range, btree_map::Range as BTreeRange}, mem::{take, swap},
    cmp::{self, Reverse, Ordering, Eq, PartialEq, PartialOrd},
    thread::LocalKey, f64::consts::PI, time::Instant, cell::RefCell,
    io::{self, stdin, Read, read_to_string, BufWriter, BufReader, stdout, Write},
    ptr::null_mut, println, print,debug_assert,debug_assert_eq,debug_assert_ne,
};
#[allow(unused_imports)]
use core::panic;
pub mod fxhash {
    use std::hash::BuildHasherDefault;
    const K: u64 = 0x517c_c1b7_2722_0a95;
    #[derive(Default)]
    pub struct FxHasher {
        pub hash: u64,
    }
    impl FxHasher {
        #[inline(always)]
        fn mix_u64(mut h: u64, x: u64) -> u64 {
            h = h.rotate_left(5) ^ x;
            h = h.wrapping_mul(K);
            let x2 = x ^ (x >> 33) ^ (x << 11);
            h = h.rotate_left(5) ^ x2;
            h = h.wrapping_mul(K);
            h
        }

        #[inline(always)]
        fn write_u64_impl(&mut self, x: u64) {
            self.hash = Self::mix_u64(self.hash, x);
        }
    }

    impl std::hash::Hasher for FxHasher {
        #[inline(always)]
        fn finish(&self) -> u64 {
            self.hash
        }

        #[inline(always)]
        fn write(&mut self, bytes: &[u8]) {
            let mut h = self.hash;
            for &b in bytes {
                h = h.rotate_left(5) ^ (b as u64);
                h = h.wrapping_mul(K);
            }
            self.hash = h;
        }

        #[inline(always)]
        fn write_u64(&mut self, i: u64) { self.write_u64_impl(i); }
        #[inline(always)]
        fn write_u32(&mut self, i: u32) { self.write_u64_impl(i as u64); }
        #[inline(always)]
        fn write_u16(&mut self, i: u16) { self.write_u64_impl(i as u64); }
        #[inline(always)]
        fn write_u8 (&mut self, i: u8 ) { self.write_u64_impl(i as u64); }
        #[inline(always)]
        fn write_usize(&mut self, i: usize) { self.write_u64_impl(i as u64); }
        #[inline(always)]
        fn write_i64(&mut self, i: i64) { self.write_u64_impl(i as u64); }
        #[inline(always)]
        fn write_i32(&mut self, i: i32) { self.write_u64_impl(i as u64); }
        #[inline(always)]
        fn write_i16(&mut self, i: i16) { self.write_u64_impl(i as u64); }
        #[inline(always)]
        fn write_i8 (&mut self, i: i8 ) { self.write_u64_impl(i as u64); }
        #[inline(always)]
        fn write_isize(&mut self, i: isize) { self.write_u64_impl(i as u64); }
    }

    pub type FxBuildHasher = BuildHasherDefault<FxHasher>;
    pub type FxMap<K, V> = std::collections::HashMap<K, V, FxBuildHasher>;
    pub type FxSet<K> = std::collections::HashSet<K, FxBuildHasher>;
}

pub fn gcd(mut a: i64, mut b: i64)->i64{a=a.abs();b=b.abs();if a==0{return b;}else if b==0{return a;}let l1 = a.trailing_zeros();let l2 = b.trailing_zeros();
a >>= l1; b >>= l2;while a!=b{let x = (a^b).trailing_zeros();if a<b{swap(&mut a, &mut b)}a = (a-b)>>x;}a << l1.min(l2)}
pub fn gcd_i32(mut a: i32, mut b: i32)->i32{a=a.abs();b=b.abs();if a==0{return b;}else if b==0{return a;}let l1 = a.trailing_zeros();let l2 = b.trailing_zeros();
a >>= l1; b >>= l2;while a!=b{let x = (a^b).trailing_zeros();if a<b{swap(&mut a, &mut b)}a = (a-b)>>x;}a << l1.min(l2)}
pub fn factorial_i64(n: usize)->(Vec<i64>, Vec<i64>){ 
    let mut res = vec![1; n+1];let mut inv = vec![1; n+1];for i in 0..n{ res[i+1] = (res[i]*(i+1)as i64)%MOD; }
    inv[n] = mod_inverse(res[n], MOD);for i in (0..n).rev(){ inv[i] = inv[i+1]*(i+1) as i64%MOD; }(res, inv) }
pub fn floor(a:i64, b:i64)->i64{let res=(a%b+b)%b;(a-res)/b}
pub fn modulo(a: i64, b: i64)->i64{(a%b+b)%b}
pub fn extended_gcd(a:i64,b:i64)->(i64,i64,i64)
{if b==0{(a,1,0)}else{let(g,x,y)=extended_gcd(b,a%b);(g,y,x-floor(a,b)*y)}}
pub fn mod_inverse(a:i64,m:i64)->i64{let(_,x,_) =extended_gcd(a,m);(x%m+m)%m}
pub fn comb(a: i64, b: i64, f: &Vec<(i64, i64)>)->i64{
    if a<b{return 0;}else if b==0 || a==b{ return 1; }
    else{let x=f[a as usize].0;
        let y=f[(a-b) as usize].1;let z=f[b as usize].1;return((x*y)%MOD)*z%MOD;}}
pub fn factorial(x: i64)->Vec<(i64, i64)>{
    let mut f=vec![(1i64,1i64),(1, 1)];let mut z = 1i64;
    let mut inv = vec![0; x as usize+10];inv[1] = 1;
    for i in 2..x+1{z=(z*i)%MOD;
        let w=(MOD-inv[(MOD%i)as usize]*(MOD/i)%MOD)%MOD;
        inv[i as usize] = w;
        f.push((z, (f[i as usize-1].1*w)%MOD));}return f;}
pub fn fast_mod_pow(mut x: i64,p: usize, m: i64)->i64{
    x %= m;
    let mut res=1;let mut t=x;let mut z=p;while z > 0{
        if z%2==1{res = (res*t)%m;}t = (t*t)%m;z /= 2; }res}

pub trait SortD{ fn sort_d(&mut self); }
impl<T: Ord> SortD for Vec<T>{ fn sort_d(&mut self) {self.sort_by(|u, v| v.cmp(&u));} }
pub trait Mx{fn max(&self, rhs: Self)->Self;}
impl Mx for f64{ fn max(&self, rhs: Self)->Self{if *self < rhs{ rhs } else { *self } }}
pub trait Mi{ fn min(&self, rhs: Self)->Self; }
impl Mi for f64{ fn min(&self, rhs: Self)->Self{ if *self > rhs{ rhs } else { *self } } }
pub trait Chmax: PartialOrd + Copy {fn chmax(&mut self, rhs: Self) {if *self < rhs { *self = rhs; }}}
impl<T: PartialOrd + Copy> Chmax for T {}
pub trait Chmin: PartialOrd + Copy {fn chmin(&mut self, rhs: Self) {if *self > rhs { *self = rhs; }}}
impl<T: PartialOrd + Copy> Chmin for T {}
#[allow(unused)]
use proconio::{*, marker::*};
#[allow(unused)]
use fxhash::FxMap;
#[allow(unused)]
use ac_library::{*};

#[allow(dead_code)]
const INF: i64 = 1<<60;
#[allow(dead_code)]
const I: i32 = 1<<30;
#[allow(dead_code)]
const MOD: i64 = 998244353;
#[allow(dead_code)]
const D: [(usize, usize); 4] = [(1, 0), (0, 1), (!0, 0), (0, !0)];
#[allow(dead_code)]
pub fn c2d(c: u8)->(usize, usize){match c{b'U'=>(!0,0),b'D'=>(1,0),b'L'=>(0,!0),b'R'=>(0,1),_=>unreachable!()}}
#[allow(dead_code)]
pub fn c2d_i64(c: u8)->(i64, i64){match c{b'U'=>(-1,0),b'D'=>(1,0),b'L'=>(0,-1),b'R'=>(0,1),_=>unreachable!()}}
#[allow(dead_code)]
pub fn join2str<T: ToString>(v: &[T])->String{v.iter().map(|x| x.to_string()).collect::<Vec<_>>().join(" ")}
#[allow(dead_code)]
pub fn join2nospace<T: ToString>(v: &[T])->String{v.iter().map(|x| x.to_string()).collect::<Vec<_>>().join("")}
#[allow(dead_code)]
const D2: [(usize, usize); 8] = [(1, 0), (1, 1), (0, 1), (!0, 1), (!0, 0), (!0, !0), (0, !0), (1, !0)];

pub trait UFMonoid{
    type S: Clone+PartialEq;
    fn identity()->Self::S;
    fn op(a: &Self::S, b: &Self::S)->Self::S;
    fn inv(x: &Self::S)->Self::S;
}

pub struct WeightedUnionFind<M> where M:UFMonoid{
    parent: Vec<i32>,
    data: Vec<M::S>,
}

impl<M> WeightedUnionFind<M> where M:UFMonoid{
    pub fn new(n: usize)->Self{
        WeightedUnionFind{
            parent: vec![-1; n],
            data: vec![M::identity(); n],
        }
    }

    #[inline]
    pub fn dist(&mut self, p: usize)->M::S{
        self.compress(p);
        self.data[p].clone()
    }

    #[inline(always)]
    pub fn find(&self, mut p: usize) -> (usize, M::S){
        let mut w = self.data[p].clone();
        while self.parent[p] >= 0{
            p = self.parent[p] as usize;
            w = M::op(&self.data[p], &w);
        }
        (p, w)
    }

    #[inline]
    pub fn compress(&mut self, p: usize) -> usize{
        if self.parent[p] < 0{
            return p;
        }
        let pre = self.parent[p]as usize;
        let res = self.compress(pre);
        self.data[p] = M::op(&self.data[pre], &self.data[p]);
        self.parent[p] = res as i32;
        res
    }

    #[inline(always)]
    pub fn union(&mut self, u: usize, v: usize, w: M::S)->bool{
        let ((mut pu, wu), (mut pv, wv)) = (self.find(u), self.find(v));
        if pu==pv{
            return wv==M::op(&wu, &w)
        }
        let mut nex = M::op(&M::op(&wu, &w), &M::inv(&wv));
        if self.parent[pu] > self.parent[pv]{
            swap(&mut pu, &mut pv);
            nex = M::inv(&nex);
        }
        self.parent[pu] += self.parent[pv];
        self.parent[pv] = pu as i32;
        self.data[pv] = nex;
        true
    }

    #[inline(always)]
    pub fn union_c(&mut self, u: usize, v: usize, w: M::S)->bool{
        let (mut pu, mut pv) = (self.compress(u), self.compress(v));
        if pu==pv{
            return self.data[v]==M::op(&self.data[u], &w)
        }
        if self.parent[pu] > self.parent[pv] {
            swap(&mut pu, &mut pv);
        }
        let mut nex = M::op(&M::op(&self.dist(u), &w), &M::inv(&self.dist(v)));
        if self.parent[pu] > self.parent[pv]{
            swap(&mut pu, &mut pv);
            nex = M::inv(&nex);
        }
        self.parent[pu] += self.parent[pv];
        self.parent[pv] = pu as i32;
        self.data[pv] = nex;
        true
    }

    #[inline(always)]
    pub fn same_c(&mut self, u: usize, v: usize)->bool{
        self.compress(u)==self.compress(v)
    }

    #[inline(always)]
    pub fn same(&self, u: usize, v: usize)->bool{
        self.find(u).0==self.find(v).0
    }

    pub fn size_c(&mut self, p: usize)->usize{
        let pre = self.compress(p);
        (-self.parent[pre]) as usize
    }

    pub fn size(&self, p: usize)->usize{
        (-self.parent[self.find(p).0]) as usize
    }

    #[inline(always)]
    pub fn diff(&mut self, u: usize, v: usize)->Option<M::S>{
        let (pu, wu) = self.find(u);
        let (pv, wv) = self.find(v);
        if pu==pv{
            Some(M::op(&M::inv(&wu), &wv))
        } else {
            None
        }
    }
}

struct M;
impl UFMonoid for M{
    type S = u8;

    fn identity()->Self::S {
        0
    }

    fn op(&a: &Self::S, &b: &Self::S)->Self::S {
        a^b
    }

    fn inv(&x: &Self::S)->Self::S {
        x
    }
}

#[allow(unused)]
type MI = StaticModInt<Mod998244353>;
const MULTI: bool = false;
//#[fastout]
fn solve(){
    input!{
        n: usize, q: usize,
    }
    let mut ans = MI::new(2).pow(n as u64);
    let mut uf = WeightedUnionFind::<M>::new(n);
    let d = MI::new(1)/2;
    for _ in 0..q{
        input!{
            t: u8, u: Usize1, v: Usize1,
        }
        if uf.same(u, v) && uf.diff(u,v).unwrap()!=t{
            println!("0");
            return;
        } else if !uf.same(u, v){
            ans *= d;
            uf.union(u, v, t);
        }
    }
    println!("{}",ans);
}

fn main() {
    if MULTI{
        input!{
            t: usize,
        }
        for _ in 0..t{
            solve();
        }
    } else {
        solve();
    }
}