#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define mp make_pair
typedef pair<int, int> ii;
typedef long long ll;
const int len = 1e5+2;
int cnt[100*len], nex[100*len][2], p[len], r[len];
int cnt_sz[100*len];
vector<ii> vec[100*len];
int fin(int i){
if (p[i] == i) return i;
return p[i] = fin(p[i]);
}
void join(int i, int j){
if (r[i] > r[j])
p[j] = i;
else{
p[i] = j;
if (r[i] == r[j]) r[j]++;
}
}
void read(int &res){
char c;
while (c = getchar(), c < '0' || c > '9'){}
res = c-'0';
while (c = getchar(), c >= '0' && c <= '9')
res = 10*res+c-'0';
}
int main(){
int n, m = 0, k = 0;
read(n);
for (int i = 0; i < n; i++){
int temp;
read(temp);
m = max(m, temp);
if (!cnt[temp]) cnt[temp] = ++k;
}
for (int i = m; i >= 1; i--){
nex[i][0] = nex[i+1][0];
if (cnt[i]) nex[i][0] = i;
nex[i][1] = nex[i+1][1];
if (cnt[i+1]) nex[i][1] = i+1;
}
for (int i = 1; i <= k; i++){
r[i] = 0;
p[i] = i;
}
for (int i = 1; i <= m; i++) {
if (cnt[i]) {
for (int j = i; j <= m; j+=i){
if (j == i && nex[j][1] && nex[j][1] < j+i)
cnt_sz[nex[j][1]-j]++;
else if (j != i && nex[j][0] && nex[j][0] < j+i);
cnt_sz[nex[j][0]-j]++;
}
}
}
for (int i = 0; i <= m; i++){
if (cnt_sz[i])
vec[i].reserve(cnt_sz[i]);
}
for (int i = 1; i <= m; i++)
if (cnt[i])
for (int j = i; j <= m; j+=i){
if (j == i && nex[j][1] && nex[j][1] < j+i)
vec[nex[j][1]-j].pb(mp(cnt[i], cnt[nex[j][1]]));
else if (j != i && nex[j][0] && nex[j][0] < j+i);
vec[nex[j][0]-j].pb(mp(cnt[i], cnt[nex[j][0]]));
}
ll ans = 0;
for (int i = 0; i <= m; i++){
if (k == 1) break;
for (auto it : vec[i]){
if (k == 1) break;
int x = fin(it.fi), y = fin(it.se);
if (x != y)
join(x, y), ans += i, k--;
}
}
printf("%lld\n", ans);
return 0;
}
Compilation message
sirni.cpp: In function 'int main()':
sirni.cpp:67:22: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
else if (j != i && nex[j][0] && nex[j][0] < j+i);
^~
sirni.cpp:68:21: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
cnt_sz[nex[j][0]-j]++;
^~~~~~
sirni.cpp:83:22: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
else if (j != i && nex[j][0] && nex[j][0] < j+i);
^~
sirni.cpp:84:21: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
vec[nex[j][0]-j].pb(mp(cnt[i], cnt[nex[j][0]]));
^~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
299 ms |
317560 KB |
Output is correct |
2 |
Correct |
1347 ms |
339064 KB |
Output is correct |
3 |
Correct |
304 ms |
339064 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
185 ms |
339064 KB |
Output is correct |
2 |
Execution timed out |
5070 ms |
691828 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
307 ms |
691828 KB |
Output is correct |
2 |
Correct |
317 ms |
691828 KB |
Output is correct |
3 |
Correct |
304 ms |
691828 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
326 ms |
691828 KB |
Output is correct |
2 |
Correct |
684 ms |
691828 KB |
Output is correct |
3 |
Correct |
362 ms |
691828 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
223 ms |
691828 KB |
Output is correct |
2 |
Correct |
482 ms |
691828 KB |
Output is correct |
3 |
Correct |
242 ms |
691828 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
520 ms |
691828 KB |
Output is correct |
2 |
Correct |
742 ms |
691828 KB |
Output is correct |
3 |
Correct |
327 ms |
691828 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
204 ms |
691828 KB |
Output is correct |
2 |
Correct |
648 ms |
691828 KB |
Output is correct |
3 |
Correct |
337 ms |
691828 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
831 ms |
691828 KB |
Output is correct |
2 |
Execution timed out |
5050 ms |
691828 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
906 ms |
691828 KB |
Output is correct |
2 |
Execution timed out |
5022 ms |
691828 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
412 ms |
691828 KB |
Output is correct |
2 |
Execution timed out |
5119 ms |
691828 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |