結果

問題 No.1207 グラフX
ユーザー ikdikd
提出日時 2020-09-02 19:53:09
言語 Rust
(1.77.0 + proconio)
結果
AC  
実行時間 469 ms / 2,000 ms
コード長 8,067 bytes
コンパイル時間 12,433 ms
コンパイル使用メモリ 376,916 KB
実行使用メモリ 64,396 KB
最終ジャッジ日時 2024-11-21 18:48:32
合計ジャッジ時間 30,451 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 326 ms
61,212 KB
testcase_01 AC 367 ms
61,208 KB
testcase_02 AC 416 ms
61,212 KB
testcase_03 AC 408 ms
61,204 KB
testcase_04 AC 469 ms
61,212 KB
testcase_05 AC 434 ms
64,356 KB
testcase_06 AC 460 ms
64,396 KB
testcase_07 AC 437 ms
64,360 KB
testcase_08 AC 273 ms
40,560 KB
testcase_09 AC 267 ms
50,284 KB
testcase_10 AC 409 ms
55,780 KB
testcase_11 AC 426 ms
64,224 KB
testcase_12 AC 269 ms
42,908 KB
testcase_13 AC 174 ms
21,620 KB
testcase_14 AC 329 ms
58,700 KB
testcase_15 AC 278 ms
47,364 KB
testcase_16 AC 162 ms
21,104 KB
testcase_17 AC 224 ms
36,232 KB
testcase_18 AC 172 ms
35,528 KB
testcase_19 AC 244 ms
30,408 KB
testcase_20 AC 394 ms
60,108 KB
testcase_21 AC 28 ms
6,016 KB
testcase_22 AC 208 ms
36,692 KB
testcase_23 AC 227 ms
41,656 KB
testcase_24 AC 143 ms
31,628 KB
testcase_25 AC 310 ms
59,536 KB
testcase_26 AC 247 ms
45,036 KB
testcase_27 AC 313 ms
53,416 KB
testcase_28 AC 298 ms
50,536 KB
testcase_29 AC 289 ms
52,480 KB
testcase_30 AC 145 ms
23,936 KB
testcase_31 AC 152 ms
20,096 KB
testcase_32 AC 109 ms
23,820 KB
testcase_33 AC 126 ms
23,544 KB
testcase_34 AC 288 ms
46,304 KB
testcase_35 AC 28 ms
5,888 KB
testcase_36 AC 279 ms
49,204 KB
testcase_37 AC 248 ms
38,956 KB
testcase_38 AC 63 ms
11,456 KB
testcase_39 AC 129 ms
26,324 KB
testcase_40 AC 123 ms
17,536 KB
testcase_41 AC 213 ms
28,836 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 374 ms
61,108 KB
testcase_46 AC 356 ms
61,252 KB
testcase_47 AC 332 ms
61,236 KB
testcase_48 AC 338 ms
61,236 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

pub struct ProconReader<R: std::io::Read> {
    reader: R,
}

impl<R: std::io::Read> ProconReader<R> {
    pub fn new(reader: R) -> Self {
        Self { reader }
    }
    pub fn get<T: std::str::FromStr>(&mut self) -> T {
        use std::io::Read;
        let buf = self
            .reader
            .by_ref()
            .bytes()
            .map(|b| b.unwrap())
            .skip_while(|&byte| byte == b' ' || byte == b'\n' || byte == b'\r')
            .take_while(|&byte| byte != b' ' && byte != b'\n' && byte != b'\r')
            .collect::<Vec<_>>();
        std::str::from_utf8(&buf)
            .unwrap()
            .parse()
            .ok()
            .expect("Parse Error.")
    }
}

#[allow(dead_code)]
mod mint {
    use std::ops::{Add, BitAnd, Div, Mul, Rem, Shr, Sub};

    #[derive(Copy, Clone)]
    pub struct Mint<T> {
        x: T,
        mo: T,
    }
    impl<T> Mint<T>
    where
        T: Copy,
    {
        pub fn new(x: T, mo: T) -> Mint<T> {
            Mint { x, mo }
        }
    }
    impl<T> Mint<T>
    where
        T: Copy,
    {
        pub fn val(&self) -> T {
            self.x
        }
        pub fn mo(&self) -> T {
            self.mo
        }
    }
    impl<T> Add<T> for Mint<T>
    where
        T: Copy,
        T: Add<Output = T>,
        T: Rem<Output = T>,
    {
        type Output = Mint<T>;
        fn add(self, rhs: T) -> Mint<T> {
            Mint::new((self.val() + rhs % self.mo()) % self.mo(), self.mo())
        }
    }
    impl<T> Add<Mint<T>> for Mint<T>
    where
        T: Copy,
        Mint<T>: Add<T, Output = Mint<T>>,
    {
        type Output = Mint<T>;
        fn add(self, rhs: Mint<T>) -> Mint<T> {
            self + rhs.val()
        }
    }
    impl<T> Sub<T> for Mint<T>
    where
        T: Copy,
        T: Add<Output = T>,
        T: Sub<Output = T>,
        T: Rem<Output = T>,
    {
        type Output = Mint<T>;
        fn sub(self, rhs: T) -> Mint<T> {
            Mint::new(
                (self.val() + self.mo() - rhs % self.mo()) % self.mo(),
                self.mo(),
            )
        }
    }
    impl<T> Sub<Mint<T>> for Mint<T>
    where
        T: Copy,
        Mint<T>: Sub<T, Output = Mint<T>>,
    {
        type Output = Mint<T>;
        fn sub(self, rhs: Mint<T>) -> Mint<T> {
            self - rhs.val()
        }
    }
    impl<T> Mul<T> for Mint<T>
    where
        T: Copy,
        T: Mul<Output = T>,
        T: Rem<Output = T>,
    {
        type Output = Mint<T>;
        fn mul(self, rhs: T) -> Mint<T> {
            Mint::new((self.val() * rhs % self.mo()) % self.mo(), self.mo())
        }
    }
    impl<T> Mul<Mint<T>> for Mint<T>
    where
        T: Copy,
        Mint<T>: Mul<T, Output = Mint<T>>,
    {
        type Output = Mint<T>;
        fn mul(self, rhs: Mint<T>) -> Mint<T> {
            self * rhs.val()
        }
    }

    impl<T> Mint<T>
    where
        T: Copy,
        T: Sub<Output = T>,
        T: Div<Output = T>,
        T: PartialOrd,
        T: PartialEq,
        T: BitAnd<Output = T>,
        T: Shr<Output = T>,
        Mint<T>: Mul<Output = Mint<T>>,
    {
        pub fn pow(self, y: T) -> Mint<T> {
            let one = self.mo() / self.mo();
            let zero = self.mo() - self.mo();
            let mut res = Mint::one(self.mo());
            let mut base = self;
            let mut exp = y;
            while exp > zero {
                if (exp & one) == one {
                    res = res * base;
                }
                base = base * base;
                exp = exp >> one;
            }
            res
        }
    }
    impl<T> Div<T> for Mint<T>
    where
        T: Copy,
        T: Sub<Output = T>,
        T: Div<Output = T>,
        T: PartialOrd,
        T: PartialEq,
        T: BitAnd<Output = T>,
        T: Shr<Output = T>,
        Mint<T>: Mul<Output = Mint<T>>,
    {
        type Output = Mint<T>;
        fn div(self, rhs: T) -> Mint<T> {
            let one = self.mo() / self.mo();
            self * Mint::new(rhs, self.mo()).pow(self.mo() - one - one)
        }
    }
    impl<T> Div<Mint<T>> for Mint<T>
    where
        T: Copy,
        Mint<T>: Div<T, Output = Mint<T>>,
    {
        type Output = Mint<T>;
        fn div(self, rhs: Mint<T>) -> Mint<T> {
            self / rhs.val()
        }
    }
    impl<T> Mint<T>
    where
        T: Copy,
        T: Div<Output = T>,
        Mint<T>: Div<Output = Mint<T>>,
    {
        pub fn inv(self) -> Mint<T> {
            Mint::one(self.mo()) / self
        }
    }
    impl<T> std::fmt::Display for Mint<T>
    where
        T: Copy + std::fmt::Display,
    {
        fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result {
            write!(f, "{}", self.val())
        }
    }
    impl<T> Mint<T>
    where
        T: Copy,
        T: Sub<Output = T>,
    {
        pub fn zero(mo: T) -> Mint<T> {
            Mint { x: mo - mo, mo }
        }
    }
    impl<T> Mint<T>
    where
        T: Copy,
        T: Div<Output = T>,
    {
        pub fn one(mo: T) -> Mint<T> {
            Mint { x: mo / mo, mo }
        }
    }
}

