結果

問題 No.1917 LCMST
ユーザー hiromi_ayasehiromi_ayase
提出日時 2022-04-30 06:06:23
言語 Rust
(1.77.0 + proconio)
結果
MLE  
実行時間 -
コード長 4,962 bytes
コンパイル時間 17,515 ms
コンパイル使用メモリ 399,872 KB
実行使用メモリ 812,664 KB
最終ジャッジ日時 2024-06-29 12:12:42
合計ジャッジ時間 113,115 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 0 ms
6,816 KB
testcase_01 AC 2 ms
6,812 KB
testcase_02 AC 1 ms
6,940 KB
testcase_03 AC 5 ms
6,940 KB
testcase_04 AC 4 ms
6,940 KB
testcase_05 AC 4 ms
6,944 KB
testcase_06 AC 4 ms
6,944 KB
testcase_07 AC 5 ms
6,944 KB
testcase_08 AC 1 ms
6,940 KB
testcase_09 AC 2,731 ms
443,304 KB
testcase_10 AC 2,800 ms
460,376 KB
testcase_11 AC 2,709 ms
458,360 KB
testcase_12 AC 3,147 ms
450,816 KB
testcase_13 AC 2,917 ms
484,228 KB
testcase_14 AC 2,653 ms
454,836 KB
testcase_15 AC 2,793 ms
483,588 KB
testcase_16 AC 2,782 ms
465,568 KB
testcase_17 AC 2,816 ms
450,888 KB
testcase_18 AC 2,900 ms
483,268 KB
testcase_19 AC 2,520 ms
472,928 KB
testcase_20 AC 2,403 ms
463,980 KB
testcase_21 AC 2,469 ms
496,184 KB
testcase_22 AC 2,391 ms
443,896 KB
testcase_23 AC 2,425 ms
470,724 KB
testcase_24 AC 2,634 ms
449,648 KB
testcase_25 AC 2,393 ms
440,076 KB
testcase_26 AC 2,378 ms
457,064 KB
testcase_27 AC 2,415 ms
453,356 KB
testcase_28 AC 2,406 ms
483,376 KB
testcase_29 AC 2,572 ms
454,104 KB
testcase_30 AC 2,557 ms
455,520 KB
testcase_31 AC 2,595 ms
441,856 KB
testcase_32 AC 2,648 ms
450,412 KB
testcase_33 AC 2,589 ms
451,764 KB
testcase_34 AC 1,803 ms
383,892 KB
testcase_35 AC 1,028 ms
149,264 KB
testcase_36 MLE -
testcase_37 AC 2,632 ms
485,020 KB
testcase_38 AC 2,519 ms
435,088 KB
testcase_39 AC 2,508 ms
455,412 KB
testcase_40 AC 2,530 ms
451,656 KB
testcase_41 AC 2,559 ms
447,840 KB
testcase_42 AC 2,506 ms
459,364 KB
testcase_43 MLE -
testcase_44 MLE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

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 {
        let divs = divisors(a[i]);
        for d in divs {
            div_map.entry(d).or_insert_with(Vec::new).push(i);
        }
    }

    let mut edges: Vec<(usize, usize, 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 i64 / d * a[v] 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, e.1) {
            continue;
        }
        ds.merge(e.0, e.1);
        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>>>()
    }
}
0