| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 248330 |
2020-07-12T09:00:58 Z |
kartel |
Sirni (COCI17_sirni) |
C++14 |
|
5000 ms |
245244 KB |
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("Ofast,nso-stack-protector,unroll-loops,fast-math,-O3")
#define F first
#define S second
#define pb push_back
#define N +100500
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e9)
#define el '\n'
#define Max_P int(1e7)
//#define el endl
#define pii pair <int, int>
#define err ld(1e-9)
#define last(x) x.back()
#define all(x) (x).begin(), (x).end()
#define arr_all(x, n) (x + 1), (x + 1 + n)
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;
int pr[N], ra[N], i, j, n, p[N], ost, x, y, linked = 0, siz[N];
ll ans;
vector <int> P[Max_P + 50];
set <int> se;
int f(int x)
{
if (pr[x] != x) return (pr[x] = f(pr[x]));
return x;
}
void link(int x, int y)
{
x = f(x);
y = f(y);
if (x == y) return;
siz[x] += siz[y];
siz[y] = siz[x];
if (siz[x] == n) {cout << ans << el;exit(0);linked = 1;}
if (ra[x] > ra[y]) pr[x] = y;
else
{
pr[y] = x;
if (ra[x] == ra[y]) ra[y]++;
}
}
int main()
{
srand(time(0));
ios_base::sync_with_stdio(0);
iostream::sync_with_stdio(0);
ios::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
// in("input.txt");
// out("output.txt");
cin >> n;
for (i = 1; i <= n; i++)
cin >> p[i], pr[i] = i, ra[i] = 1, siz[i] = 1, se.insert(p[i]);
if (n <= 1000)
{
vector <pair <int, pair <int, int> > > g;
for (i = 1; i <= n; i++)
for (j = i + 1; j <= n; j++)
{
int a = max(p[i], p[j]);
int b = min(p[i], p[j]);
g.pb({a % b, {i, j}});
}
sort(all(g));
reverse(all(g));
while (sz(g))
{
int a = g.back().S.F, b = g.back().S.S;
int cost = g.back().F;
g.pop_back();
if (f(a) != f(b))
{
ans += cost;
link(a, b);
}
}
}
else
{
for (i = 1; i <= n; i++)
P[p[i]].pb(i);
for (ost = 0; !linked; ost++)
for (auto x : se)
{
if (linked) break;
if (x < ost + 1) continue;
if ((Max_P - ost + x - 1) / x < sz(se))
{
for (y = x; y <= Max_P - ost && !linked; y += x)
{
if (y + ost != x && !sz(P[y + ost])) continue;
for (auto a : P[y + ost])
if (f(a) != f(P[x][0]))
ans += ost, link(a, P[x][0]);
}
}
else
{
for (auto y : se)
{
if (y % x != ost) continue;
for (auto a : P[y])
if (f(a) != f(P[x][0]))
ans += ost, link(a, P[x][0]);
}
}
}
}
cout << ans << el;
}
//
//00000
//00110
//00111
//00011
//00000
Compilation message
sirni.cpp:7:76: warning: bad option '-fnso-stack-protector' to pragma 'optimize' [-Wpragmas]
#pragma GCC optimize("Ofast,nso-stack-protector,unroll-loops,fast-math,-O3")
^
sirni.cpp:35:12: warning: bad option '-fnso-stack-protector' to attribute 'optimize' [-Wattributes]
int f(int x)
^
sirni.cpp:41:23: warning: bad option '-fnso-stack-protector' to attribute 'optimize' [-Wattributes]
void link(int x, int y)
^
sirni.cpp:60:10: warning: bad option '-fnso-stack-protector' to attribute 'optimize' [-Wattributes]
int main()
^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
169 ms |
241512 KB |
Output is correct |
| 2 |
Correct |
204 ms |
241640 KB |
Output is correct |
| 3 |
Correct |
206 ms |
241640 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
194 ms |
241512 KB |
Output is correct |
| 2 |
Correct |
214 ms |
241512 KB |
Output is correct |
| 3 |
Correct |
191 ms |
241528 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
186 ms |
241512 KB |
Output is correct |
| 2 |
Correct |
176 ms |
241512 KB |
Output is correct |
| 3 |
Correct |
183 ms |
241512 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2054 ms |
244396 KB |
Output is correct |
| 2 |
Correct |
3586 ms |
243832 KB |
Output is correct |
| 3 |
Correct |
423 ms |
243064 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
586 ms |
236664 KB |
Output is correct |
| 2 |
Correct |
3465 ms |
238044 KB |
Output is correct |
| 3 |
Correct |
2283 ms |
242936 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3538 ms |
244320 KB |
Output is correct |
| 2 |
Correct |
1162 ms |
244728 KB |
Output is correct |
| 3 |
Correct |
456 ms |
244600 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1329 ms |
238712 KB |
Output is correct |
| 2 |
Correct |
1994 ms |
243064 KB |
Output is correct |
| 3 |
Correct |
415 ms |
243576 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2875 ms |
244600 KB |
Output is correct |
| 2 |
Correct |
805 ms |
245244 KB |
Output is correct |
| 3 |
Correct |
2665 ms |
244472 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
732 ms |
244688 KB |
Output is correct |
| 2 |
Correct |
2724 ms |
243628 KB |
Output is correct |
| 3 |
Correct |
293 ms |
244356 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2219 ms |
237108 KB |
Output is correct |
| 2 |
Execution timed out |
5102 ms |
242428 KB |
Time limit exceeded |
| 3 |
Halted |
0 ms |
0 KB |
- |
