# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
307568 |
2020-09-28T15:55:09 Z |
luciocf |
Sirni (COCI17_sirni) |
C++11 |
|
1298 ms |
786436 KB |
#include <bits/stdc++.h>
#define ff first
#define ss second
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int maxn = 1e5+10;
const int maxv = 1e7+1;
struct DSU
{
int pai[maxn], peso[maxn];
void init(int n)
{
for (int i = 1; i <= n; i++)
pai[i] = i, peso[i] = 1;
}
int Find(int x)
{
if (pai[x] == x) return x;
return pai[x] = Find(pai[x]);
}
void Join(int x, int y)
{
x = Find(x), y = Find(y);
if (x == y) return;
if (peso[x] < peso[y]) swap(x, y);
pai[y] = x, peso[x] += peso[y];
}
} dsu;
int a[maxn];
int prim[maxv];
int main(void)
{
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
sort(a+1, a+n+1);
int tot = 0;
for (int i = 1; i <= n; i++)
{
if (a[i] == a[i+1]) continue;
tot += (a[n]/a[i]);
}
int ptr = 2;
for (int i = a[1]; i <= a[n]; i++)
{
while (ptr <= n && a[ptr] < i)
ptr++;
prim[i] = ptr;
}
int m = 0;
dsu.init(n);
vector<pair<int, pii>> V(tot+1);
for (int i = 2; i <= n; i++)
V.push_back({a[i]-a[i-1], {i-1, i}});
for (int i = 1; i <= n; i++)
{
int j;
for (j = i; j <= n && a[i] == a[j]; j++)
if (j != i)
dsu.Join(i, j), m++;
i = j-1;
for (int v = 2*a[i]; v <= a[n]; v += a[i])
{
j = v;
for (; j <= a[n] && prim[j] == prim[v]; j += a[i])
;
j -= a[i];
v = j;
V.push_back({a[prim[v]]-v, {i, prim[v]}});
}
}
sort(V.begin(), V.end());
ll ans = 0;
for (auto pp: V)
{
if (m == n-1) break;
int u = pp.ss.ff, v = pp.ss.ss, w = pp.ff;
if (dsu.Find(u) != dsu.Find(v))
{
ans += 1ll*w;
dsu.Join(u, v), ++m;
}
}
printf("%lld\n", ans);
}
Compilation message
sirni.cpp: In function 'int main()':
sirni.cpp:47:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
47 | scanf("%d", &n);
| ~~~~~^~~~~~~~~~
sirni.cpp:50:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
50 | scanf("%d", &a[i]);
| ~~~~~^~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
36 ms |
39416 KB |
Output is correct |
2 |
Correct |
258 ms |
104312 KB |
Output is correct |
3 |
Correct |
37 ms |
39800 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
640 KB |
Output is correct |
2 |
Runtime error |
478 ms |
786432 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
34 ms |
39544 KB |
Output is correct |
2 |
Correct |
33 ms |
39464 KB |
Output is correct |
3 |
Correct |
37 ms |
39904 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
260 ms |
30200 KB |
Output is correct |
2 |
Correct |
970 ms |
103672 KB |
Output is correct |
3 |
Correct |
419 ms |
56696 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
40 ms |
8704 KB |
Output is correct |
2 |
Correct |
509 ms |
58080 KB |
Output is correct |
3 |
Correct |
269 ms |
28664 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
585 ms |
60024 KB |
Output is correct |
2 |
Correct |
1298 ms |
143380 KB |
Output is correct |
3 |
Correct |
370 ms |
50552 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
87 ms |
10240 KB |
Output is correct |
2 |
Correct |
1242 ms |
149164 KB |
Output is correct |
3 |
Correct |
362 ms |
53112 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
370 ms |
72056 KB |
Output is correct |
2 |
Runtime error |
504 ms |
786436 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
385 ms |
84088 KB |
Output is correct |
2 |
Runtime error |
496 ms |
786436 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
83 ms |
44160 KB |
Output is correct |
2 |
Runtime error |
494 ms |
786436 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
3 |
Halted |
0 ms |
0 KB |
- |