#757369 (Rust) No.1917 LCMST

• 問題: No.1917 LCMST
• ユーザー: hiromi_ayase
• 提出日時: 2022-04-30 06:33:36
• 言語: Rust (1.77.0)
• 結果: AC
• 実行時間: 365 ms / 4,000 ms
• コード長: 5,284 bytes
• コンパイル時間: 3,798 ms
• コンパイル使用メモリ: 160,824 KB
• 実行使用メモリ: 48,276 KB
• 最終ジャッジ日時: 2023-09-11 23:06:27
• 合計ジャッジ時間: 16,365 ms
• ジャッジサーバーID （参考情報）: judge11 / judge15

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 4,352 KB
testcase_01	AC	1 ms; 4,504 KB
testcase_02	AC	1 ms; 4,380 KB
testcase_03	AC	4 ms; 4,504 KB
testcase_04	AC	4 ms; 4,388 KB
testcase_05	AC	4 ms; 4,384 KB
testcase_06	AC	4 ms; 4,384 KB
testcase_07	AC	4 ms; 4,380 KB
testcase_08	AC	1 ms; 4,384 KB
testcase_09	AC	352 ms; 41,052 KB
testcase_10	AC	349 ms; 39,644 KB
testcase_11	AC	347 ms; 39,312 KB
testcase_12	AC	314 ms; 36,392 KB
testcase_13	AC	173 ms; 24,372 KB
testcase_14	AC	330 ms; 39,536 KB
testcase_15	AC	122 ms; 17,776 KB
testcase_16	AC	176 ms; 24,660 KB
testcase_17	AC	229 ms; 28,692 KB
testcase_18	AC	258 ms; 31,100 KB
testcase_19	AC	109 ms; 13,616 KB
testcase_20	AC	86 ms; 13,604 KB
testcase_21	AC	113 ms; 13,656 KB
testcase_22	AC	89 ms; 13,624 KB
testcase_23	AC	87 ms; 13,632 KB
testcase_24	AC	110 ms; 13,556 KB
testcase_25	AC	90 ms; 13,656 KB
testcase_26	AC	99 ms; 13,628 KB
testcase_27	AC	102 ms; 13,596 KB
testcase_28	AC	106 ms; 13,556 KB
testcase_29	AC	361 ms; 40,028 KB
testcase_30	AC	365 ms; 40,332 KB
testcase_31	AC	357 ms; 46,396 KB
testcase_32	AC	363 ms; 40,332 KB
testcase_33	AC	362 ms; 48,276 KB
testcase_34	AC	56 ms; 13,612 KB
testcase_35	AC	56 ms; 13,604 KB
testcase_36	AC	57 ms; 13,624 KB
testcase_37	AC	362 ms; 40,028 KB
testcase_38	AC	362 ms; 40,040 KB
testcase_39	AC	360 ms; 42,100 KB
testcase_40	AC	361 ms; 41,588 KB
testcase_41	AC	356 ms; 45,844 KB
testcase_42	AC	358 ms; 41,592 KB
testcase_43	AC	59 ms; 13,628 KB
testcase_44	AC	59 ms; 13,664 KB

ソースコード

use std::collections::{HashMap, HashSet};

#[allow(clippy::many_single_char_names)]
fn main() {
    let n = getline().parse::<usize>().unwrap();
    let a = getline()
        .split(' ')
        .map(|x| x.parse::<i32>().unwrap())
        .collect::<Vec<_>>();

    let mut ans = 0;
    let mut set = HashSet::new();
    for i in 0..n {
        if set.contains(&a[i]) {
            ans += a[i] as i64;
            continue;
        }
        set.insert(a[i]);
    }

    let mut a: Vec<i32> = set.into_iter().collect();
    let n = a.len();
    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);
    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>>>()
    }
}