結果
問題 | No.1293 2種類の道路 |
ユーザー |
|
提出日時 | 2021-02-17 20:10:12 |
言語 | Rust (1.83.0 + proconio) |
結果 |
AC
|
実行時間 | 31 ms / 2,000 ms |
コード長 | 8,824 bytes |
コンパイル時間 | 15,114 ms |
コンパイル使用メモリ | 379,264 KB |
実行使用メモリ | 13,440 KB |
最終ジャッジ日時 | 2024-09-14 05:41:41 |
合計ジャッジ時間 | 15,666 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 22 |
ソースコード
fn main() {let mut io = IO::new();input!{ from io,n: usize, d: usize, w: usize,car: [(Usize1, Usize1); d],walk: [(Usize1, Usize1); w],}let mut ufc = UnionFind::new(n);let mut ufw = UnionFind::new(n);for &(u, v) in &car {ufc.unite(u, v).ok();}for &(u, v) in &walk {ufw.unite(u, v).ok();}let mut town = vec![Vec::new(); n];for i in 0..n {town[ufc.find(i)].push(ufw.find(i));}let mut ans = 0;for i in 0..n {town[i].sort();town[i].dedup();let cur = town[i].iter().map(|&j| ufw.size(j)).sum::<usize>();ans += cur * ufc.size(i);}io.println(ans - n);}// ------------ UnionFind start ------------#[derive(Clone, Debug)]pub struct UnionFind(Vec<isize>);impl UnionFind {pub fn new(len: usize) -> Self {Self(vec![-1; len])}pub fn find(&mut self, i: usize) -> usize {self._climb(i).0}pub fn size(&mut self, i: usize) -> usize {self._climb(i).1}pub fn unite(&mut self, u: usize, v: usize) -> Result<(), ()> {let (mut u, su) = self._climb(u);let (mut v, sv) = self._climb(v);if u == v { return Err(()); }if su < sv {std::mem::swap(&mut u, &mut v);}self.0[u] += self.0[v];self.0[v] = u as isize;Ok(())}pub fn is_same(&mut self, u: usize, v:usize) -> bool {self.find(u) == self.find(v)}fn _climb(&mut self, i: usize) -> (usize, usize) {assert!(i < self.0.len());let mut v = i;while self.0[v] >= 0 {let p = self.0[v] as usize;if self.0[p] >= 0 {self.0[v] = self.0[p];v = self.0[p] as usize;} else {v = p;}}(v, -self.0[v] as usize)}}// ------------ UnionFind end ------------// ------------ algebraic traits start ------------use std::marker::Sized;use std::ops::*;/// 元pub trait Element: Sized + Clone + PartialEq {}impl<T: Sized + Clone + PartialEq> Element for T {}/// 結合性pub trait Associative: Magma {}/// マグマpub trait Magma: Element + Add<Output=Self> {}impl<T: Element + Add<Output=Self>> Magma for T {}/// 半群pub trait SemiGroup: Magma + Associative {}impl<T: Magma + Associative> SemiGroup for T {}/// モノイドpub trait Monoid: SemiGroup + Zero {}impl<T: SemiGroup + Zero> Monoid for T {}pub trait ComMonoid: Monoid + AddAssign {}impl<T: Monoid + AddAssign> ComMonoid for T {}/// 群pub trait Group: Monoid + Neg<Output=Self> {}impl<T: Monoid + Neg<Output=Self>> Group for T {}pub trait ComGroup: Group + ComMonoid {}impl<T: Group + ComMonoid> ComGroup for T {}/// 半環pub trait SemiRing: ComMonoid + Mul<Output=Self> + One {}impl<T: ComMonoid + Mul<Output=Self> + One> SemiRing for T {}/// 環pub trait Ring: ComGroup + SemiRing {}impl<T: ComGroup + SemiRing> Ring for T {}pub trait ComRing: Ring + MulAssign {}impl<T: Ring + MulAssign> ComRing for T {}/// 体pub trait Field: ComRing + Div<Output=Self> + DivAssign {}impl<T: ComRing + Div<Output=Self> + DivAssign> Field for T {}/// 加法単元pub trait Zero: Element {fn zero() -> Self;fn is_zero(&self) -> bool {*self == Self::zero()}}/// 乗法単元pub trait One: Element {fn one() -> Self;fn is_one(&self) -> bool {*self == Self::one()}}macro_rules! impl_integer {($($T:ty,)*) => {$(impl Associative for $T {}impl Zero for $T {fn zero() -> Self { 0 }fn is_zero(&self) -> bool { *self == 0 }}impl<'a> Zero for &'a $T {fn zero() -> Self { &0 }fn is_zero(&self) -> bool { *self == &0 }}impl One for $T {fn one() -> Self { 1 }fn is_one(&self) -> bool { *self == 1 }}impl<'a> One for &'a $T {fn one() -> Self { &1 }fn is_one(&self) -> bool { *self == &1 }})*};}impl_integer! {i8, i16, i32, i64, i128, isize,u8, u16, u32, u64, u128, usize,}// ------------ algebraic traits end ------------// ------------ io module start ------------use std::io::{stdout, BufWriter, Read, StdoutLock, Write};pub struct IO {iter: std::str::SplitAsciiWhitespace<'static>,buf: BufWriter<StdoutLock<'static>>,}impl IO {pub fn new() -> Self {let mut input = String::new();std::io::stdin().read_to_string(&mut input).unwrap();let input = Box::leak(input.into_boxed_str());let out = Box::new(stdout());IO {iter: input.split_ascii_whitespace(),buf: BufWriter::new(Box::leak(out).lock()),}}fn scan_str(&mut self) -> &'static str {self.iter.next().unwrap()}pub fn scan<T: Scan>(&mut self) -> <T as Scan>::Output {<T as Scan>::scan(self)}pub fn scan_vec<T: Scan>(&mut self, n: usize) -> Vec<<T as Scan>::Output> {(0..n).map(|_| self.scan::<T>()).collect()}pub fn print<T: Print>(&mut self, x: T) {<T as Print>::print(self, x);}pub fn println<T: Print>(&mut self, x: T) {self.print(x);self.print("\n");}pub fn iterln<T: Print, I: Iterator<Item = T>>(&mut self, mut iter: I, delim: &str) {if let Some(v) = iter.next() {self.print(v);for v in iter {self.print(delim);self.print(v);}}self.print("\n");}pub fn flush(&mut self) {self.buf.flush().unwrap();}}impl Default for IO {fn default() -> Self {Self::new()}}pub trait Scan {type Output;fn scan(io: &mut IO) -> Self::Output;}macro_rules! impl_scan {($($t:tt),*) => {$(impl Scan for $t {type Output = Self;fn scan(s: &mut IO) -> Self::Output {s.scan_str().parse().unwrap()}})*};}impl_scan!(i16, i32, i64, isize, u16, u32, u64, usize, String);pub enum Bytes {}impl Scan for Bytes {type Output = &'static [u8];fn scan(s: &mut IO) -> Self::Output {s.scan_str().as_bytes()}}pub enum Chars {}impl Scan for Chars {type Output = Vec<char>;fn scan(s: &mut IO) -> Self::Output {s.scan_str().chars().collect()}}pub enum Usize1 {}impl Scan for Usize1 {type Output = usize;fn scan(s: &mut IO) -> Self::Output {s.scan::<usize>().wrapping_sub(1)}}impl<T: Scan, U: Scan> Scan for (T, U) {type Output = (T::Output, U::Output);fn scan(s: &mut IO) -> Self::Output {(T::scan(s), U::scan(s))}}impl<T: Scan, U: Scan, V: Scan> Scan for (T, U, V) {type Output = (T::Output, U::Output, V::Output);fn scan(s: &mut IO) -> Self::Output {(T::scan(s), U::scan(s), V::scan(s))}}impl<T: Scan, U: Scan, V: Scan, W: Scan> Scan for (T, U, V, W) {type Output = (T::Output, U::Output, V::Output, W::Output);fn scan(s: &mut IO) -> Self::Output {(T::scan(s), U::scan(s), V::scan(s), W::scan(s))}}pub trait Print {fn print(w: &mut IO, x: Self);}macro_rules! impl_print_int {($($t:ty),*) => {$(impl Print for $t {fn print(w: &mut IO, x: Self) {w.buf.write_all(x.to_string().as_bytes()).unwrap();}})*};}impl_print_int!(i16, i32, i64, isize, u16, u32, u64, usize);impl Print for u8 {fn print(w: &mut IO, x: Self) {w.buf.write_all(&[x]).unwrap();}}impl Print for &[u8] {fn print(w: &mut IO, x: Self) {w.buf.write_all(x).unwrap();}}impl Print for &str {fn print(w: &mut IO, x: Self) {w.print(x.as_bytes());}}impl Print for String {fn print(w: &mut IO, x: Self) {w.print(x.as_bytes());}}impl<T: Print, U: Print> Print for (T, U) {fn print(w: &mut IO, (x, y): Self) {w.print(x);w.print(" ");w.print(y);}}impl<T: Print, U: Print, V: Print> Print for (T, U, V) {fn print(w: &mut IO, (x, y, z): Self) {w.print(x);w.print(" ");w.print(y);w.print(" ");w.print(z);}}mod neboccoio_macro {#[macro_export]macro_rules! input {(@start $io:tt @read @rest) => {};(@start $io:tt @read @rest, $($rest: tt)*) => {input!(@start $io @read @rest $($rest)*)};(@start $io:tt @read @rest mut $($rest:tt)*) => {input!(@start $io @read @mut [mut] @rest $($rest)*)};(@start $io:tt @read @rest $($rest:tt)*) => {input!(@start $io @read @mut [] @rest $($rest)*)};(@start $io:tt @read @mut [$($mut:tt)?] @rest $var:tt: [$kind:tt; $len:tt] $($rest:tt)*) => {let $($mut)* $var = $io.scan_vec::<$kind>($len);input!(@start $io @read @rest $($rest)*)};(@start $io:tt @read @mut [$($mut:tt)?] @rest $var:tt: $kind:tt $($rest:tt)*) => {let $($mut)* $var = $io.scan::<$kind>();input!(@start $io @read @rest $($rest)*)};(from $io:tt $($rest:tt)*) => {input!(@start $io @read @rest $($rest)*)};}}// ------------ io module end ------------