結果
問題 | No.1207 グラフX |
ユーザー | koba-e964 |
提出日時 | 2020-08-30 13:41:33 |
言語 | Rust (1.77.0) |
結果 |
AC
|
実行時間 | 269 ms / 2,000 ms |
コード長 | 8,040 bytes |
コンパイル時間 | 2,322 ms |
コンパイル使用メモリ | 160,616 KB |
実行使用メモリ | 47,972 KB |
最終ジャッジ日時 | 2023-08-09 11:57:19 |
合計ジャッジ時間 | 13,409 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 242 ms
32,212 KB |
testcase_01 | AC | 242 ms
32,304 KB |
testcase_02 | AC | 240 ms
32,280 KB |
testcase_03 | AC | 243 ms
32,288 KB |
testcase_04 | AC | 244 ms
32,212 KB |
testcase_05 | AC | 269 ms
47,936 KB |
testcase_06 | AC | 263 ms
47,776 KB |
testcase_07 | AC | 261 ms
47,972 KB |
testcase_08 | AC | 182 ms
20,764 KB |
testcase_09 | AC | 203 ms
25,372 KB |
testcase_10 | AC | 263 ms
39,324 KB |
testcase_11 | AC | 263 ms
47,888 KB |
testcase_12 | AC | 185 ms
22,100 KB |
testcase_13 | AC | 102 ms
8,692 KB |
testcase_14 | AC | 239 ms
30,824 KB |
testcase_15 | AC | 202 ms
24,556 KB |
testcase_16 | AC | 103 ms
9,628 KB |
testcase_17 | AC | 159 ms
18,624 KB |
testcase_18 | AC | 126 ms
18,616 KB |
testcase_19 | AC | 140 ms
14,296 KB |
testcase_20 | AC | 234 ms
31,620 KB |
testcase_21 | AC | 18 ms
4,384 KB |
testcase_22 | AC | 152 ms
19,108 KB |
testcase_23 | AC | 165 ms
21,900 KB |
testcase_24 | AC | 115 ms
16,508 KB |
testcase_25 | AC | 236 ms
31,232 KB |
testcase_26 | AC | 175 ms
23,612 KB |
testcase_27 | AC | 218 ms
28,064 KB |
testcase_28 | AC | 199 ms
25,676 KB |
testcase_29 | AC | 197 ms
27,616 KB |
testcase_30 | AC | 98 ms
12,100 KB |
testcase_31 | AC | 88 ms
7,132 KB |
testcase_32 | AC | 83 ms
12,452 KB |
testcase_33 | AC | 91 ms
12,272 KB |
testcase_34 | AC | 195 ms
24,228 KB |
testcase_35 | AC | 18 ms
4,380 KB |
testcase_36 | AC | 195 ms
24,988 KB |
testcase_37 | AC | 168 ms
20,236 KB |
testcase_38 | AC | 41 ms
5,888 KB |
testcase_39 | AC | 95 ms
13,384 KB |
testcase_40 | AC | 69 ms
4,940 KB |
testcase_41 | AC | 134 ms
14,128 KB |
testcase_42 | AC | 1 ms
4,388 KB |
testcase_43 | AC | 1 ms
4,380 KB |
testcase_44 | AC | 1 ms
4,384 KB |
testcase_45 | AC | 226 ms
32,212 KB |
testcase_46 | AC | 217 ms
32,260 KB |
testcase_47 | AC | 222 ms
32,204 KB |
testcase_48 | AC | 220 ms
32,288 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(); }