#889019 (Rust) No.2377 SUM AND XOR on Tree

• 問題: No.2377 SUM AND XOR on Tree
• ユーザー: koba-e964
• 提出日時: 2023-07-08 01:33:43
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 231 ms / 4,000 ms
• コード長: 5,695 bytes
• コンパイル時間: 13,093 ms
• コンパイル使用メモリ: 388,604 KB
• 実行使用メモリ: 26,244 KB
• 最終ジャッジ日時: 2024-07-21 21:47:52
• 合計ジャッジ時間: 17,905 ms
• ジャッジサーバーID （参考情報）: judge3 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 6,812 KB
testcase_01	AC	1 ms; 6,816 KB
testcase_02	AC	1 ms; 6,944 KB
testcase_03	AC	1 ms; 6,944 KB
testcase_04	AC	1 ms; 6,944 KB
testcase_05	AC	1 ms; 6,944 KB
testcase_06	AC	1 ms; 6,940 KB
testcase_07	AC	1 ms; 6,940 KB
testcase_08	AC	213 ms; 11,136 KB
testcase_09	AC	214 ms; 11,264 KB
testcase_10	AC	210 ms; 11,136 KB
testcase_11	AC	210 ms; 11,136 KB
testcase_12	AC	231 ms; 11,136 KB
testcase_13	AC	196 ms; 11,192 KB
testcase_14	AC	210 ms; 10,880 KB
testcase_15	AC	211 ms; 11,136 KB
testcase_16	AC	212 ms; 11,008 KB
testcase_17	AC	188 ms; 11,128 KB
testcase_18	AC	1 ms; 6,940 KB
testcase_19	AC	1 ms; 6,940 KB
testcase_20	AC	1 ms; 6,940 KB
testcase_21	AC	1 ms; 6,944 KB
testcase_22	AC	1 ms; 6,940 KB
testcase_23	AC	218 ms; 11,136 KB
testcase_24	AC	216 ms; 11,256 KB
testcase_25	AC	228 ms; 11,136 KB
testcase_26	AC	130 ms; 25,988 KB
testcase_27	AC	137 ms; 26,244 KB
testcase_28	AC	135 ms; 25,164 KB
testcase_29	AC	91 ms; 11,776 KB
testcase_30	AC	90 ms; 11,776 KB
testcase_31	AC	88 ms; 11,812 KB
testcase_32	AC	99 ms; 11,008 KB
testcase_33	AC	99 ms; 11,008 KB
testcase_34	AC	102 ms; 11,008 KB

ソースコード

// 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> 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>;

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, g: &[Vec<usize>], val: &[bool], inv2: MInt) -> [MInt; 2] {
    let mut dp = [MInt::new(0); 2];
    dp[if val[v] { 1 } else { 0 }] += 1;
    for &w in &g[v] {
        if w == par { continue; }
        let sub = dfs(w, v, g, val, inv2);
        let mut ep = [MInt::new(0); 2];
        for i in 0..2 {
            for j in 0..2 {
                ep[i ^ j] += dp[i] * sub[j];
            }
        }
        dp = ep;
    }
    [(dp[0] + dp[1]) * inv2, dp[1] * inv2]
}

// https://yukicoder.me/problems/no/2377 (3)
// ビットごとに見て、DFS。返り値を [自分以下の連結成分がすべて 1 であって、上に持ち越される値 x が x=0 となる確率, x=1 に対して同じ確率] とする。
fn solve() {
    input! {
        n: usize,
        ab: [(usize1, usize1); n - 1],
        a: [u32; n],
    }
    let mut g = vec![vec![]; n];
    for &(a, b) in &ab {
        g[a].push(b);
        g[b].push(a);
    }
    let inv2 = MInt::new(2).inv();
    let mut tot = MInt::new(0);
    let mut cur = MInt::new(1);
    for b in 0..30 {
        let mut v = vec![false; n];
        for i in 0..n {
            v[i] = (a[i] & 1 << b) != 0;
        }
        let res = dfs(0, n, &g, &v, inv2);
        tot += res[1] * cur;
        cur *= 2;
    }
    println!("{}", tot * MInt::new(2).pow(n as i64));
}