#543799 (Rust) No.1207 グラフX

• 問題: No.1207 グラフX
• ユーザー: koba-e964
• 提出日時: 2020-08-30 13:41:33
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 232 ms / 2,000 ms
• コード長: 8,040 bytes
• コンパイル時間: 13,909 ms
• コンパイル使用メモリ: 382,864 KB
• 実行使用メモリ: 48,896 KB
• 最終ジャッジ日時: 2024-11-15 06:55:10
• 合計ジャッジ時間: 22,843 ms
• ジャッジサーバーID （参考情報）: judge5 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	196 ms; 33,152 KB
testcase_01	AC	200 ms; 33,204 KB
testcase_02	AC	186 ms; 33,152 KB
testcase_03	AC	193 ms; 33,084 KB
testcase_04	AC	193 ms; 33,152 KB
testcase_05	AC	224 ms; 48,768 KB
testcase_06	AC	232 ms; 48,768 KB
testcase_07	AC	220 ms; 48,896 KB
testcase_08	AC	134 ms; 21,804 KB
testcase_09	AC	154 ms; 26,240 KB
testcase_10	AC	218 ms; 40,320 KB
testcase_11	AC	223 ms; 48,768 KB
testcase_12	AC	132 ms; 23,100 KB
testcase_13	AC	61 ms; 9,556 KB
testcase_14	AC	184 ms; 31,872 KB
testcase_15	AC	148 ms; 25,472 KB
testcase_16	AC	60 ms; 10,496 KB
testcase_17	AC	113 ms; 19,704 KB
testcase_18	AC	101 ms; 19,604 KB
testcase_19	AC	97 ms; 15,232 KB
testcase_20	AC	192 ms; 32,640 KB
testcase_21	AC	10 ms; 5,248 KB
testcase_22	AC	112 ms; 19,932 KB
testcase_23	AC	126 ms; 22,736 KB
testcase_24	AC	85 ms; 17,536 KB
testcase_25	AC	194 ms; 32,204 KB
testcase_26	AC	142 ms; 24,552 KB
testcase_27	AC	176 ms; 29,100 KB
testcase_28	AC	158 ms; 26,472 KB
testcase_29	AC	161 ms; 28,544 KB
testcase_30	AC	68 ms; 13,056 KB
testcase_31	AC	50 ms; 7,936 KB
testcase_32	AC	61 ms; 13,312 KB
testcase_33	AC	63 ms; 13,312 KB
testcase_34	AC	143 ms; 25,116 KB
testcase_35	AC	11 ms; 5,248 KB
testcase_36	AC	145 ms; 25,984 KB
testcase_37	AC	118 ms; 21,120 KB
testcase_38	AC	28 ms; 6,912 KB
testcase_39	AC	65 ms; 14,208 KB
testcase_40	AC	38 ms; 5,888 KB
testcase_41	AC	84 ms; 14,928 KB
testcase_42	AC	1 ms; 5,248 KB
testcase_43	AC	1 ms; 5,248 KB
testcase_44	AC	1 ms; 5,248 KB
testcase_45	AC	185 ms; 33,140 KB
testcase_46	AC	179 ms; 33,280 KB
testcase_47	AC	182 ms; 33,280 KB
testcase_48	AC	178 ms; 33,152 KB

ソースコード

#[allow(unused_imports)]
use std::cmp::*;
#[allow(unused_imports)]
use std::collections::*;
use std::io::{Write, BufWriter};
// 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, [graph1; $len:expr]) => {{
        let mut g = vec![vec![]; $len];
        let ab = read_value!($next, [(usize1, usize1)]);
        for (a, b) in ab {
            g[a].push(b);
            g[b].push(a);
        }
        g
    }};
    ($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, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };
    ($next:expr, usize1) => (read_value!($next, usize) - 1);
    ($next:expr, [ $t:tt ]) => {{
        let len = read_value!($next, usize);
        read_value!($next, [$t; len])
    }};
    ($next:expr, $t:ty) => ($next().parse::<$t>().expect("Parse error"));
}

#[allow(unused)]
macro_rules! debug {
    ($($format:tt)*) => (write!(std::io::stderr(), $($format)*).unwrap());
}
#[allow(unused)]
macro_rules! debugln {
    ($($format:tt)*) => (writeln!(std::io::stderr(), $($format)*).unwrap());
}

/**
 * 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]
    }
}

/// Verified by https://atcoder.jp/contests/arc093/submissions/3968098
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 = 1_000_000_007;
define_mod!(P, MOD);
type ModInt = mod_int::ModInt<P>;

fn dfs(g: &[Vec<(usize, i64)>], v: usize, par: usize, x: ModInt) -> (ModInt, i64) {
    let mut sz = 1;
    let mut tot = ModInt::new(0);
    for &(w, c) in &g[v] {
        if w == par {
            continue;
        }
        let (sub, subsz) = dfs(g, w, v, x);
        sz += subsz;
        tot += sub;
        tot += x.pow(c) * (g.len() as i64 - subsz) * subsz;
    }
    (tot, sz)
}

fn solve() {
    let out = std::io::stdout();
    let mut out = BufWriter::new(out.lock());
    macro_rules! puts {
        ($($format:tt)*) => (let _ = write!(out,$($format)*););
    }
    input! {
        n: usize, m: usize, x: i64,
        abc: [(usize1, usize1, i64); m],
    }
    let mut uf = UnionFind::new(n);
    let mut g = vec![vec![]; n];
    for &(a, b, c) in &abc {
        if uf.is_same_set(a, b) {
            continue;
        }
        uf.unite(a, b);
        g[a].push((b, c));
        g[b].push((a, c));
    }
    puts!("{}\n", dfs(&g, 0, n, x.into()).0);
}

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();
}