結果

問題 No.2072 Anatomy
ユーザー fukafukatani
提出日時 2022-09-17 10:51:48
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 64 ms / 2,000 ms
コード長 2,743 bytes
コンパイル時間 17,033 ms
コンパイル使用メモリ 379,968 KB
実行使用メモリ 10,624 KB
最終ジャッジ日時 2024-12-22 00:31:14
合計ジャッジ時間 19,567 ms
ジャッジサーバーID
(参考情報)
judge3 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 27
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: unused variable: `i`
  --> src/main.rs:22:9
   |
22 |     for i in 0..m {
   |         ^ help: if this is intentional, prefix it with an underscore: `_i`
   |
   = note: `#[warn(unused_variables)]` on by default

warning: methods `same` and `get_size` are never used
  --> src/main.rs:82:8
   |
63 | impl UnionFindTree {
   | ------------------ methods in this implementation
...
82 |     fn same(&mut self, x: usize, y: usize) -> bool {
   |        ^^^^
...
86 |     fn get_size(&mut self, x: usize) -> usize {
   |        ^^^^^^^^
   |
   = note: `#[warn(dead_code)]` on by default

ソースコード

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

#![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 edges = vec![];
for i in 0..m {
let v = read_vec::<usize>();
let (a, b) = (v[0] - 1, v[1] - 1);
edges.push((a, b));
}
edges.reverse();
let mut uft = UnionFindTree::new(n);
let mut counts = vec![0; n];
for (aa, bb) in edges {
let a = uft.find(aa);
let b = uft.find(bb);
uft.unite(a, b);
let o = uft.find(a);
counts[o] = max(counts[a], counts[b]) + 1;
}
println!("{}", counts.iter().max().unwrap());
}
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
}
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0