This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/* Author : Mychecksdead */
#include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef long double ld;
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define PI 3.1415926535
#define pb push_back
#define setp() cout << setprecision(15)
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " is " << x << '\n';
const int N = 1e7+100, M = 1e5+10, F = 2147483646, K = 20;
struct Dsu {
vector<int> s, p;
Dsu(int n){
s.resize(n+1, 1);
p.resize(n+1);
for(int i = 0; i <= n; ++i) p[i] = i;
}
int find(int v){
if(p[v] == v) return v;
return (p[v] = find(p[v]));
}
void merge(int a, int b){
a = find(a);
b = find(b);
if(a != b){
if(s[a] > s[b]){
swap(a, b);
}
s[b] += s[a];
p[a] = b;
}
}
};
int n;
vector<int> v(N), a;
vector<bool> is(N);
vector<array<int, 3>> edges[N];
void solve(){
cin >> n;
a.resize(n);
for(int i = 0; i < n; ++i) cin >> a[i];
Dsu d(n);
sort(all(a));
a.resize(unique(all(a)) - a.begin());
n = a.size();
for(int i = 0; i < n - 1; ++i){
for(int j = a[i]; j <= a.back(); j += a[i]){
int k = lower_bound(a.begin() + i + 1, a.end(), j) - a.begin();
if(k >= n || a[k] - j > a[i]) continue;
edges[a[k] - j].pb({a[k] - j, k, i});
}
}
ll ans = 0;
for(int i = 0; i < N; ++i)
for(auto v: edges[i]){
if(d.find(v[1]) != d.find(v[2])){
d.merge(v[1], v[2]);
ans += v[0];
}
}
cout << ans;
}
int main(){
cin.tie(0); ios::sync_with_stdio(0);
int T = 1, aa;
// cin >> T;aa=T;
while(T--){
// cout << "Case #" << aa-T << ": ";
solve();
// cout << '\n';
}
return 0;
}
Compilation message (stderr)
sirni.cpp: In function 'int main()':
sirni.cpp:84:16: warning: unused variable 'aa' [-Wunused-variable]
84 | int T = 1, aa;
| ^~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |