結果

問題 No.1207 グラフX
ユーザー cotton_fn_cotton_fn_
提出日時 2020-10-15 11:00:52
言語 Rust
(1.77.0)
結果
AC  
実行時間 168 ms / 2,000 ms
コード長 6,709 bytes
コンパイル時間 3,298 ms
コンパイル使用メモリ 148,516 KB
実行使用メモリ 38,712 KB
最終ジャッジ日時 2023-09-28 01:08:54
合計ジャッジ時間 14,130 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 119 ms
30,764 KB
testcase_01 AC 128 ms
30,748 KB
testcase_02 AC 125 ms
30,692 KB
testcase_03 AC 126 ms
30,776 KB
testcase_04 AC 126 ms
30,664 KB
testcase_05 AC 152 ms
38,660 KB
testcase_06 AC 158 ms
38,712 KB
testcase_07 AC 168 ms
38,648 KB
testcase_08 AC 83 ms
20,060 KB
testcase_09 AC 104 ms
25,808 KB
testcase_10 AC 156 ms
31,604 KB
testcase_11 AC 160 ms
38,656 KB
testcase_12 AC 93 ms
21,340 KB
testcase_13 AC 41 ms
8,352 KB
testcase_14 AC 119 ms
29,304 KB
testcase_15 AC 101 ms
23,540 KB
testcase_16 AC 41 ms
9,224 KB
testcase_17 AC 72 ms
17,976 KB
testcase_18 AC 61 ms
17,868 KB
testcase_19 AC 61 ms
13,632 KB
testcase_20 AC 114 ms
30,080 KB
testcase_21 AC 7 ms
5,060 KB
testcase_22 AC 72 ms
18,180 KB
testcase_23 AC 79 ms
20,856 KB
testcase_24 AC 55 ms
15,988 KB
testcase_25 AC 113 ms
29,884 KB
testcase_26 AC 86 ms
22,536 KB
testcase_27 AC 105 ms
26,732 KB
testcase_28 AC 96 ms
26,136 KB
testcase_29 AC 107 ms
26,188 KB
testcase_30 AC 45 ms
11,752 KB
testcase_31 AC 34 ms
6,764 KB
testcase_32 AC 41 ms
11,924 KB
testcase_33 AC 43 ms
11,660 KB
testcase_34 AC 93 ms
23,212 KB
testcase_35 AC 7 ms
4,992 KB
testcase_36 AC 95 ms
25,308 KB
testcase_37 AC 79 ms
19,320 KB
testcase_38 AC 19 ms
5,760 KB
testcase_39 AC 46 ms
13,696 KB
testcase_40 AC 23 ms
4,996 KB
testcase_41 AC 58 ms
13,844 KB
testcase_42 AC 1 ms
4,996 KB
testcase_43 AC 1 ms
5,060 KB
testcase_44 AC 1 ms
5,060 KB
testcase_45 AC 115 ms
30,680 KB
testcase_46 AC 118 ms
30,684 KB
testcase_47 AC 114 ms
30,728 KB
testcase_48 AC 113 ms
30,672 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#![allow(unused_imports, unused_macros)]

use kyoproio::*;
use std::{
    collections::*,
    io::{self, prelude::*},
    iter,
    mem::{replace, swap},
};

fn main() -> io::Result<()> {
    std::thread::Builder::new()
        .stack_size(64 * 1024 * 1024)
        .spawn(|| {
            run(
                KInput::new(io::stdin().lock()),
                io::BufWriter::new(io::stdout().lock()),
            )
        })?
        .join()
        .unwrap();
    Ok(())
}

fn run<I: Input, O: Write>(mut kin: I, mut out: O) {
    macro_rules! output { ($($args:expr),+) => { write!(&mut out, $($args),+).unwrap(); }; }
    macro_rules! outputln {
        ($($args:expr),+) => { output!($($args),+); outputln!(); };
        () => { output!("\n"); if cfg!(debug_assertions) { out.flush().unwrap(); } }
    }

    let (n, m, x): (usize, usize, i64) = kin.input();
    let mut es: Vec<(usize, usize, i64)> = kin.seq(m);
    es.sort_by_key(|(_, _, z)| *z);

    let mut uf = UnionFind::new(n + 1);
    let mut g = vec![Vec::new(); n + 1];
    for (u, v, z) in es {
        if !uf.is_same(u, v) {
            uf.unite(u, v);
            g[u].push((v, z));
            g[v].push((u, z));
        }
    }

    X.set(x);
    G.set(g);
    let ans = f(1, 0).1;
    outputln!("{}", ans);
}

const P: i64 = 1e9 as i64 + 7;
static X: OnceInit<i64> = OnceInit::new();
static G: OnceInit<Vec<Vec<(usize, i64)>>> = OnceInit::new();

fn f(u: usize, p: usize) -> (usize, i64) {
    let mut size = 0;
    let mut dist = 0;
    for &(v, z) in &G[u] {
        if v != p {
            let (s, d) = f(v, u);
            size += s;
            let t = G.len() - 1 - s;
            dist = (dist + d + mod_pow(*X, z, P) * s as i64 % P * t as i64) % P;
        }
    }
    (size + 1, dist)
}

pub fn mod_pow(mut a: i64, mut b: i64, m: i64) -> i64 {
    let mut y = 1;
    while b > 0 {
        if b & 1 == 1 {
            y = y * a % m;
        }
        a = a * a % m;
        b >>= 1;
    }
    y
}

pub struct UnionFind {
    p: Vec<isize>,
}
impl UnionFind {
    pub fn new(n: usize) -> Self {
        Self { p: vec![-1; n] }
    }
    pub fn root(&self, mut u: usize) -> usize {
        while self.p[u] >= 0 {
            u = self.p[u] as usize;
        }
        u
    }
    pub fn size(&self, u: usize) -> usize {
        (-self.p[self.root(u)]) as usize
    }
    pub fn unite(&mut self, u: usize, v: usize) -> bool {
        let mut u = self.root(u);
        let mut v = self.root(v);
        if u == v {
            return false;
        }
        if self.p[u] > self.p[v] {
            swap(&mut u, &mut v);
        }
        self.p[u] += self.p[v];
        self.p[v] = u as isize;
        true
    }
    pub fn is_same(&self, u: usize, v: usize) -> bool {
        self.root(u) == self.root(v)
    }
}

use std::{cell::UnsafeCell, sync::Once};
pub struct OnceInit<T> {
    value: UnsafeCell<Option<T>>,
    once: Once,
}
unsafe impl<T> Sync for OnceInit<T> {}
impl<T> OnceInit<T> {
    pub const fn new() -> Self {
        Self {
            value: UnsafeCell::new(None),
            once: Once::new(),
        }
    }
    pub fn set(&self, value: T) {
        self.once.call_once(|| unsafe {
            let v = &mut *self.value.get();
            if v.is_none() {
                *v = Some(value);
            }
        });
    }
    pub fn get(&self) -> Option<&T> {
        unsafe { (*self.value.get()).as_ref() }
    }
}
impl<T> std::ops::Deref for OnceInit<T> {
    type Target = T;
    fn deref(&self) -> &Self::Target {
        self.get().unwrap()
    }
}

// -----------------------------------------------------------------------------
pub mod kyoproio {
    use std::io::prelude::*;
    pub trait Input {
        fn str(&mut self) -> &str;
        fn input<T: InputParse>(&mut self) -> T {
            T::input(self)
        }
        fn iter<T: InputParse>(&mut self) -> Iter<T, Self> {
            Iter(self, std::marker::PhantomData)
        }
        fn seq<T: InputParse, B: std::iter::FromIterator<T>>(&mut self, n: usize) -> B {
            self.iter().take(n).collect()
        }
    }
    pub struct KInput<R> {
        src: R,
        buf: String,
        pos: usize,
    }
    impl<R: BufRead> KInput<R> {
        pub fn new(src: R) -> Self {
            Self {
                src,
                buf: String::with_capacity(1 << 12),
                pos: 0,
            }
        }
    }
    impl<R: BufRead> Input for KInput<R> {
        fn str(&mut self) -> &str {
            loop {
                if self.pos >= self.buf.len() {
                    self.pos = 0;
                    self.buf.clear();
                    if self.src.read_line(&mut self.buf).expect("io error") == 0 {
                        return &self.buf;
                    }
                }
                let range = self.pos
                    ..self.buf[self.pos..]
                        .find(|c: char| c.is_ascii_whitespace())
                        .map(|i| i + self.pos)
                        .unwrap_or_else(|| self.buf.len());
                self.pos = range.end + 1;
                if range.end > range.start {
                    return &self.buf[range];
                }
            }
        }
    }
    pub struct Iter<'a, T, I: ?Sized>(&'a mut I, std::marker::PhantomData<*const T>);
    impl<'a, T: InputParse, I: Input + ?Sized> Iterator for Iter<'a, T, I> {
        type Item = T;
        fn next(&mut self) -> Option<T> {
            Some(self.0.input())
        }
    }
    pub trait InputParse: Sized {
        fn input<I: Input + ?Sized>(src: &mut I) -> Self;
    }
    impl InputParse for Vec<u8> {
        fn input<I: Input + ?Sized>(src: &mut I) -> Self {
            src.str().as_bytes().to_owned()
        }
    }
    macro_rules! from_str_impl {
        { $($T:ty)* } => {
            $(impl InputParse for $T {
                fn input<I: Input + ?Sized>(src: &mut I) -> Self {
                    src.str().parse::<$T>().expect("parse error")
                }
            })*
        }
    }
    from_str_impl! {
        String char bool f32 f64 isize i8 i16 i32 i64 i128 usize u8 u16 u32 u64 u128
    }
    macro_rules! tuple_impl {
        ($H:ident $($T:ident)*) => {
            impl<$H: InputParse, $($T: InputParse),*> InputParse for ($H, $($T),*) {
                fn input<I: Input + ?Sized>(src: &mut I) -> Self {
                    ($H::input(src), $($T::input(src)),*)
                }
            }
            tuple_impl!($($T)*);
        };
        () => {}
    }
    tuple_impl!(A B C D E F G);
    #[macro_export]
    macro_rules! kdbg {
        ($($v:expr),*) => {
            if cfg!(debug_assertions) { dbg!($($v),*) } else { ($($v),*) }
        }
    }
}
0