#989200 (C++23) No.1917 LCMST

• 問題: No.1917 LCMST
• ユーザー: ir5
• 提出日時: 2024-06-16 16:19:56
• 言語: C++23 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 588 ms / 4,000 ms
• コード長: 3,181 bytes
• コンパイル時間: 2,624 ms
• コンパイル使用メモリ: 158,432 KB
• 実行使用メモリ: 69,228 KB
• 最終ジャッジ日時: 2024-06-16 16:20:25
• 合計ジャッジ時間: 22,592 ms
• ジャッジサーバーID （参考情報）: judge2 / judge3

ファイルパターン	結果
sample	AC * 3
other	AC * 42

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
#include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <numeric>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <ranges>
#include <iomanip>
using namespace std;
using ll = long long;
auto range(int n) { return views::iota(0, n); }
template<class T, class U> ostream& operator<<(ostream& os, const pair<T, U>& p){ return os << "{" << p.first << ", " << p.second << "}"; }
template<typename T> ostream& operator<<(ostream& os, const vector<T>& obj) { os << "{"; for (const auto& e : obj) os << e << ", "; return os << "}"; 
    }
template<typename T> ostream& operator<<(ostream& os, const set<T>& obj) { os << "set{"; for (const auto& e : obj) os << e << ", "; return os << "}"; 
    }
template<typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& obj) { os << "map{"; for (const auto& e : obj) os << e << ", "; 
    return os << "}"; }
#ifdef ONLINE_JUDGE
#define dump(expr) ;
#else
#define dump(expr) { cerr << "\033[33m#L" << __LINE__ << ": " << expr << "\033[39m" << endl; }
#endif
struct UF {
  vector<int> data;
  UF(int n) : data(n, -1) {}
  int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }
  bool find(int x, int y) { return root(x) == root(y); }
  void uni(int x, int y) {
    x = root(x);
    y = root(y);
    if (x != y) {
      if (data[x] < data[y])
        swap(x, y);
      data[x] += data[y];
      data[y] = x;
    }
  }
};
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll solve() {
  int n; cin >> n;
  const int A = 100000;
  // const int A = 10;
  ll res = 0;
  vector<char> exists(A + 1);
  for ([[maybe_unused]] int i : range(n)) {
    ll x; cin >> x;
    if (exists[x]) res += x;
    exists[x] = 1;
  }
  vector<vector<ll>> buckets(A + 1);
  for (int g = 1; g <= A; ++g) {
    for (int i = g; i <= A; i += g) if (exists[i]) buckets[g].push_back(i);
  }
  // dump(buckets);
  vector<pair<ll, pair<ll, ll>>> edges;
  for (int g = 1; g <= A; ++g) if (buckets[g].size() > 1) {
    ll x0 = buckets[g][0];
    for (ll x : buckets[g]) if (x != x0) edges.push_back({lcm(x0, x), {x0, x}});
  }
  sort(edges.begin(), edges.end());
  UF uf(A + 1);
  for (auto edge : edges) {
    ll w = edge.first;
    auto e = edge.second;
    if (!uf.find(e.first, e.second)) {
      res += w;
      uf.uni(e.first, e.second);
      dump(e.first << " -- " << e.second << " : " << w);
    }
  }
  return res;
}
ll brute() {
  int n; cin >> n;
  vector<ll> vs(n);
  for (int i : range(n)) cin >> vs[i];
  UF uf(n);
  vector<pair<ll, pair<ll, ll>>> edges;
  for (int i : range(n))
  for (int j : range(i)) {
    edges.push_back({lcm(vs[i], vs[j]), {i, j}});
  }
  sort(edges.begin(), edges.end());
  ll res = 0;
  for (auto edge : edges) {
    ll w = edge.first;
    auto e = edge.second;
    if (!uf.find(e.first, e.second)) {
      res += w;
      uf.uni(e.first, e.second);
      dump(vs[e.first] << " -- " << vs[e.second] << " : " << w);
    }
  }
  return res;
}
int main() {
  cout << fixed << setprecision(12);
  // cout << brute() << endl;
  cout << solve() << endl;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX