結果

問題 No.1207 グラフX
ユーザー ziitaziita
提出日時 2020-08-30 14:08:38
言語 Rust
(1.77.0 + proconio)
結果
AC  
実行時間 192 ms / 2,000 ms
コード長 7,904 bytes
コンパイル時間 15,991 ms
コンパイル使用メモリ 390,004 KB
実行使用メモリ 46,464 KB
最終ジャッジ日時 2024-11-15 07:21:00
合計ジャッジ時間 22,487 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 163 ms
30,900 KB
testcase_01 AC 164 ms
30,840 KB
testcase_02 AC 163 ms
30,756 KB
testcase_03 AC 170 ms
30,976 KB
testcase_04 AC 161 ms
30,848 KB
testcase_05 AC 192 ms
46,464 KB
testcase_06 AC 192 ms
46,464 KB
testcase_07 AC 192 ms
46,464 KB
testcase_08 AC 112 ms
20,480 KB
testcase_09 AC 133 ms
24,448 KB
testcase_10 AC 184 ms
38,016 KB
testcase_11 AC 185 ms
46,464 KB
testcase_12 AC 120 ms
21,760 KB
testcase_13 AC 49 ms
9,344 KB
testcase_14 AC 159 ms
29,560 KB
testcase_15 AC 125 ms
23,936 KB
testcase_16 AC 50 ms
9,984 KB
testcase_17 AC 94 ms
18,304 KB
testcase_18 AC 83 ms
18,304 KB
testcase_19 AC 79 ms
14,336 KB
testcase_20 AC 163 ms
30,208 KB
testcase_21 AC 8 ms
5,248 KB
testcase_22 AC 94 ms
18,688 KB
testcase_23 AC 108 ms
21,120 KB
testcase_24 AC 71 ms
16,384 KB
testcase_25 AC 162 ms
29,900 KB
testcase_26 AC 118 ms
22,756 KB
testcase_27 AC 148 ms
26,880 KB
testcase_28 AC 132 ms
24,704 KB
testcase_29 AC 140 ms
26,496 KB
testcase_30 AC 57 ms
12,288 KB
testcase_31 AC 41 ms
7,680 KB
testcase_32 AC 52 ms
12,544 KB
testcase_33 AC 56 ms
12,288 KB
testcase_34 AC 129 ms
23,552 KB
testcase_35 AC 9 ms
5,248 KB
testcase_36 AC 134 ms
24,064 KB
testcase_37 AC 105 ms
19,712 KB
testcase_38 AC 25 ms
6,400 KB
testcase_39 AC 57 ms
13,312 KB
testcase_40 AC 30 ms
5,760 KB
testcase_41 AC 76 ms
14,080 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 156 ms
30,976 KB
testcase_46 AC 155 ms
30,772 KB
testcase_47 AC 160 ms
30,976 KB
testcase_48 AC 161 ms
30,964 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#![allow(unused_imports)]
#![allow(non_snake_case, unused)]

use std::cmp::*;
use std::collections::*;
use std::ops::*;

// https://atcoder.jp/contests/hokudai-hitachi2019-1/submissions/10518254 より

macro_rules! eprint {
    ($($t:tt)*) => {{
        use ::std::io::Write;
        let _ = write!(::std::io::stderr(), $($t)*);
    }};
}
macro_rules! eprintln {
    () => { eprintln!(""); };
    ($($t:tt)*) => {{
        use ::std::io::Write;
        let _ = writeln!(::std::io::stderr(), $($t)*);
    }};
}
macro_rules! dbg {
    ($v:expr) => {{
        let val = $v;
        eprintln!("[{}:{}] {} = {:?}", file!(), line!(), stringify!($v), val);
        val
    }}
}

macro_rules! mat {
    ($($e:expr),*) => { Vec::from(vec![$($e),*]) };
    ($($e:expr,)*) => { Vec::from(vec![$($e),*]) };
    ($e:expr; $d:expr) => { Vec::from(vec![$e; $d]) };
    ($e:expr; $d:expr $(; $ds:expr)+) => { Vec::from(vec![mat![$e $(; $ds)*]; $d]) };
}

