#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--;
}
}
v.push_back(i);
}
}
// 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:86:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0; i < v.size(); i++) {
~~^~~~~~~~~~
sirni.cpp:124: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 |
216 ms |
160476 KB |
Output is correct |
| 2 |
Correct |
571 ms |
159172 KB |
Output is correct |
| 3 |
Correct |
221 ms |
160760 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
610 ms |
157456 KB |
Output is correct |
| 2 |
Correct |
1274 ms |
158024 KB |
Output is correct |
| 3 |
Correct |
249 ms |
160632 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
218 ms |
160636 KB |
Output is correct |
| 2 |
Correct |
212 ms |
158456 KB |
Output is correct |
| 3 |
Correct |
217 ms |
160788 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1358 ms |
159496 KB |
Output is correct |
| 2 |
Correct |
3000 ms |
159740 KB |
Output is correct |
| 3 |
Correct |
849 ms |
159388 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
418 ms |
158596 KB |
Output is correct |
| 2 |
Correct |
1843 ms |
158528 KB |
Output is correct |
| 3 |
Correct |
1430 ms |
158964 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2988 ms |
159668 KB |
Output is correct |
| 2 |
Correct |
2537 ms |
159604 KB |
Output is correct |
| 3 |
Correct |
850 ms |
160244 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1106 ms |
158080 KB |
Output is correct |
| 2 |
Correct |
3510 ms |
159344 KB |
Output is correct |
| 3 |
Correct |
808 ms |
159480 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1361 ms |
168392 KB |
Output is correct |
| 2 |
Execution timed out |
5090 ms |
168548 KB |
Time limit exceeded |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1072 ms |
168544 KB |
Output is correct |
| 2 |
Execution timed out |
5103 ms |
168392 KB |
Time limit exceeded |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
419 ms |
167488 KB |
Output is correct |
| 2 |
Execution timed out |
5093 ms |
168268 KB |
Time limit exceeded |
| 3 |
Halted |
0 ms |
0 KB |
- |
