#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define all(aaa) aaa.begin(), aaa.end()
const int N = 1e5 + 5, M = 1e7 + 5, INF = 1e9;
int q[N], w[M], nt[M], r_nt[M], c[M];
pair<int, int> mn[N];
bool b[M];
int findSet(int v) {
return q[v] < 0 ? v : q[v] = findSet(q[v]);
}
bool connect(int a, int b) {
a = findSet(a);
b = findSet(b);
if (a == b)
return false;
if (q[a] > q[b])
swap(a, b);
q[a] += q[b];
q[b] = a;
return true;
}
signed main() {
#ifdef HOME
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
mt19937 rnd(time(0));
for (int i = 0; i < n; i++) {
int x;
cin >> x;
b[x] = 1;
}
fill(w, w + M, -1);
fill(c, c + M, -1);
fill(q, q + N, -1);
vector<int> v;
int cnt = 0;
for (int i = 0; i < M; i++) {
if (b[i]) {
w[i] = cnt++;
}
}
int remain = cnt;
for (int i = 0; i < M; i++) {
if (b[i]) {
for (int j = i + i; j < M; j += i) {
if (b[j] && connect(w[i], w[j])) {
remain--;
}
}
}
}
for (int i = 0; i < M; i++) {
if (b[i]) {
// for (int j = i + i; j < M; j += i) {
// b[j] = 0;
// }
v.push_back(i);
}
}
for (int i = 0; i < v.size(); i++) {
for (int j = v[i]; j < M; j += v[i]) {
c[j] = i;
}
}
nt[M - 1] = INF;
for (int i = M - 2; i >= 0; i--) {
nt[i] = b[i] ? i : nt[i + 1];
}
r_nt[0] = -1;
for (int i = 1; i < M; i++) {
r_nt[i] = c[i] != -1 ? i : r_nt[i - 1];
}
// for (int i = 0; i < 20; i++) {
// cout << nt[i] << " ";
// }
// cout << "\n";
// for (int i = 0; i < 20; i++) {
// cout << w[i] << " ";
// }
// cout << "\n";
// for (int x : v)
// cout << x << "\n";
// return 0;
ll ans = 0;
while (remain > 1) {
for (int i = 0; i < cnt; i++)
mn[i] = { INF, -1 };
for (int k = 0; k < v.size(); k++) {
int x = v[k], cur_set = findSet(k);
for (int i = x; i < M - 1; i += x) {
int j = x == i ? nt[i + 1] : nt[i];
if (j < i + x) {
int oth_set = findSet(w[j]);
if (oth_set != cur_set) {
mn[cur_set] = min(mn[cur_set], { j - i, oth_set });
mn[oth_set] = min(mn[oth_set], { j - i, cur_set });
}
}
}
if (r_nt[x - 1] != -1) {
int bef = r_nt[x - 1], oth_set = findSet(c[bef]);
if (oth_set != cur_set) {
mn[cur_set] = min(mn[cur_set], { x - bef, oth_set });
mn[oth_set] = min(mn[oth_set], { x - bef, cur_set });
}
}
}
for (int i = 0; i < cnt; i++) {
// cout << mn[i].first << " " << mn[i].second << "\n";
if (q[i] < 0 && mn[i].second != -1 && connect(i, mn[i].second)) {
ans += mn[i].first;
remain--;
}
}
}
cout << ans;
return 0;
}
Compilation message
sirni.cpp: In function 'int main()':
sirni.cpp:85:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0; i < v.size(); i++) {
~~^~~~~~~~~~
sirni.cpp:123:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int k = 0; k < v.size(); k++) {
~~^~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
226 ms |
160476 KB |
Output is correct |
| 2 |
Correct |
563 ms |
159104 KB |
Output is correct |
| 3 |
Correct |
225 ms |
160604 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
547 ms |
157384 KB |
Output is correct |
| 2 |
Correct |
1084 ms |
157812 KB |
Output is correct |
| 3 |
Correct |
229 ms |
160604 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
222 ms |
160604 KB |
Output is correct |
| 2 |
Correct |
233 ms |
158476 KB |
Output is correct |
| 3 |
Correct |
228 ms |
160760 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1380 ms |
159516 KB |
Output is correct |
| 2 |
Correct |
3346 ms |
159464 KB |
Output is correct |
| 3 |
Correct |
933 ms |
159364 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
410 ms |
158528 KB |
Output is correct |
| 2 |
Correct |
1939 ms |
158408 KB |
Output is correct |
| 3 |
Correct |
1461 ms |
158876 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2895 ms |
159732 KB |
Output is correct |
| 2 |
Correct |
2583 ms |
159704 KB |
Output is correct |
| 3 |
Correct |
855 ms |
159476 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1226 ms |
158072 KB |
Output is correct |
| 2 |
Correct |
3773 ms |
159340 KB |
Output is correct |
| 3 |
Correct |
864 ms |
159476 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1403 ms |
168456 KB |
Output is correct |
| 2 |
Execution timed out |
5070 ms |
168560 KB |
Time limit exceeded |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1056 ms |
168384 KB |
Output is correct |
| 2 |
Execution timed out |
5058 ms |
168168 KB |
Time limit exceeded |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
459 ms |
167496 KB |
Output is correct |
| 2 |
Execution timed out |
5099 ms |
167976 KB |
Time limit exceeded |
| 3 |
Halted |
0 ms |
0 KB |
- |
