# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
136433 |
2019-07-25T10:01:01 Z |
darkkcyan |
Sirni (COCI17_sirni) |
C++14 |
|
738 ms |
312840 KB |
#include <bits/stdc++.h>
using namespace std;
using namespace std::placeholders;
// #define rand __rand
// mt19937 rand(chrono::system_clock::now().time_since_epoch().count()); // or mt19937_64
#define llong long long
#define xx first
#define yy second
#define len(x) ((int)x.size())
#define rep(i,n) for (int i = -1; ++ i < n; )
#define rep1(i,n) for (int i = 0; i ++ < n; )
#define all(x) x.begin(), x.end()
template<class T>
using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
#define maxn 101010
#define maxval ((llong)1e7+10)
int n;
int a[maxn];
int dsu[maxn];
int n_set;
int findp(int u) { return u == dsu[u] ? u : dsu[u] = findp(dsu[u]); }
void join(int u, int v) {
u = findp(u);
v = findp(v);
if (u == v) return ;
if (rand() & 1) swap(u, v);
dsu[u] = v;
--n_set;
}
int lower_b[maxval] = {0};
vector<pair<int, int>> group[maxval];
int main(void) {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n;
rep(i, n) cin >> a[i];
sort(a, a + n);
n = (int)(unique(a, a + n) - a);
int f = 0;
rep(i, n) {
for (; f <= a[i]; ++f) lower_b[f] = i;
}
for (; f < maxval; ++f) lower_b[f] = n;
clog << "COOL" << endl;
llong cnt = 0;
rep(i, n) {
// clog << i << ' ' << a[i] << endl;
for (int k = 1; k * a[i] <= a[n - 1]; ++k) {
int t = lower_b[k * a[i]];
if (t != n and a[t] == a[i]) ++t;
if (t == n) break;
group[a[t] % a[i]].emplace_back(i, t);
k = a[t] / a[i];
++cnt;
}
}
clog << "nice" << ' ' << cnt << endl;
n_set = n;
rep1(i, n) dsu[i] = i;
llong ans = 0;
for (int cost = 0; cost < maxval and n_set != 1; ++cost) {
for (auto i: group[cost]) {
if (n_set == 1) break;
int src = i.xx, cur = i.yy;
if (findp(src) != findp(cur)) {
ans += cost;
join(src, cur);
}
int div = a[cur] / a[src];
++cur;
if (cur == n or a[cur] / a[src] != div) continue;
group[a[cur] % a[src]].emplace_back(src, cur);
}
}
cout << ans;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
254 ms |
274680 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
253 ms |
274392 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
269 ms |
274676 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
452 ms |
292836 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
300 ms |
276636 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
738 ms |
312840 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
321 ms |
281004 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
568 ms |
294044 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
506 ms |
289148 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
307 ms |
278792 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |