結果
問題 | No.1054 Union add query |
ユーザー | cotton_fn_ |
提出日時 | 2020-05-15 23:20:56 |
言語 | Rust (1.77.0 + proconio) |
結果 |
AC
|
実行時間 | 323 ms / 2,000 ms |
コード長 | 6,031 bytes |
コンパイル時間 | 14,112 ms |
コンパイル使用メモリ | 378,756 KB |
実行使用メモリ | 42,752 KB |
最終ジャッジ日時 | 2024-09-19 13:32:12 |
合計ジャッジ時間 | 14,793 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,120 KB |
testcase_01 | AC | 1 ms
5,248 KB |
testcase_02 | AC | 1 ms
5,376 KB |
testcase_03 | AC | 127 ms
11,096 KB |
testcase_04 | AC | 323 ms
42,752 KB |
testcase_05 | AC | 95 ms
6,656 KB |
testcase_06 | AC | 95 ms
17,480 KB |
testcase_07 | AC | 84 ms
17,480 KB |
testcase_08 | AC | 92 ms
17,536 KB |
testcase_09 | AC | 146 ms
36,992 KB |
testcase_10 | AC | 89 ms
33,184 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, q): (usize, usize) = kin.input(); let mut uf = UnionFind::new(n + 1); let mut mem: Vec<_> = (0..=n).map(|i| vec![i]).collect(); let mut val_r = vec![0; n + 1]; let mut val_c = vec![0; n + 1]; for _ in 0..q { let (t, a, b): (char, usize, isize) = kin.input(); match t { '1' => { let b = b as usize; let mut ra = uf.root(a); let mut rb = uf.root(b); if ra == rb { continue; } if uf.size(ra) < uf.size(rb) { swap(&mut ra, &mut rb); } for &u in &mem[rb] { val_c[u] += val_r[rb] - val_r[ra]; } val_r[rb] = 0; let mut vb = std::mem::take(&mut mem[rb]); mem[ra].append(&mut vb); uf.unite(ra, rb); } '2' => { val_r[uf.root(a)] += b as i64; } '3' => { outputln!("{}", val_r[uf.root(a)] + val_c[a]); } _ => {} } } } 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, } } pub fn src(&mut self) -> &mut R { &mut self.src } } 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),*) } } } }