#740489 (Rust) No.1843 Tree ANDistance

• 問題: No.1843 Tree ANDistance
• ユーザー: koba-e964
• 提出日時: 2022-02-18 22:46:54
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 150 ms / 2,000 ms
• コード長: 2,736 bytes
• コンパイル時間: 15,639 ms
• コンパイル使用メモリ: 378,824 KB
• 実行使用メモリ: 5,944 KB
• 最終ジャッジ日時: 2024-06-29 09:34:04
• 合計ジャッジ時間: 17,370 ms
• ジャッジサーバーID （参考情報）: judge2 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	146 ms; 5,812 KB
testcase_01	AC	146 ms; 5,804 KB
testcase_02	AC	140 ms; 5,804 KB
testcase_03	AC	141 ms; 5,804 KB
testcase_04	AC	150 ms; 5,944 KB
testcase_05	AC	133 ms; 5,808 KB
testcase_06	AC	147 ms; 5,804 KB
testcase_07	AC	137 ms; 5,760 KB
testcase_08	AC	141 ms; 5,760 KB
testcase_09	AC	131 ms; 5,680 KB
testcase_10	AC	127 ms; 5,516 KB
testcase_11	AC	144 ms; 5,784 KB
testcase_12	AC	118 ms; 5,596 KB
testcase_13	AC	138 ms; 5,632 KB
testcase_14	AC	5 ms; 5,376 KB
testcase_15	AC	5 ms; 5,376 KB
testcase_16	AC	3 ms; 5,376 KB
testcase_17	AC	2 ms; 5,376 KB
testcase_18	AC	1 ms; 5,376 KB
testcase_19	AC	5 ms; 5,376 KB
testcase_20	AC	3 ms; 5,376 KB
testcase_21	AC	1 ms; 5,376 KB
testcase_22	AC	1 ms; 5,376 KB
testcase_23	AC	1 ms; 5,376 KB
testcase_24	AC	1 ms; 5,376 KB
testcase_25	AC	1 ms; 5,376 KB
testcase_26	AC	0 ms; 5,376 KB
testcase_27	AC	1 ms; 5,376 KB
testcase_28	AC	63 ms; 5,376 KB
testcase_29	AC	43 ms; 5,376 KB
testcase_30	AC	40 ms; 5,376 KB
testcase_31	AC	68 ms; 5,376 KB
testcase_32	AC	64 ms; 5,376 KB
testcase_33	AC	20 ms; 5,376 KB
testcase_34	AC	52 ms; 5,376 KB
testcase_35	AC	1 ms; 5,376 KB
testcase_36	AC	1 ms; 5,376 KB
testcase_37	AC	1 ms; 5,376 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"));
}

/**
 * Union-Find tree.
 * Verified by https://atcoder.jp/contests/pakencamp-2019-day3/submissions/9253305
 */
struct UnionFind { disj: Vec<usize>, rank: Vec<usize> }

impl UnionFind {
    fn new(n: usize) -> Self {
        let disj = (0..n).collect();
        UnionFind { disj: disj, rank: vec![1; n] }
    }
    fn root(&mut self, x: usize) -> usize {
        if x != self.disj[x] {
            let par = self.disj[x];
            let r = self.root(par);
            self.disj[x] = r;
        }
        self.disj[x]
    }
    fn unite(&mut self, x: usize, y: usize) {
        let mut x = self.root(x);
        let mut y = self.root(y);
        if x == y { return }
        if self.rank[x] > self.rank[y] {
            std::mem::swap(&mut x, &mut y);
        }
        self.disj[x] = y;
        self.rank[y] += self.rank[x];
    }
    #[allow(unused)]
    fn is_same_set(&mut self, x: usize, y: usize) -> bool {
        self.root(x) == self.root(y)
    }
    #[allow(unused)]
    fn size(&mut self, x: usize) -> usize {
        let x = self.root(x);
        self.rank[x]
    }
}

const MOD: i64 = 1_000_000_007;

fn main() {
    input! {
        n: usize,
        abc: [(usize1, usize1, i64); n - 1],
    }
    let mut tot = 0;
    for k in 0..30 {
        let mut uf = UnionFind::new(n);
        for &(a, b, c) in &abc {
            if (c & 1 << k) != 0 {
                uf.unite(a, b);
            }
        }
        for i in 0..n {
            if uf.root(i) == i {
                let s = uf.size(i) as i64;
                let v = s * (s - 1) / 2 % MOD;
                tot += (v << k) % MOD;
            }
        }
    }
    println!("{}", tot % MOD);
}