macro_rules! ok {
    ($a:ident$([$i:expr])*.$f:ident()$(@$t:ident)*) => {
        $a$([$i])*.$f($($t),*)
    };
    ($a:ident$([$i:expr])*.$f:ident($e:expr$(,$es:expr)*)$(@$t:ident)*) => { {
        let t = $e;
        ok!($a$([$i])*.$f($($es),*)$(@$t)*@t)
    } };
}

pub fn readln() -> String {
    let mut line = String::new();
    ::std::io::stdin().read_line(&mut line).unwrap_or_else(|e| panic!("{}", e));
    line
}

macro_rules! read {
    ($($t:tt),*; $n:expr) => {{
        let stdin = ::std::io::stdin();
        let ret = ::std::io::BufRead::lines(stdin.lock()).take($n).map(|line| {
            let line = line.unwrap();
            let mut it = line.split_whitespace();
            _read!(it; $($t),*)
        }).collect::<Vec<_>>();
        ret
    }};
    ($($t:tt),*) => {{
        let line = readln();
        let mut it = line.split_whitespace();
        _read!(it; $($t),*)
    }};
}

macro_rules! _read {
    ($it:ident; [char]) => {
        _read!($it; String).chars().collect::<Vec<_>>()
    };
    ($it:ident; [u8]) => {
        Vec::from(_read!($it; String).into_bytes())
    };
    ($it:ident; usize1) => {
        $it.next().unwrap_or_else(|| panic!("input mismatch")).parse::<usize>().unwrap_or_else(|e| panic!("{}", e)) - 1
    };
    ($it:ident; [usize1]) => {
        $it.map(|s| s.parse::<usize>().unwrap_or_else(|e| panic!("{}", e)) - 1).collect::<Vec<_>>()
    };
    ($it:ident; [$t:ty]) => {
        $it.map(|s| s.parse::<$t>().unwrap_or_else(|e| panic!("{}", e))).collect::<Vec<_>>()
    };
    ($it:ident; $t:ty) => {
        $it.next().unwrap_or_else(|| panic!("input mismatch")).parse::<$t>().unwrap_or_else(|e| panic!("{}", e))
    };
    ($it:ident; $($t:tt),+) => {
        ($(_read!($it; $t)),*)
    };
}


pub fn main() {
    let _ = ::std::thread::Builder::new().name("run".to_string()).stack_size(32 * 1024 * 1024).spawn(run).unwrap().join();
}

// const MOD: usize = 998244353;
const MOD: usize = 1_000_000_007;
const INF: i64 = std::i64::MAX/2;

#[derive(Clone, Copy)]
struct ModInt(usize);
 
impl std::ops::Add for ModInt {
    type Output = ModInt;
    fn add(self, rhs: ModInt) -> Self::Output {
        let mut d = self.0 + rhs.0;
        if d >= MOD {
            d -= MOD;
        }
        ModInt(d)
    }
}
 
impl std::ops::AddAssign for ModInt {
    fn add_assign(&mut self, rhs: ModInt) {
        *self = *self + rhs;
    }
}
 
impl std::ops::Sub for ModInt {
    type Output = ModInt;
    fn sub(self, rhs: ModInt) -> Self::Output {
        let mut d = self.0 + MOD - rhs.0;
        if d >= MOD {
            d -= MOD;
        }
        ModInt(d)
    }
}
 
impl std::ops::SubAssign for ModInt {
    fn sub_assign(&mut self, rhs: ModInt) {
        *self = *self - rhs;
    }
}
 
impl std::ops::Mul for ModInt {
    type Output = ModInt;
    fn mul(self, rhs: ModInt) -> Self::Output {
        ModInt((self.0 as u64 * rhs.0 as u64 % MOD as u64) as usize)
    }
}
 
impl std::ops::MulAssign for ModInt {
    fn mul_assign(&mut self, rhs: ModInt) {
        *self = *self * rhs;
    }
}
 
impl std::ops::Neg for ModInt {
    type Output = ModInt;
    fn neg(self) -> Self::Output {
        ModInt(if self.0 == 0 {0} else {MOD - self.0})
    }
}
 
/* 
impl std::fmt::Display for ModInt {
    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        write!(f, "{}", self.0)
    }
}
*/
 
