結果
問題 | No.2563 色ごとのグループ |
ユーザー | 👑 tipstar0125 |
提出日時 | 2023-12-02 15:31:43 |
言語 | Rust (1.77.0) |
結果 |
AC
|
実行時間 | 139 ms / 2,000 ms |
コード長 | 7,501 bytes |
コンパイル時間 | 3,426 ms |
コンパイル使用メモリ | 203,632 KB |
実行使用メモリ | 22,844 KB |
最終ジャッジ日時 | 2023-12-02 15:31:49 |
合計ジャッジ時間 | 6,515 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge10 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,676 KB |
testcase_01 | AC | 1 ms
6,676 KB |
testcase_02 | AC | 1 ms
6,676 KB |
testcase_03 | AC | 1 ms
6,676 KB |
testcase_04 | AC | 1 ms
6,676 KB |
testcase_05 | AC | 1 ms
6,676 KB |
testcase_06 | AC | 1 ms
6,676 KB |
testcase_07 | AC | 1 ms
6,676 KB |
testcase_08 | AC | 1 ms
6,676 KB |
testcase_09 | AC | 1 ms
6,676 KB |
testcase_10 | AC | 1 ms
6,676 KB |
testcase_11 | AC | 1 ms
6,676 KB |
testcase_12 | AC | 1 ms
6,676 KB |
testcase_13 | AC | 1 ms
6,676 KB |
testcase_14 | AC | 2 ms
6,676 KB |
testcase_15 | AC | 1 ms
6,676 KB |
testcase_16 | AC | 2 ms
6,676 KB |
testcase_17 | AC | 1 ms
6,676 KB |
testcase_18 | AC | 2 ms
6,676 KB |
testcase_19 | AC | 2 ms
6,676 KB |
testcase_20 | AC | 8 ms
6,676 KB |
testcase_21 | AC | 5 ms
6,676 KB |
testcase_22 | AC | 3 ms
6,676 KB |
testcase_23 | AC | 5 ms
6,676 KB |
testcase_24 | AC | 49 ms
11,084 KB |
testcase_25 | AC | 49 ms
11,520 KB |
testcase_26 | AC | 75 ms
15,908 KB |
testcase_27 | AC | 104 ms
19,696 KB |
testcase_28 | AC | 86 ms
17,584 KB |
testcase_29 | AC | 122 ms
22,844 KB |
testcase_30 | AC | 126 ms
22,844 KB |
testcase_31 | AC | 125 ms
22,844 KB |
testcase_32 | AC | 122 ms
22,844 KB |
testcase_33 | AC | 139 ms
18,492 KB |
testcase_34 | AC | 138 ms
18,492 KB |
testcase_35 | AC | 137 ms
18,492 KB |
testcase_36 | AC | 136 ms
18,492 KB |
testcase_37 | AC | 135 ms
18,492 KB |
ソースコード
#![allow(non_snake_case)] #![allow(unused_imports)] #![allow(unused_macros)] #![allow(clippy::needless_range_loop)] #![allow(clippy::comparison_chain)] #![allow(clippy::nonminimal_bool)] #![allow(clippy::neg_multiply)] #![allow(dead_code)] use std::cmp::Reverse; use std::collections::{BTreeMap, BTreeSet, BinaryHeap, VecDeque}; #[derive(Default)] struct Solver {} impl Solver { fn solve(&mut self) { input! { N: usize, M: usize, C: [usize1; N], UV: [(usize1, usize1); M] } let mut uf = UnionFind::new(N); for &(u, v) in &UV { if C[u] == C[v] { uf.unite(u, v); } } let mut ans = 0_usize; let mut CC = vec![vec![]; N]; for (i, &c) in C.iter().enumerate() { CC[c].push(i); } for i in 0..N { let mut roots = BTreeSet::new(); for &v in CC[i].iter() { let r = uf.find(v); roots.insert(r); } if roots.is_empty() { continue; } ans += roots.len() - 1; } println!("{}", ans); } } #[derive(Debug, Clone)] struct UnionFind { parent: Vec<isize>, roots: BTreeSet<usize>, size: usize, } impl UnionFind { fn new(n: usize) -> Self { let mut roots = BTreeSet::new(); for i in 0..n { roots.insert(i); } UnionFind { parent: vec![-1; n], roots, size: n, } } fn find(&mut self, x: usize) -> usize { if self.parent[x] < 0 { return x; } let root = self.find(self.parent[x] as usize); self.parent[x] = root as isize; root } fn unite(&mut self, x: usize, y: usize) -> Option<(usize, usize)> { let root_x = self.find(x); let root_y = self.find(y); if root_x == root_y { return None; } let size_x = -self.parent[root_x]; let size_y = -self.parent[root_y]; self.size -= 1; if size_x >= size_y { self.parent[root_x] -= size_y; self.parent[root_y] = root_x as isize; self.roots.remove(&root_y); Some((root_x, root_y)) } else { self.parent[root_y] -= size_x; self.parent[root_x] = root_y as isize; self.roots.remove(&root_x); Some((root_y, root_x)) } } fn is_same(&mut self, x: usize, y: usize) -> bool { self.find(x) == self.find(y) } fn is_root(&mut self, x: usize) -> bool { self.find(x) == x } fn get_union_size(&mut self, x: usize) -> usize { let root = self.find(x); -self.parent[root] as usize } fn get_size(&self) -> usize { self.size } fn members(&mut self, x: usize) -> Vec<usize> { let root = self.find(x); (0..self.parent.len()) .filter(|i| self.find(*i) == root) .collect::<Vec<usize>>() } fn all_group_members(&mut self) -> BTreeMap<usize, Vec<usize>> { let mut groups_map: BTreeMap<usize, Vec<usize>> = BTreeMap::new(); for x in 0..self.parent.len() { let r = self.find(x); groups_map.entry(r).or_default().push(x); } groups_map } } fn main() { std::thread::Builder::new() .stack_size(128 * 1024 * 1024) .spawn(|| Solver::default().solve()) .unwrap() .join() .unwrap(); } #[macro_export] macro_rules! input { () => {}; (mut $var:ident: $t:tt, $($rest:tt)*) => { let mut $var = __input_inner!($t); input!($($rest)*) }; ($var:ident: $t:tt, $($rest:tt)*) => { let $var = __input_inner!($t); input!($($rest)*) }; (mut $var:ident: $t:tt) => { let mut $var = __input_inner!($t); }; ($var:ident: $t:tt) => { let $var = __input_inner!($t); }; } #[macro_export] macro_rules! __input_inner { (($($t:tt),*)) => { ($(__input_inner!($t)),*) }; ([$t:tt; $n:expr]) => { (0..$n).map(|_| __input_inner!($t)).collect::<Vec<_>>() }; ([$t:tt]) => {{ let n = __input_inner!(usize); (0..n).map(|_| __input_inner!($t)).collect::<Vec<_>>() }}; (chars) => { __input_inner!(String).chars().collect::<Vec<_>>() }; (bytes) => { __input_inner!(String).into_bytes() }; (usize1) => { __input_inner!(usize) - 1 }; ($t:ty) => { $crate::read::<$t>() }; } #[macro_export] macro_rules! println { () => { $crate::write(|w| { use std::io::Write; std::writeln!(w).unwrap() }) }; ($($arg:tt)*) => { $crate::write(|w| { use std::io::Write; std::writeln!(w, $($arg)*).unwrap() }) }; } #[macro_export] macro_rules! print { ($($arg:tt)*) => { $crate::write(|w| { use std::io::Write; std::write!(w, $($arg)*).unwrap() }) }; } #[macro_export] macro_rules! flush { () => { $crate::write(|w| { use std::io::Write; w.flush().unwrap() }) }; } pub fn read<T>() -> T where T: std::str::FromStr, T::Err: std::fmt::Debug, { use std::cell::RefCell; use std::io::*; thread_local! { pub static STDIN: RefCell<StdinLock<'static>> = RefCell::new(stdin().lock()); } STDIN.with(|r| { let mut r = r.borrow_mut(); let mut s = vec![]; loop { let buf = r.fill_buf().unwrap(); if buf.is_empty() { break; } if let Some(i) = buf.iter().position(u8::is_ascii_whitespace) { s.extend_from_slice(&buf[..i]); r.consume(i + 1); if !s.is_empty() { break; } } else { s.extend_from_slice(buf); let n = buf.len(); r.consume(n); } } std::str::from_utf8(&s).unwrap().parse().unwrap() }) } pub fn write<F>(f: F) where F: FnOnce(&mut std::io::BufWriter<std::io::StdoutLock>), { use std::cell::RefCell; use std::io::*; thread_local! { pub static STDOUT: RefCell<BufWriter<StdoutLock<'static>>> = RefCell::new(BufWriter::new(stdout().lock())); } STDOUT.with(|w| f(&mut w.borrow_mut())) } trait Bound<T> { fn lower_bound(&self, x: &T) -> usize; fn upper_bound(&self, x: &T) -> usize; } impl<T: PartialOrd> Bound<T> for [T] { fn lower_bound(&self, x: &T) -> usize { let (mut low, mut high) = (0, self.len()); while low + 1 < high { let mid = (low + high) / 2; if self[mid] < *x { low = mid; } else { high = mid; } } if self[low] < *x { low + 1 } else { low } } fn upper_bound(&self, x: &T) -> usize { let (mut low, mut high) = (0, self.len()); while low + 1 < high { let mid = (low + high) / 2; if self[mid] <= *x { low = mid; } else { high = mid; } } if self[low] <= *x { low + 1 } else { low } } }