fork download
copy 
  1. // ~~ icebear ~~
  2. #include <bits/stdc++.h>
  3. using namespace std;
  4.  
  5. typedef long long ll;
  6. typedef pair<int, int> ii;
  7. typedef pair<int, ii> iii;
  8.  
  9. template<class T>
  10.     bool minimize(T &a, const T &b) {
  11.         if (a > b) return a = b, true;
  12.         return false;
  13.     }
  14.  
  15. template<class T>
  16.     bool maximize(T &a, const T &b) {
  17.         if (a < b) return a = b, true;
  18.         return false;
  19.     }
  20.  
  21. #define FOR(i,a,b) for(int i=(a); i<=(b); ++i)
  22. #define FORR(i,a,b) for(int i=(a); i>=(b); --i)
  23. #define REP(i, n) for(int i=0; i<(n); ++i)
  24. #define RED(i, n) for(int i=(n)-1; i>=0; --i)
  25. #define MASK(i) (1LL << (i))
  26. #define BIT(S, i) (((S) >> (i)) & 1)
  27. #define mp make_pair
  28. #define pb push_back
  29. #define fi first
  30. #define se second
  31. #define all(x) x.begin(), x.end()
  32. #define task "icebear"
  33.  
  34. const int MOD = 1e9 + 7;
  35. const int inf = 1e9 + 27092008;
  36. const ll INF = 1e18 + 27092008;
  37. const int N = 1e5 + 5;
  38. const int MAX = 1e7 + 5;
  39. int n, a[N], lab[N];
  40. vector<ii> E[MAX];
  41.  
  42. int root(int v) {
  43.     return (lab[v] < 0 ? v : lab[v] = root(lab[v]));
  44. }
  45.  
  46. bool unite(int u, int v) {
  47.     u = root(u);
  48.     v = root(v);
  49.     if (u == v) return false;
  50.     if (lab[u] > lab[v]) swap(u, v);
  51.     lab[u] += lab[v];
  52.     lab[v] = u;
  53.     return true;
  54. }
  55.  
  56.  
  57. void init(void) {
  58.     cin >> n;
  59.     FOR(i, 1, n) {
  60.         cin >> a[i];
  61.         lab[i] = -1;
  62.     }
  63.     sort(a + 1, a + n + 1);
  64. }
  65.  
  66. void process(void) {
  67.     FOR(i, 1, n) {
  68.         if (a[i] == a[i - 1]) {
  69.             E[0].pb(mp(i - 1, i));
  70.             continue;
  71.         }
  72.         int p = upper_bound(a + 1, a + n + 1, a[i]) - a;
  73.         if (p <= n) E[a[p] % a[i]].emplace_back(i, p);
  74.  
  75.         for(int j = 2; j * a[i] <= a[n]; j++) {
  76.             p = lower_bound(a + 1, a + n + 1, j * a[i]) - a;
  77.             if (p <= n) E[a[p] % a[i]].emplace_back(i, p);
  78.         }
  79.     }
  80.  
  81.     ll ans = 0;
  82.     int e = 0;
  83.     FOR(i, 0, MAX - 5) {
  84.         for(ii x : E[i])
  85.             if (unite(x.fi, x.se))
  86.                 ans += i, e++;
  87.         if (e == n - 1) break;
  88.     }
  89.     cout << ans;
  90. }
  91.  
  92. int main() {
  93.     ios_base::sync_with_stdio(0);
  94.     cin.tie(0); cout.tie(0);
  95.     if (fopen(task".inp", "r")) {
  96.         freopen(task".inp", "r", stdin);
  97.         freopen(task".out", "w", stdout);
  98.     }
  99.     int tc = 1;
  100. //    cin >> tc;
  101.     while(tc--) {
  102.         init();
  103.         process();
  104.     }
  105.     return 0;
  106. }
  107.  
Success #stdin #stdout 0.07s 237972KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/UAPx8C
language:
C++14 (gcc 8.3)
created:
20 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!