#[allow(dead_code)]
impl ModInt {
    pub fn new(n: usize) -> ModInt {
        ModInt(n % MOD)
    }
    pub fn zero() -> ModInt {
        ModInt(0)
    }
    pub fn one() -> ModInt {
        ModInt(1)
    }
    pub fn pow(self, mut n: i64) -> ModInt {
        let mut t = ModInt::one();
        let mut s = self;
        while n > 0 {
            if n & 1 == 1 {
                t *= s;
            }
            s *= s;
            n >>= 1;
        }
        t
    }
    pub fn inv(self) -> ModInt {
        self.pow((MOD - 2) as i64)
    }
}
// ---------- end ModInt ----------
// ---------- begin Precalc ----------
#[allow(dead_code)]
struct Precalc {
    inv: Vec<ModInt>,
    fact: Vec<ModInt>,
    ifact: Vec<ModInt>,
}
 
#[allow(dead_code)]
impl Precalc {
    pub fn new(n: usize) -> Precalc {
        let mut inv = vec![ModInt::one(); n + 1];
        let mut fact = vec![ModInt::one(); n + 1];
        let mut ifact = vec![ModInt::one(); n + 1];
        for i in 2..(n + 1) {
            inv[i] = -inv[MOD as usize % i] * ModInt(MOD / i as usize);
            fact[i] = fact[i - 1] * ModInt(i as usize);
            ifact[i] = ifact[i - 1] * inv[i];
        }
        Precalc {
            inv: inv,
            fact: fact,
            ifact: ifact,
        }
    }
    pub fn inv(&self, n: usize) -> ModInt {
        self.inv[n]
    }
    pub fn fact(&self, n: usize) -> ModInt {
        self.fact[n]
    }
    pub fn ifact(&self, n: usize) -> ModInt {
        self.ifact[n]
    }
    pub fn comb(&self, n: usize, k: usize) -> ModInt {
        if k > n {
            return ModInt::zero();
        }
        self.fact[n] * self.ifact[k] * self.ifact[n - k]
    }
}
// ---------- end Precalc ----------

pub struct UnionFind {
    data: Vec<i32>,
}

impl UnionFind {
    pub fn new(n: usize) -> Self{
        UnionFind {
            data: vec![-1;n]
        }
    }
    pub fn root(&mut self, x: usize) -> usize{
        if self.data[x]<0 {
            x
        }
        else {
            let p = self.data[x] as usize;
            self.data[x] = self.root(p) as i32;
            self.data[x] as usize
        }
    }
    pub fn unite(&mut self, x: usize, y: usize){
        let rx = self.root(x);
        let ry = self.root(y);
        if rx!=ry {
            let (rx,ry) = if self.data[rx]<=self.data[ry] {
                (rx,ry)
            }
            else{
                (ry,rx)
            };
            self.data[rx] += self.data[ry];
            self.data[ry] = rx as i32;
        }
    }
    pub fn same(&mut self, x: usize, y: usize) ->  bool{
        self.root(x) == self.root(y)
    }
    pub fn size(&mut self, x: usize) -> i32 {
        let r = self.root(x);
        - self.data[r]
    }
}

fn solve() {
    let (n,m,x) = read!(usize,usize,usize);
    let xyz = read!(usize,usize,i64;m);
    let mut uf = UnionFind::new(n);
    let mut edge = vec![vec![];n];
    for &(x,y,z) in &xyz {
        let s = x-1;
        let t = y-1;
        if uf.same(s,t) {
            continue;
        }
        edge[s].push((t,z));
        edge[t].push((s,z));
        uf.unite(s,t);
    }
    let (_,ret) = dfs(0,n,&edge,x);
    println!("{}",ret.0);
}

fn dfs(cur: usize, p: usize, edge: &Vec<Vec<(usize,i64)>>, x: usize) -> (usize,ModInt) {
    let mut sum = 1;
    let mut ans = ModInt(0);
    let n = edge.len();
    for &(t,z) in &edge[cur] {
        if t==p {
            continue;
        }
        let (count,cans) = dfs(t,cur,&edge,x);
        ans += cans + ModInt(x).pow(z)*ModInt(count)*ModInt(n-count);
        sum += count;
    }
    (sum,ans)
}

fn run() {
    solve();
}
0