結果
| 問題 |
No.1054 Union add query
|
| コンテスト | |
| ユーザー |
|
| 提出日時 | 2020-05-16 14:34:55 |
| 言語 | Rust (1.83.0 + proconio) |
| 結果 |
AC
|
| 実行時間 | 482 ms / 2,000 ms |
| コード長 | 4,226 bytes |
| コンパイル時間 | 13,737 ms |
| コンパイル使用メモリ | 400,436 KB |
| 実行使用メモリ | 9,736 KB |
| 最終ジャッジ日時 | 2024-09-22 08:26:21 |
| 合計ジャッジ時間 | 16,614 ms |
|
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 8 |
ソースコード
#![allow(non_snake_case)]
#![allow(dead_code)]
#![allow(unused_macros)]
#![allow(unused_imports)]
use std::str::FromStr;
use std::io::*;
use std::collections::*;
use std::cmp::*;
struct Scanner<I: Iterator<Item = char>> {
iter: std::iter::Peekable<I>,
}
macro_rules! exit {
() => {{
exit!(0)
}};
($code:expr) => {{
if cfg!(local) {
writeln!(std::io::stderr(), "===== Terminated =====")
.expect("failed printing to stderr");
}
std::process::exit($code);
}}
}
impl<I: Iterator<Item = char>> Scanner<I> {
pub fn new(iter: I) -> Scanner<I> {
Scanner {
iter: iter.peekable(),
}
}
pub fn safe_get_token(&mut self) -> Option<String> {
let token = self.iter
.by_ref()
.skip_while(|c| c.is_whitespace())
.take_while(|c| !c.is_whitespace())
.collect::<String>();
if token.is_empty() {
None
} else {
Some(token)
}
}
pub fn token(&mut self) -> String {
self.safe_get_token().unwrap_or_else(|| exit!())
}
pub fn get<T: FromStr>(&mut self) -> T {
self.token().parse::<T>().unwrap_or_else(|_| exit!())
}
pub fn vec<T: FromStr>(&mut self, len: usize) -> Vec<T> {
(0..len).map(|_| self.get()).collect()
}
pub fn mat<T: FromStr>(&mut self, row: usize, col: usize) -> Vec<Vec<T>> {
(0..row).map(|_| self.vec(col)).collect()
}
pub fn char(&mut self) -> char {
self.iter.next().unwrap_or_else(|| exit!())
}
pub fn chars(&mut self) -> Vec<char> {
self.get::<String>().chars().collect()
}
pub fn mat_chars(&mut self, row: usize) -> Vec<Vec<char>> {
(0..row).map(|_| self.chars()).collect()
}
pub fn line(&mut self) -> String {
if self.peek().is_some() {
self.iter
.by_ref()
.take_while(|&c| !(c == '\n' || c == '\r'))
.collect::<String>()
} else {
exit!();
}
}
pub fn peek(&mut self) -> Option<&char> {
self.iter.peek()
}
}
use std::mem::swap;
struct UnionFind {
parents: Vec<i64>,
val: Vec<i64>,
}
impl UnionFind {
fn new(n: usize) -> Self {
UnionFind {
parents: vec![-1; n],
val: vec![0; n],
}
}
fn unite(&mut self, x: usize, y: usize) {
let mut px = self.root(x);
let mut py = self.root(y);
if px == py {
return;
}
if -self.parents[px] < -self.parents[py] {
swap(&mut px, &mut py);
}
self.parents[px] += self.parents[py];
self.parents[py] = px as i64;
self.val[py] -= self.val[px];
}
fn root(&mut self, x: usize) -> usize {
let px = self.parents[x];
if px < 0 {
return x;
}
self.root(px as usize)
}
fn add(&mut self, x: usize, v: i64) {
let rx = self.root(x);
self.val[rx] += v;
}
fn query(&self, x: usize) -> i64 {
let mut ret = 0;
let mut cur = x as i64;
while self.parents[cur as usize] >= 0 {
ret += self.val[cur as usize];
cur = self.parents[cur as usize];
}
ret += self.val[cur as usize];
ret
}
}
fn main() {
let cin = stdin();
let cin = cin.lock();
let mut sc = Scanner::new(cin.bytes().map(|c| c.unwrap() as char));
let N: usize = sc.get();
let Q: usize = sc.get();
let mut uf = UnionFind::new(N);
for _ in 0..Q {
let T: usize = sc.get();
match T {
1 => {
let A: usize = sc.get::<usize>()-1;
let B: usize = sc.get::<usize>()-1;
uf.unite(A, B);
},
2 => {
let A: usize = sc.get::<usize>()-1;
let B: i64 = sc.get();
uf.add(A, B);
},
3 => {
let A: usize = sc.get::<usize>()-1;
let _: usize = sc.get();
println!("{}", uf.query(A))
}
_ => panic!("error"),
}
}
}