use mint::Mint;

pub struct UnionFind {
    par: Vec<usize>,
    size: Vec<usize>,
}

impl UnionFind {
    pub fn new(n: usize) -> UnionFind {
        UnionFind {
            par: (0..n).map(|i| i).collect::<Vec<_>>(),
            size: vec![1; n],
        }
    }
    pub fn find(&mut self, i: usize) -> usize {
        if self.par[i] == i {
            self.par[i]
        } else {
            self.par[i] = self.find(self.par[i]);
            self.par[i]
        }
    }
    pub fn unite(&mut self, i: usize, j: usize) {
        let i = self.find(i);
        let j = self.find(j);
        if i == j {
            return;
        }
        let (i, j) = if self.size[i] >= self.size[j] {
            (i, j)
        } else {
            (j, i)
        };
        self.par[j] = i;
        self.size[i] += self.size[j];
    }
    pub fn same(&mut self, i: usize, j: usize) -> bool {
        self.find(i) == self.find(j)
    }
    pub fn get_size(&mut self, i: usize) -> usize {
        let p = self.find(i);
        self.size[p]
    }
}

#[derive(Debug, Clone)]
struct Edge {
    to: usize,
    cost: i64,
}

fn minimum_spanning_tree(g: &Vec<Vec<Edge>>) -> Option<Vec<Vec<Edge>>> {
    let n = g.len();
    let mut edges = vec![];
    for i in 0..n {
        for e in &g[i] {
            edges.push((e.cost, i, e.to));
        }
    }
    edges.sort();
    let mut result = vec![vec![]; n];
    let mut uf = UnionFind::new(n);
    let mut count = 0;
    for e in edges {
        let (c, from, to) = e;
        if !uf.same(from, to) {
            uf.unite(from, to);
            count += 1;
            result[from].push(Edge { to: to, cost: c });
            result[to].push(Edge { to: from, cost: c });
        }
    }
    if count == n - 1 {
        Some(result)
    } else {
        assert!(count < n - 1);
        None
    }
}

fn dfs(g: &Vec<Vec<Edge>>, i: usize, p: usize, size: &mut Vec<usize>) {
    size[i] = 1;
    for e in &g[i] {
        if e.to != p {
            dfs(g, e.to, i, size);
            size[i] += size[e.to];
        }
    }
}

fn main() {
    let stdin = std::io::stdin();
    let mut rd = ProconReader::new(stdin.lock());

    let n: usize = rd.get();
    let m: usize = rd.get();
    let x: usize = rd.get();
    let mut g = vec![vec![]; n];
    for _ in 0..m {
        let u: usize = rd.get();
        let v: usize = rd.get();
        let w: i64 = rd.get();
        g[u - 1].push(Edge { to: v - 1, cost: w });
        g[v - 1].push(Edge { to: u - 1, cost: w });
    }
    let h = minimum_spanning_tree(&g).unwrap();
    let mut size = vec![0; n];
    dfs(&h, 0, !0, &mut size);
    let mo = 1_000_000_000 + 7;
    let mut ans = Mint::zero(mo);
    for i in 0..n {
        for e in &h[i] {
            if size[e.to] < size[i] {
                ans = ans
                    + Mint::new(size[e.to] * (n - size[e.to]), mo)
                        * Mint::new(x, mo).pow(e.cost as usize);
            }
        }
    }
    println!("{}", ans);
}
0