# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
715390 |
2023-03-26T15:21:32 Z |
fuad27 |
Sirni (COCI17_sirni) |
C++17 |
|
1085 ms |
107380 KB |
#include<bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
using namespace std;
struct DSU {
vector<int> e;
DSU(int N) {e = vector<int>(N, -1);}
int get(int x) { return e[x] < 0 ? x : e[x] = get(e[x]); }
bool same_set(int a, int b) { return get(a) == get(b); }
int size(int x) { return -e[get(x)]; }
bool unite(int x, int y) {
x = get(x), y = get(y);
if (x == y) return false;
if (e[x] > e[y]) swap(x, y);
e[x] += e[y]; e[y] = x; return true;
}
};
const int N=1e6+10;
int great[N];
vector<pair<int, pair<int,int>>> ed;
vector<int> v;
int main () {
cin.tie(0)->sync_with_stdio(0);
for(int i = 0;i<N;i++)great[i]=1e9;
int n;
cin >> n;
{
set<int> s;
for(int i = 0;i<n;i++) {
int a;
cin >> a;
s.insert(a);
}
v=vector<int>(s.begin(),s.end());
}
n=v.size();
for(int i = 0;i<n;i++)great[v[i]]=i;
for(int j = N-3;j>=0;j--) {
great[j]=min(great[j],great[j+1]);
}
for(int i=0;i<n;i++) {
for(int j=v[i];j<N-3;j+=v[i]) {
if(j!=v[i]) {
if(great[j]<n) {
ed.push_back({v[great[j]]-j,{i,great[j]}});
}
}
else if(great[j+1]<n) {
ed.push_back({v[great[j+1]]-j,{i,great[j+1]}});
}
}
}
sort(ed.begin(),ed.end());
DSU d(n+1);
long long sum=0;
for(auto i:ed) {
sum+=(int)d.unite(i.second.first,i.second.second)*i.first;
}
cout << sum << "\n";
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
6 ms |
8404 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
4436 KB |
Output is correct |
2 |
Runtime error |
7 ms |
8484 KB |
Execution killed with signal 11 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
7 ms |
8400 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
223 ms |
33692 KB |
Output is correct |
2 |
Correct |
741 ms |
58080 KB |
Output is correct |
3 |
Correct |
397 ms |
57368 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
33 ms |
7944 KB |
Output is correct |
2 |
Correct |
353 ms |
53896 KB |
Output is correct |
3 |
Correct |
230 ms |
32832 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
433 ms |
58236 KB |
Output is correct |
2 |
Correct |
1030 ms |
107380 KB |
Output is correct |
3 |
Correct |
375 ms |
33524 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
72 ms |
12108 KB |
Output is correct |
2 |
Correct |
1085 ms |
106416 KB |
Output is correct |
3 |
Correct |
353 ms |
33112 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
51 ms |
18564 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
65 ms |
18644 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
13 ms |
10380 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |