#480968 (Rust) No.748 yuki国のお財布事情

• 問題: No.748 yuki国のお財布事情
• ユーザー: cotton_fn_
• 提出日時: 2020-05-13 02:06:12
• 言語: Rust (1.77.0)
• 結果: AC
• 実行時間: 36 ms / 2,000 ms
• コード長: 5,307 bytes
• コンパイル時間: 2,414 ms
• コンパイル使用メモリ: 161,768 KB
• 実行使用メモリ: 5,148 KB
• 最終ジャッジ日時: 2023-10-12 06:34:41
• 合計ジャッジ時間: 5,437 ms
• ジャッジサーバーID （参考情報）: judge13 / judge12

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 4,348 KB
testcase_01	AC	1 ms; 4,352 KB
testcase_02	AC	1 ms; 4,352 KB
testcase_03	AC	1 ms; 4,348 KB
testcase_04	AC	1 ms; 4,348 KB
testcase_05	AC	1 ms; 4,348 KB
testcase_06	AC	1 ms; 4,348 KB
testcase_07	AC	1 ms; 4,352 KB
testcase_08	AC	1 ms; 4,352 KB
testcase_09	AC	2 ms; 4,352 KB
testcase_10	AC	1 ms; 4,352 KB
testcase_11	AC	1 ms; 4,352 KB
testcase_12	AC	1 ms; 4,348 KB
testcase_13	AC	5 ms; 4,348 KB
testcase_14	AC	8 ms; 4,348 KB
testcase_15	AC	6 ms; 4,348 KB
testcase_16	AC	14 ms; 4,352 KB
testcase_17	AC	29 ms; 4,348 KB
testcase_18	AC	34 ms; 4,856 KB
testcase_19	AC	36 ms; 5,076 KB
testcase_20	AC	32 ms; 4,812 KB
testcase_21	AC	32 ms; 4,812 KB
testcase_22	AC	1 ms; 4,352 KB
testcase_23	AC	1 ms; 4,352 KB
testcase_24	AC	1 ms; 4,352 KB
testcase_25	AC	27 ms; 4,352 KB
testcase_26	AC	31 ms; 5,148 KB
testcase_27	AC	30 ms; 5,080 KB
testcase_28	AC	23 ms; 4,348 KB

ソースコード

#![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(solve)?
        .join()
        .unwrap();
    Ok(())
}

fn solve() {
    let stdin = io::stdin();
    let mut kin = KInput::new(stdin.lock());
    let stdout = io::stdout();
    let mut out = io::BufWriter::new(stdout.lock());
    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, k): (usize, usize, usize) = kin.input();
    let mut es: Vec<(usize, usize, i64)> = kin.seq(m);
    let mut uf = UnionFind::new(n + 1);
    
    let mut ans: i64 = es.iter().map(|&(_, _, c)| c).sum();
    for i in kin.iter::<usize>().take(k) {
        let (u, v, c) = es[i - 1];
        uf.unite(u, v);
        ans -= c;
    }

    es.sort_by_key(|&(_, _, c)| c);
    for &(u, v, c) in &es {
        if uf.unite(u, v) {
            ans -= c;
        }
    }

    outputln!("{}", ans);
}

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)
    }
}

// -----------------------------------------------------------------------------
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(1024),
                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),*)
            }
        }
    }
}