#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <cassert>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
#define pb push_back
#define F first
#define S second
#define For(i,x,y) for (int i = x; i <= y; ++i)
#define FOr(i,x,y) for (int i = x; i >= y; --i)
// ROAD to... Red
using namespace std;
const int maxn = 1e7 + 3;
const int N = 1e5 + 1;
int n;
int sz[N];
int p[N];
int a[N];
int R[maxn + 1];
int id[maxn + 1];
int ans = 0;
bool u[maxn + 1];
vector < pair < int, int > > g[maxn + 1];
inline int get (int v) {
if (p[v] == v) {
return v;
}
return p[v] = get(p[v]);
}
int main () {
scanf("%d", &n);
For (i, 1, n) {
scanf("%d", a + i);
}
sort(a + 1, a + n + 1);
if (a[1] == 1) {
puts("0");
exit(0);
}
For (i, 1, n) {
if (id[a[i]]) continue;
p[i] = i;
sz[i] = 1;
R[a[i]] = a[i];
id[a[i]] = i;
}
for (int j = maxn - 2; j >= 0; --j) {
if (!R[j])
R[j] = R[j + 1];
}
For (i, 1, n) {
if (u[a[i]] > 0) continue;
++ u[a[i]];
if (a[i] + a[i] >= maxn - 1 || R[a[i] + 1] != R[a[i] + a[i]]) {
g[R[a[i] + 1] % a[i]].pb({i, id[R[a[i] + 1]]});
}
for (int j = a[i]; j < maxn && R[j]; j += a[i]) {
if (j + a[i] > maxn || R[j] != R[j + a[i]]) {
g[R[j] - j].pb({i, id[R[j]]});
}
}
}
for (int i = 0; i < maxn; ++i) {
for (auto it : g[i]) {
it.F = get(it.F);
it.S = get(it.S);
if (it.F == it.S) continue;
ans += i;
if (sz[it.F] > sz[it.S]) {
p[it.S] = it.F;
} else if (sz[it.F] < sz[it.S]) {
p[it.F] = it.S;
} else {
p[it.F] = it.S;
sz[it.F] ++;
}
}
}
printf("%d", ans);
}
Compilation message
sirni.cpp: In function 'int main()':
sirni.cpp:82:15: warning: use of an operand of type 'bool' in 'operator++' is deprecated [-Wdeprecated]
++ u[a[i]];
^
sirni.cpp:57:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &n);
~~~~~^~~~~~~~~~
sirni.cpp:59:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", a + i);
~~~~~^~~~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
357 ms |
281464 KB |
Output is correct |
2 |
Correct |
429 ms |
281464 KB |
Output is correct |
3 |
Correct |
349 ms |
281920 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
342 ms |
281920 KB |
Output is correct |
2 |
Correct |
839 ms |
281920 KB |
Output is correct |
3 |
Correct |
361 ms |
282036 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
365 ms |
282268 KB |
Output is correct |
2 |
Correct |
356 ms |
282268 KB |
Output is correct |
3 |
Correct |
355 ms |
282268 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
445 ms |
290728 KB |
Output is correct |
2 |
Correct |
625 ms |
317732 KB |
Output is correct |
3 |
Correct |
453 ms |
317732 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
357 ms |
317732 KB |
Output is correct |
2 |
Correct |
525 ms |
317732 KB |
Output is correct |
3 |
Correct |
416 ms |
317732 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
523 ms |
317732 KB |
Output is correct |
2 |
Correct |
655 ms |
330292 KB |
Output is correct |
3 |
Correct |
432 ms |
330292 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
369 ms |
330292 KB |
Output is correct |
2 |
Correct |
624 ms |
330292 KB |
Output is correct |
3 |
Correct |
427 ms |
330292 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
633 ms |
337532 KB |
Output is correct |
2 |
Correct |
4270 ms |
533684 KB |
Output is correct |
3 |
Correct |
676 ms |
533684 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
633 ms |
533684 KB |
Output is correct |
2 |
Execution timed out |
5137 ms |
608760 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
436 ms |
608760 KB |
Output is correct |
2 |
Execution timed out |
5050 ms |
608760 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |