結果
問題 | No.1917 LCMST |
ユーザー | hiromi_ayase |
提出日時 | 2022-04-30 06:18:41 |
言語 | Rust (1.77.0) |
結果 |
MLE
|
実行時間 | - |
コード長 | 5,028 bytes |
コンパイル時間 | 2,436 ms |
コンパイル使用メモリ | 164,632 KB |
実行使用メモリ | 813,188 KB |
最終ジャッジ日時 | 2023-09-11 22:51:52 |
合計ジャッジ時間 | 93,907 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 1 ms
4,380 KB |
testcase_03 | AC | 4 ms
4,376 KB |
testcase_04 | AC | 4 ms
4,380 KB |
testcase_05 | AC | 4 ms
4,380 KB |
testcase_06 | AC | 4 ms
4,376 KB |
testcase_07 | AC | 4 ms
4,376 KB |
testcase_08 | AC | 1 ms
4,380 KB |
testcase_09 | AC | 2,515 ms
282,528 KB |
testcase_10 | AC | 2,432 ms
275,952 KB |
testcase_11 | AC | 2,371 ms
287,332 KB |
testcase_12 | AC | 2,461 ms
296,100 KB |
testcase_13 | AC | 2,554 ms
329,780 KB |
testcase_14 | AC | 2,415 ms
313,240 KB |
testcase_15 | AC | 2,567 ms
309,700 KB |
testcase_16 | AC | 2,640 ms
312,460 KB |
testcase_17 | AC | 2,580 ms
312,912 KB |
testcase_18 | AC | 2,523 ms
315,116 KB |
testcase_19 | AC | 2,183 ms
327,204 KB |
testcase_20 | AC | 2,128 ms
304,356 KB |
testcase_21 | AC | 2,192 ms
304,220 KB |
testcase_22 | AC | 2,103 ms
291,200 KB |
testcase_23 | AC | 2,173 ms
302,936 KB |
testcase_24 | AC | 2,192 ms
318,864 KB |
testcase_25 | AC | 2,127 ms
285,884 KB |
testcase_26 | AC | 2,132 ms
302,368 KB |
testcase_27 | AC | 2,187 ms
294,740 KB |
testcase_28 | AC | 2,157 ms
306,104 KB |
testcase_29 | AC | 2,325 ms
273,524 KB |
testcase_30 | AC | 2,342 ms
276,684 KB |
testcase_31 | AC | 2,350 ms
302,680 KB |
testcase_32 | AC | 2,447 ms
278,720 KB |
testcase_33 | AC | 2,431 ms
272,048 KB |
testcase_34 | AC | 1,790 ms
260,708 KB |
testcase_35 | AC | 1,128 ms
96,948 KB |
testcase_36 | AC | 2,297 ms
355,736 KB |
testcase_37 | AC | 2,394 ms
304,368 KB |
testcase_38 | AC | 2,340 ms
269,816 KB |
testcase_39 | AC | 2,352 ms
272,952 KB |
testcase_40 | AC | 2,345 ms
274,172 KB |
testcase_41 | AC | 2,342 ms
312,852 KB |
testcase_42 | AC | 2,312 ms
265,756 KB |
testcase_43 | MLE | - |
testcase_44 | MLE | - |
ソースコード
use std::{ collections::{HashMap}, }; #[allow(clippy::many_single_char_names)] fn main() { let n = getline().parse::<usize>().unwrap(); let mut a = getline() .split(' ') .map(|x| x.parse::<i32>().unwrap()) .collect::<Vec<_>>(); a.sort(); let mut div_map: HashMap<i32, _> = HashMap::new(); for i in 0..n as i32 { let divs = divisors(a[i as usize]); for d in divs { div_map.entry(d).or_insert_with(Vec::new).push(i); } } let mut edges: Vec<(i32, i32, i64)> = Vec::new(); for e in div_map { let d = e.0 as i64; let u = e.1[0]; for v in e.1 { if u == v { continue; } edges.push((u, v, a[u as usize] as i64 / d * a[v as usize] as i64)); } } edges.sort_by_key(|e| e.2); let mut ds = Dsu::new(n); let mut ans = 0; for e in edges { if ds.same(e.0 as usize, e.1 as usize) { continue; } ds.merge(e.0 as usize, e.1 as usize); ans += e.2; } println!("{}", ans); } fn divisors(x: i32) -> Vec<i32> { let mut ret = vec![]; let mut i = 1; while i * i <= x { if x % i == 0 { ret.push(i); if i * i != x { ret.push(x / i); } } i += 1; } ret } fn getline() -> String { let mut buf = String::new(); std::io::stdin().read_line(&mut buf).unwrap(); buf.trim().to_string() } pub struct Dsu { n: usize, // root node: -1 * component size // otherwise: parent parent_or_size: Vec<i32>, } impl Dsu { /// Creates a new `Dsu`. /// /// # Constraints /// /// - $0 \leq n \leq 10^8$ /// /// # Complexity /// /// - $O(n)$ pub fn new(size: usize) -> Self { Self { n: size, parent_or_size: vec![-1; size], } } // `\textsc` does not work in KaTeX /// Performs the Uɴɪᴏɴ operation. /// /// # Constraints /// /// - $0 \leq a < n$ /// - $0 \leq b < n$ /// /// # Panics /// /// Panics if the above constraints are not satisfied. /// /// # Complexity /// /// - $O(\alpha(n))$ amortized pub fn merge(&mut self, a: usize, b: usize) -> usize { assert!(a < self.n); assert!(b < self.n); let (mut x, mut y) = (self.leader(a), self.leader(b)); if x == y { return x; } if -self.parent_or_size[x] < -self.parent_or_size[y] { std::mem::swap(&mut x, &mut y); } self.parent_or_size[x] += self.parent_or_size[y]; self.parent_or_size[y] = x as i32; x } /// Returns whether the vertices $a$ and $b$ are in the same connected component. /// /// # Constraints /// /// - $0 \leq a < n$ /// - $0 \leq b < n$ /// /// # Panics /// /// Panics if the above constraint is not satisfied. /// /// # Complexity /// /// - $O(\alpha(n))$ amortized pub fn same(&mut self, a: usize, b: usize) -> bool { assert!(a < self.n); assert!(b < self.n); self.leader(a) == self.leader(b) } /// Performs the Fɪɴᴅ operation. /// /// # Constraints /// /// - $0 \leq a < n$ /// /// # Panics /// /// Panics if the above constraint is not satisfied. /// /// # Complexity /// /// - $O(\alpha(n))$ amortized pub fn leader(&mut self, a: usize) -> usize { assert!(a < self.n); if self.parent_or_size[a] < 0 { return a; } self.parent_or_size[a] = self.leader(self.parent_or_size[a] as usize) as i32; self.parent_or_size[a] as usize } /// Returns the size of the connected component that contains the vertex $a$. /// /// # Constraints /// /// - $0 \leq a < n$ /// /// # Panics /// /// Panics if the above constraint is not satisfied. /// /// # Complexity /// /// - $O(\alpha(n))$ amortized pub fn size(&mut self, a: usize) -> usize { assert!(a < self.n); let x = self.leader(a); -self.parent_or_size[x] as usize } /// Divides the graph into connected components. /// /// The result may not be ordered. /// /// # Complexity /// /// - $O(n)$ pub fn groups(&mut self) -> Vec<Vec<usize>> { let mut leader_buf = vec![0; self.n]; let mut group_size = vec![0; self.n]; for i in 0..self.n { leader_buf[i] = self.leader(i); group_size[leader_buf[i]] += 1; } let mut result = vec![Vec::new(); self.n]; for i in 0..self.n { result[i].reserve(group_size[i]); } for i in 0..self.n { result[leader_buf[i]].push(i); } result .into_iter() .filter(|x| !x.is_empty()) .collect::<Vec<Vec<usize>>>() } }