#include <bits/stdc++.h>
using namespace std;
struct DSU{
int N;
vector<int> d;
void init(int n){
N = n;
d = vector<int>(N,-1);
}
int finden(int x){
if(d[x] < 0) return x;
return finden(d[x]);
}
bool unite(int a, int b){
a = finden(a), b = finden(b);
if(a == b) return false;
if(d[a] > d[b]){
swap(a,b);
} //absolute of d[a] is smaller than absolute of d[b], so there are less in a than in b, although we want to add b to a
d[a] += d[b]; d[b] = a;
return true;
}
}D;
struct edge{
int u,v,w;
bool operator<(const edge &b){
return w < b.w;
}
};
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int N; cin >> N;
vector<int> P(N);
int maxx = 0;
for(int i = 0;i<N;++i){
cin >> P[i];
maxx = max(maxx,P[i]);
}
D.init(N);
sort(P.begin(),P.end());
vector<edge> edges;
for(int i = 0;i<N;++i){
for(int j = P[i];j <= maxx; j += P[i]){
int it;
if(j == P[i]){
it = upper_bound(P.begin(),P.end(),j)-P.begin();
}
else it = lower_bound(P.begin(),P.end(),j)-P.begin();
if(it == P.size()) continue;
if(P[it]-j >= P[i]) continue;
edge e; e.u = i; e.v = it; e.w = P[it]-j;
edges.push_back(e);
int cur = P[it]-j;
while(it+1 < P.size() && P[it+1]-j == cur){
++it;
e.u = i; e.v = it; e.w = P[it]-j;
edges.push_back(e);
}
}
}
sort(edges.begin(),edges.end());
int ans = 0, cnt = N-1;
for(int i = 0;i<edges.size();++i){
if(D.unite(edges[i].u,edges[i].v)){
ans += edges[i].w;
--cnt;
}
if(cnt == 0) break;
}
cout << ans << "\n";
return 0;
}
Compilation message
sirni.cpp: In function 'int main()':
sirni.cpp:50:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
50 | if(it == P.size()) continue;
| ~~~^~~~~~~~~~~
sirni.cpp:55:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
55 | while(it+1 < P.size() && P[it+1]-j == cur){
| ~~~~~^~~~~~~~~~
sirni.cpp:65:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<edge>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
65 | for(int i = 0;i<edges.size();++i){
| ~^~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
604 KB |
Output is correct |
| 2 |
Incorrect |
45 ms |
3484 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
604 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
604 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
151 ms |
25800 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
18 ms |
3748 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
329 ms |
50576 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
47 ms |
6860 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
166 ms |
25768 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
160 ms |
25864 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
24 ms |
4820 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
