結果
問題 | No.1293 2種類の道路 |
ユーザー |
|
提出日時 | 2022-11-16 23:09:52 |
言語 | Rust (1.83.0 + proconio) |
結果 |
AC
|
実行時間 | 83 ms / 2,000 ms |
コード長 | 3,161 bytes |
コンパイル時間 | 13,451 ms |
コンパイル使用メモリ | 379,724 KB |
実行使用メモリ | 22,672 KB |
最終ジャッジ日時 | 2024-09-17 17:36:41 |
合計ジャッジ時間 | 16,883 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 22 |
コンパイルメッセージ
warning: field `n` is never read --> src/main.rs:5:5 | 4 | struct UnionFind { | --------- field in this struct 5 | n: usize, | ^ | = note: `#[warn(dead_code)]` on by default warning: method `chain_cnt` is never used --> src/main.rs:48:8 | 11 | impl UnionFind { | -------------- method in this implementation ... 48 | fn chain_cnt(&mut self, i: usize) -> usize { | ^^^^^^^^^
ソースコード
use std::collections::{HashMap, HashSet}; struct UnionFind { n: usize, parents: Vec<usize>, depths: Vec<usize>, chains: Vec<usize>, } impl UnionFind { fn new(n: usize) -> Self { UnionFind { n: n, parents: (0..n).collect(), depths: vec![0; n], chains: vec![1; n], } } fn equiv(&mut self, a: usize, b: usize) -> bool { self.find(a) == self.find(b) } fn unite(&mut self, a: usize, b: usize) { if self.equiv(a, b) { return; } let x = self.parents[a]; let y = self.parents[b]; if self.depths[x] > self.depths[y] { self.parents[x] = self.parents[y]; self.chains[y] += self.chains[x]; } else { self.parents[y] = self.parents[x]; self.chains[x] += self.chains[y]; if self.depths[x] == self.depths[y] { self.depths[x] += 1; } } } fn find(&mut self, a: usize) -> usize { if self.parents[a] == a { return a; } let p = self.find(self.parents[a]); self.parents[a] = p; p } fn chain_cnt(&mut self, i: usize) -> usize { let idx = self.find(i); self.chains[idx] } } fn main() { let mut ndw = String::new(); std::io::stdin().read_line(&mut ndw).ok(); let ndw: Vec<usize> = ndw.trim().split_whitespace().map(|s| s.parse().unwrap()).collect(); let n = ndw[0]; let d = ndw[1]; let w = ndw[2]; let mut cuf = UnionFind::new(n); let mut wuf = UnionFind::new(n); let mut csize = vec![1usize; n]; let mut wsize = vec![1usize; n]; for _ in 0..d { let mut ab = String::new(); std::io::stdin().read_line(&mut ab).ok(); let ab: Vec<usize> = ab.trim().split_whitespace().map(|s| s.parse().unwrap()).collect(); let a = ab[0]-1; let b = ab[1]-1; let pa = cuf.find(a); let pb = cuf.find(b); if pa == pb { continue; } cuf.unite(pa, pb); let p = cuf.find(pa); if p == pa { csize[pa] += csize[pb]; csize[pb] = 0; } else { csize[pb] += csize[pa]; csize[pa] = 0; } } for _ in 0..w { let mut ab = String::new(); std::io::stdin().read_line(&mut ab).ok(); let ab: Vec<usize> = ab.trim().split_whitespace().map(|s| s.parse().unwrap()).collect(); let a = ab[0]-1; let b = ab[1]-1; let pa = wuf.find(a); let pb = wuf.find(b); if pa == pb { continue; } wuf.unite(pa, pb); let p = wuf.find(pa); if p == pa { wsize[pa] += wsize[pb]; wsize[pb] = 0; } else { wsize[pb] += wsize[pa]; wsize[pa] = 0; } } let mut mapping = HashMap::new(); for i in 0..n { mapping.entry(cuf.find(i)).or_insert(HashSet::new()).insert(wuf.find(i)); } let mut result = 0usize; for (&idx, children) in mapping.iter() { result += csize[idx] * children.iter().map(|&c| wsize[c]).sum::<usize>(); } println!("{}", result-n); }