結果

問題 No.1293 2種類の道路
ユーザー cotton_fn_cotton_fn_
提出日時 2020-11-20 21:48:36
言語 Rust
(1.77.0)
結果
AC  
実行時間 87 ms / 2,000 ms
コード長 8,757 bytes
コンパイル時間 1,846 ms
コンパイル使用メモリ 175,144 KB
実行使用メモリ 15,636 KB
最終ジャッジ日時 2023-09-30 19:07:09
合計ジャッジ時間 4,039 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 2 ms
4,376 KB
testcase_03 AC 1 ms
4,384 KB
testcase_04 AC 1 ms
4,380 KB
testcase_05 AC 1 ms
4,376 KB
testcase_06 AC 1 ms
4,376 KB
testcase_07 AC 1 ms
4,380 KB
testcase_08 AC 1 ms
4,380 KB
testcase_09 AC 83 ms
13,928 KB
testcase_10 AC 82 ms
14,012 KB
testcase_11 AC 87 ms
13,928 KB
testcase_12 AC 84 ms
13,996 KB
testcase_13 AC 83 ms
13,920 KB
testcase_14 AC 32 ms
13,472 KB
testcase_15 AC 31 ms
13,596 KB
testcase_16 AC 63 ms
14,196 KB
testcase_17 AC 48 ms
14,196 KB
testcase_18 AC 44 ms
14,184 KB
testcase_19 AC 87 ms
15,636 KB
testcase_20 AC 86 ms
15,620 KB
testcase_21 AC 12 ms
4,376 KB
testcase_22 AC 11 ms
4,380 KB
testcase_23 AC 7 ms
4,380 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#![allow(unused_imports, unused_macros)]

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

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, d, w): (usize, usize, usize) = kin.input();
    let mut dd = Dsu::new(n + 1);
    for (u, v) in kin.iter::<(usize, usize)>().take(d) {
        dd.unite(u, v);
    }
    let mut dw: DsuWithData<HashSet<_>> = (0..=n).map(|u| iter::once(dd.root(u)).collect()).collect();
    for (u, v) in kin.iter::<(usize, usize)>().take(w) {
        dw.unite(u, v, |s, t| s.extend(t.into_iter()));
    }
    let mut ans = 0;
    for u in 1..=n {
        if u == dw.root(u) {
            for &v in dw[u].iter() {
                ans += dw.size(u) * dd.size(v);
            }
        }
    }
    ans -= n;
    outputln!("{}", ans);
}

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

use std::mem::ManuallyDrop;
pub struct DsuWithData<T> {
    inner: Dsu,
    data: Vec<ManuallyDrop<T>>,
}
impl<T> DsuWithData<T> {
    pub fn unite<F>(&mut self, u: usize, v: usize, mut merge: F) -> (usize, usize)
    where
        F: FnMut(&mut T, T),
    {
        let (r, c) = self.inner.unite(u, v);
        if r != c {
            unsafe {
                let dc = ManuallyDrop::take(&mut self.data[c]);
                merge(&mut self.data[r], dc);
            }
        }
        (r, c)
    }
    pub fn root(&self, u: usize) -> usize {
        self.inner.root(u)
    }
    pub fn is_same(&self, u: usize, v: usize) -> bool {
        self.inner.is_same(u, v)
    }
    pub fn size(&self, u: usize) -> usize {
        self.inner.size(u)
    }
}
impl<T> std::iter::FromIterator<T> for DsuWithData<T> {
    fn from_iter<I: IntoIterator<Item = T>>(iter: I) -> Self {
        let data: Vec<_> = iter.into_iter().map(|v| ManuallyDrop::new(v)).collect();
        Self {
            inner: Dsu::new(data.len()),
            data,
        }
    }
}
impl<T> std::ops::Index<usize> for DsuWithData<T> {
    type Output = T;
    fn index(&self, u: usize) -> &T {
        &self.data[self.root(u)]
    }
}
impl<T> Drop for DsuWithData<T> {
    fn drop(&mut self) {
        for (p, d) in self.inner.0.iter().zip(self.data.drain(..)) {
            if *p < 0 {
                ManuallyDrop::into_inner(d);
            }
        }
    }
}


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

// -----------------------------------------------------------------------------
pub mod kyoproio {
    use std::{io::prelude::*, mem};
    pub trait Input {
        fn bytes(&mut self) -> &[u8];
        fn str(&mut self) -> &str {
            std::str::from_utf8(self.bytes()).unwrap()
        }
        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: Vec<u8>,
        pos: usize,
        len: usize,
    }
    impl<R: Read> KInput<R> {
        pub fn new(src: R) -> Self {
            Self {
                src,
                buf: vec![0; 1 << 16],
                pos: 0,
                len: 0,
            }
        }
    }
    impl<R: Read> Input for KInput<R> {
        fn bytes(&mut self) -> &[u8] {
            loop {
                while let Some(delim) = self.buf[self.pos..self.len]
                    .iter()
                    .position(|b| b.is_ascii_whitespace())
                {
                    let p = self.pos;
                    self.pos += delim + 1;
                    if delim > 0 {
                        return &self.buf[p..p + delim];
                    }
                }
                if self.read() == 0 {
                    return &self.buf[mem::replace(&mut self.pos, self.len)..self.len];
                }
            }
        }
    }
    impl<R: Read> KInput<R> {
        fn read(&mut self) -> usize {
            if self.pos > 0 {
                self.buf.copy_within(self.pos..self.len, 0);
                self.len -= self.pos;
                self.pos = 0;
            } else if self.len >= self.buf.len() {
                self.buf.resize(2 * self.buf.len(), 0);
            }
            let read = self.src.read(&mut self.buf[self.len..]).unwrap();
            self.len += read;
            read
        }
    }
    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())
        }
        fn size_hint(&self) -> (usize, Option<usize>) {
            (!0, None)
        }
    }
    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.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>().unwrap()
                }
            })*
        }
    }
    from_str_impl! { String char bool f32 f64 }
    macro_rules! parse_int_impl {
        { $($I:ty: $U:ty)* } => {
            $(impl InputParse for $I {
                fn input<I: Input + ?Sized>(src: &mut I) -> Self {
                    let f = |s: &[u8]| s.iter().fold(0, |x, b| 10 * x + (b & 0xf) as $I);
                    let s = src.bytes();
                    if let Some((&b'-', t)) = s.split_first() { -f(t) } else { f(s) }
                }
            }
            impl InputParse for $U {
                fn input<I: Input + ?Sized>(src: &mut I) -> Self {
                    src.bytes().iter().fold(0, |x, b| 10 * x + (b & 0xf) as $U)
                }
            })*
        };
    }
    parse_int_impl! { isize:usize i8:u8 i16:u16 i32:u32 i64:u64 i128: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_rules! array_impl {
        { $($N:literal)* } => {
            $(impl<T: InputParse> InputParse for [T; $N] {
                fn input<I: Input + ?Sized>(src: &mut I) -> Self {
                    let mut arr = mem::MaybeUninit::uninit();
                    unsafe {
                        let ptr = arr.as_mut_ptr() as *mut T;
                        for i in 0..$N {
                            ptr.add(i).write(src.input());
                        }
                        arr.assume_init()
                    }
                }
            })*
        };
    }
    array_impl! { 1 2 3 4 5 6 7 8 }
    #[macro_export]
    macro_rules! kdbg {
        ($($v:expr),*) => {
            if cfg!(debug_assertions) { dbg!($($v),*) } else { ($($v),*) }
        }
    }
}
0