結果

問題 No.1390 Get together
ユーザー cotton_fn_cotton_fn_
提出日時 2021-02-13 05:57:16
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 24 ms / 2,000 ms
コード長 7,333 bytes
コンパイル時間 17,502 ms
コンパイル使用メモリ 379,204 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-07-20 07:06:37
合計ジャッジ時間 17,147 ms
ジャッジサーバーID
(参考情報)
judge4 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 29
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#![allow(unused_imports, unused_macros)]
use kyoproio::*;
use std::{
collections::*,
io::{self, prelude::*},
iter, mem,
};
fn run<I: Input, O: Write>(mut kin: I, mut out: O) {
let (n, m): (usize, usize) = kin.input();
let mut dsu = Dsu::new(n + m + 1);
for (b, c) in kin.iter::<(usize, usize)>().take(n) {
dsu.unite(b, m + c);
}
let mut ans = m;
for b in 1..=m {
if dsu.is_root(b) {
ans -= 1;
}
}
outln!(out, "{}", 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 is_root(&self, u: usize) -> bool {
self.0[u] < 0
}
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
}
}
// -----------------------------------------------------------------------------
fn main() -> io::Result<()> {
std::thread::Builder::new()
.stack_size(1 << 26)
.spawn(|| {
run(
KInput::new(io::stdin().lock()),
io::BufWriter::new(io::stdout().lock()),
)
})?
.join()
.unwrap();
Ok(())
}
#[macro_export]
macro_rules! out {
($($arg:tt)*) => { write!($($arg)*).unwrap(); }
}
#[macro_export]
macro_rules! outln {
($dst:expr $(, $($arg:tt)*)?) => {{
writeln!($dst $(, $($arg)*)?).unwrap();
if cfg!(debug_assertions) { $dst.flush().unwrap(); }
}}
}
#[macro_export]
macro_rules! eout {
($($arg:tt)*) => { if cfg!(debug_assertions) { eprintln!($($arg)*); } }
}
#[macro_export]
macro_rules! kdbg {
($($v:expr),*) => { if cfg!(debug_assertions) { dbg!($($v),*) } else { ($($v),*) } }
}
pub mod kyoproio {
use std::{
io::prelude::*,
iter::FromIterator,
marker::PhantomData,
mem::{self, MaybeUninit},
str,
};
pub trait Input {
fn bytes(&mut self) -> &[u8];
fn str(&mut self) -> &str {
str::from_utf8(self.bytes()).unwrap()
}
fn input<T: InputItem>(&mut self) -> T {
T::input(self)
}
fn iter<T: InputItem>(&mut self) -> Iter<T, Self> {
Iter(self, PhantomData)
}
fn collect<T: InputItem, B: FromIterator<T>>(&mut self, n: usize) -> B {
self.iter().take(n).collect()
}
fn map<T: InputItem, U, F: FnMut(T) -> U, B: FromIterator<U>>(
&mut self,
n: usize,
f: F,
) -> B {
self.iter().take(n).map(f).collect()
}
}
impl<I: Input> Input for &mut I {
fn bytes(&mut self) -> &[u8] {
(**self).bytes()
}
}
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,
}
}
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 n = self.src.read(&mut self.buf[self.len..]).unwrap();
self.len += n;
n
}
}
impl<R: Read> Input for KInput<R> {
fn bytes(&mut self) -> &[u8] {
loop {
while let Some(d) = self.buf[self.pos..self.len]
.iter()
.position(u8::is_ascii_whitespace)
{
let p = self.pos;
self.pos += d + 1;
if d > 0 {
return &self.buf[p..p + d];
}
}
if self.read() == 0 {
return &self.buf[mem::replace(&mut self.pos, self.len)..self.len];
}
}
}
}
pub struct Iter<'a, T, I: ?Sized>(&'a mut I, PhantomData<*const T>);
impl<'a, T: InputItem, 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 InputItem: Sized {
fn input<I: Input + ?Sized>(src: &mut I) -> Self;
}
impl InputItem for Vec<u8> {
fn input<I: Input + ?Sized>(src: &mut I) -> Self {
src.bytes().to_owned()
}
}
macro_rules! from_str {
($($T:ty)*) => {$(
impl InputItem for $T {
fn input<I: Input + ?Sized>(src: &mut I) -> Self {
src.str().parse::<$T>().unwrap()
}
}
)*}
}
from_str!(String char bool f32 f64);
macro_rules! parse_int {
($($I:ty: $U:ty)*) => {$(
impl InputItem 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 InputItem 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!(isize:usize i8:u8 i16:u16 i32:u32 i64:u64 i128:u128);
macro_rules! tuple {
($H:ident $($T:ident)*) => {
impl<$H: InputItem, $($T: InputItem),*> InputItem for ($H, $($T),*) {
fn input<I: Input + ?Sized>(src: &mut I) -> Self {
($H::input(src), $($T::input(src)),*)
}
}
tuple!($($T)*);
};
() => {}
}
tuple!(A B C D E F G);
macro_rules! array {
($($N:literal)*) => {$(
impl<T: InputItem> InputItem for [T; $N] {
fn input<I: Input + ?Sized>(src: &mut I) -> Self {
unsafe {
let mut arr: [MaybeUninit<T>; $N] = MaybeUninit::uninit().assume_init();
for elem in &mut arr {
*elem = MaybeUninit::new(src.input());
}
mem::transmute_copy(&arr)
}
}
}
)*}
}
array!(1 2 3 4 5 6 7 8);
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0