結果
問題 | No.1390 Get together |
ユーザー | fukafukatani |
提出日時 | 2021-02-12 21:39:09 |
言語 | Rust (1.77.0) |
結果 |
AC
|
実行時間 | 107 ms / 2,000 ms |
コード長 | 2,848 bytes |
コンパイル時間 | 2,724 ms |
コンパイル使用メモリ | 159,800 KB |
実行使用メモリ | 17,204 KB |
最終ジャッジ日時 | 2023-09-27 03:17:57 |
合計ジャッジ時間 | 6,027 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 1 ms
4,376 KB |
testcase_03 | AC | 3 ms
4,376 KB |
testcase_04 | AC | 2 ms
4,380 KB |
testcase_05 | AC | 2 ms
4,380 KB |
testcase_06 | AC | 2 ms
4,380 KB |
testcase_07 | AC | 3 ms
4,376 KB |
testcase_08 | AC | 2 ms
4,376 KB |
testcase_09 | AC | 2 ms
4,380 KB |
testcase_10 | AC | 1 ms
4,380 KB |
testcase_11 | AC | 1 ms
4,380 KB |
testcase_12 | AC | 1 ms
4,376 KB |
testcase_13 | AC | 1 ms
4,376 KB |
testcase_14 | AC | 1 ms
4,376 KB |
testcase_15 | AC | 1 ms
4,376 KB |
testcase_16 | AC | 70 ms
11,928 KB |
testcase_17 | AC | 91 ms
15,580 KB |
testcase_18 | AC | 70 ms
12,032 KB |
testcase_19 | AC | 106 ms
17,112 KB |
testcase_20 | AC | 103 ms
17,188 KB |
testcase_21 | AC | 103 ms
17,132 KB |
testcase_22 | AC | 90 ms
15,676 KB |
testcase_23 | AC | 92 ms
15,944 KB |
testcase_24 | AC | 89 ms
15,908 KB |
testcase_25 | AC | 104 ms
17,048 KB |
testcase_26 | AC | 106 ms
17,192 KB |
testcase_27 | AC | 102 ms
17,148 KB |
testcase_28 | AC | 106 ms
17,148 KB |
testcase_29 | AC | 106 ms
17,136 KB |
testcase_30 | AC | 107 ms
17,204 KB |
testcase_31 | AC | 107 ms
17,148 KB |
コンパイルメッセージ
warning: unused doc comment --> Main.rs:28:5 | 28 | /// debug!(slimes); | ^^^^^^^^^^^^^^^^^^^ 29 | let mut uft = UnionFindTree::new(m); | ------------------------------------ rustdoc does not generate documentation for statements | = help: use `//` for a plain comment = note: `#[warn(unused_doc_comments)]` on by default warning: unused variable: `i` --> Main.rs:22:9 | 22 | for i in 0..n { | ^ help: if this is intentional, prefix it with an underscore: `_i` | = note: `#[warn(unused_variables)]` on by default warning: associated function `same` is never used --> Main.rs:87:8 | 87 | fn same(&mut self, x: usize, y: usize) -> bool { | ^^^^ | = note: `#[warn(dead_code)]` on by default warning: 3 warnings emitted
ソースコード
#![allow(unused_imports)] use std::cmp::*; use std::collections::*; use std::io::Write; use std::ops::Bound::*; #[allow(unused_macros)] macro_rules! debug { ($($e:expr),*) => { #[cfg(debug_assertions)] $({ let (e, mut err) = (stringify!($e), std::io::stderr()); writeln!(err, "{} = {:?}", e, $e).unwrap() })* }; } fn main() { let v = read_vec::<usize>(); let (n, m) = (v[0], v[1]); let mut slimes = vec![vec![]; n]; for i in 0..n { let v = read_vec::<usize>(); let (b, c) = (v[0] - 1, v[1] - 1); slimes[c].push(b); } /// debug!(slimes); let mut uft = UnionFindTree::new(m); for i in 0..n { if slimes[i].is_empty() { continue; } slimes[i].sort(); for j in 0..slimes[i].len() - 1 { uft.unite(slimes[i][j], slimes[i][j + 1]); } } let mut ans = 0; for i in 0..m { if i == uft.find(i) { ans += uft.get_size(i) - 1; } } println!("{}", ans); } fn read<T: std::str::FromStr>() -> T { let mut s = String::new(); std::io::stdin().read_line(&mut s).ok(); s.trim().parse().ok().unwrap() } fn read_vec<T: std::str::FromStr>() -> Vec<T> { read::<String>() .split_whitespace() .map(|e| e.parse().ok().unwrap()) .collect() } #[derive(Debug, Clone)] struct UnionFindTree { parent: Vec<isize>, size: Vec<usize>, height: Vec<u64>, } impl UnionFindTree { fn new(n: usize) -> UnionFindTree { UnionFindTree { parent: vec![-1; n], size: vec![1usize; n], height: vec![0u64; n], } } fn find(&mut self, index: usize) -> usize { if self.parent[index] == -1 { return index; } let idx = self.parent[index] as usize; let ret = self.find(idx); self.parent[index] = ret as isize; ret } fn same(&mut self, x: usize, y: usize) -> bool { self.find(x) == self.find(y) } fn get_size(&mut self, x: usize) -> usize { let idx = self.find(x); self.size[idx] } fn unite(&mut self, index0: usize, index1: usize) -> bool { let a = self.find(index0); let b = self.find(index1); if a == b { false } else { if self.height[a] > self.height[b] { self.parent[b] = a as isize; self.size[a] += self.size[b]; } else if self.height[a] < self.height[b] { self.parent[a] = b as isize; self.size[b] += self.size[a]; } else { self.parent[b] = a as isize; self.size[a] += self.size[b]; self.height[a] += 1; } true } } }