# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
307570 |
2020-09-28T15:56:24 Z |
luciocf |
Sirni (COCI17_sirni) |
C++11 |
|
5000 ms |
413688 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;
V.reserve(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 |
34 ms |
39288 KB |
Output is correct |
2 |
Correct |
91 ms |
41592 KB |
Output is correct |
3 |
Correct |
44 ms |
39416 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
512 KB |
Output is correct |
2 |
Correct |
286 ms |
40188 KB |
Output is correct |
3 |
Correct |
35 ms |
39544 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
33 ms |
39416 KB |
Output is correct |
2 |
Correct |
34 ms |
39416 KB |
Output is correct |
3 |
Correct |
44 ms |
39548 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
204 ms |
17400 KB |
Output is correct |
2 |
Correct |
717 ms |
50936 KB |
Output is correct |
3 |
Correct |
276 ms |
23032 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
28 ms |
6144 KB |
Output is correct |
2 |
Correct |
377 ms |
31352 KB |
Output is correct |
3 |
Correct |
195 ms |
15736 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
433 ms |
32632 KB |
Output is correct |
2 |
Correct |
896 ms |
63808 KB |
Output is correct |
3 |
Correct |
250 ms |
21368 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
64 ms |
5760 KB |
Output is correct |
2 |
Correct |
847 ms |
61008 KB |
Output is correct |
3 |
Correct |
237 ms |
20728 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
297 ms |
54776 KB |
Output is correct |
2 |
Correct |
4799 ms |
308728 KB |
Output is correct |
3 |
Correct |
346 ms |
58104 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
280 ms |
54776 KB |
Output is correct |
2 |
Execution timed out |
5100 ms |
413688 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
70 ms |
41848 KB |
Output is correct |
2 |
Execution timed out |
5122 ms |
411640 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |