aizu_online_judge/grl/
grl_2_a.rs

1#[doc(no_inline)]
2pub use competitive::graph::EdgeListGraphScanner;
3use competitive::prelude::*;
4
5#[verify::aizu_online_judge("GRL_2_A")]
6pub fn grl_2_a(reader: impl Read, mut writer: impl Write) {
7    let s = read_all_unchecked(reader);
8    let mut scanner = Scanner::new(&s);
9    scan!(scanner, vs, es, (graph, w): @EdgeListGraphScanner::<usize, u64>::new(vs, es));
10    let span = graph.minimum_spanning_tree(|&eid| w[eid]);
11    let ans = (0..es).map(|eid| w[eid] * span[eid] as u64).sum::<u64>();
12    writeln!(writer, "{}", ans).ok();
13}