#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], st[N];
pair<int, int> mn[N];
bool b[M], d[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(228);
for (int i = 0; i < n; i++) {
int x;
cin >> x;
// x = rnd() % 20 + 1;
// cout << x << "\n";
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--;
}
d[j] = 1;
}
v.push_back(i);
}
}
// for (int i = 0; i < M; i++) {
// if (!d[i] && b[i])
// cout << i << "\n";
// }
// return 0;
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 x : v) {
int cur_set = st[w[x]];
if (!d[x]) {
for (int i = x; i < M - 1; i += x) {
int j = nt[i + 1];
if (j < i + x) {
int oth_set = st[w[j]];
if (oth_set != cur_set) {
if (mn[cur_set].first > j - i)
mn[cur_set] = { j - i, oth_set };
if (mn[oth_set].first > j - i)
mn[oth_set] = { j - i, cur_set };
}
}
}
}
if (r_nt[x - 1] != -1) {
int bef = r_nt[x - 1], oth_set = st[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++) {
if (q[i] < 0 && mn[i].second != -1 && connect(i, mn[i].second)) {
ans += mn[i].first;
remain--;
}
}
for (int i = 0; i < cnt; i++) {
st[i] = findSet(i);
}
}
cout << ans;
return 0;
}
Compilation message
sirni.cpp: In function 'int main()':
sirni.cpp:89:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0; i < v.size(); i++) {
~~^~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
223 ms |
168600 KB |
Output is correct |
| 2 |
Correct |
516 ms |
168872 KB |
Output is correct |
| 3 |
Correct |
223 ms |
170360 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
580 ms |
167176 KB |
Output is correct |
| 2 |
Correct |
1024 ms |
167616 KB |
Output is correct |
| 3 |
Correct |
224 ms |
170360 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
218 ms |
169080 KB |
Output is correct |
| 2 |
Correct |
214 ms |
163704 KB |
Output is correct |
| 3 |
Correct |
226 ms |
170360 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1002 ms |
169648 KB |
Output is correct |
| 2 |
Correct |
1759 ms |
169604 KB |
Output is correct |
| 3 |
Correct |
912 ms |
169588 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
373 ms |
168360 KB |
Output is correct |
| 2 |
Correct |
1618 ms |
168396 KB |
Output is correct |
| 3 |
Correct |
1212 ms |
169216 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1661 ms |
169828 KB |
Output is correct |
| 2 |
Correct |
1835 ms |
169832 KB |
Output is correct |
| 3 |
Correct |
788 ms |
169716 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1070 ms |
168076 KB |
Output is correct |
| 2 |
Correct |
2210 ms |
169328 KB |
Output is correct |
| 3 |
Correct |
837 ms |
169704 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
530 ms |
178552 KB |
Output is correct |
| 2 |
Correct |
1635 ms |
178832 KB |
Output is correct |
| 3 |
Correct |
609 ms |
178548 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
480 ms |
178612 KB |
Output is correct |
| 2 |
Correct |
2474 ms |
178392 KB |
Output is correct |
| 3 |
Correct |
520 ms |
178612 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
294 ms |
177444 KB |
Output is correct |
| 2 |
Correct |
2826 ms |
178240 KB |
Output is correct |
| 3 |
Correct |
905 ms |
170300 KB |
Output is correct |
