# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
715394 |
2023-03-26T15:25:32 Z |
fuad27 |
Sirni (COCI17_sirni) |
C++17 |
|
3383 ms |
786432 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=1e7+10;
int great[N];
vector<pair<int,int>> ed[N];
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[v[great[j]]-j].push_back({i,great[j]});
}
}
else if(great[j+1]<n) {
ed[v[great[j+1]]-j].push_back({i,great[j+1]});
}
}
}
DSU d(2*n+1);
long long sum=0;
for(int i = 0;i<N-3;i++) {
for(auto j:ed[i]) {
sum+=(int)d.unite(j.second,j.first)*i;
}
}
cout << sum << "\n";
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
159 ms |
274376 KB |
Output is correct |
2 |
Correct |
395 ms |
307156 KB |
Output is correct |
3 |
Correct |
160 ms |
274900 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
185 ms |
274436 KB |
Output is correct |
2 |
Runtime error |
2062 ms |
786432 KB |
Execution killed with signal 9 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
172 ms |
274328 KB |
Output is correct |
2 |
Correct |
154 ms |
274372 KB |
Output is correct |
3 |
Correct |
186 ms |
274440 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
330 ms |
285652 KB |
Output is correct |
2 |
Correct |
824 ms |
313920 KB |
Output is correct |
3 |
Correct |
370 ms |
296068 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
177 ms |
276420 KB |
Output is correct |
2 |
Correct |
524 ms |
298020 KB |
Output is correct |
3 |
Correct |
365 ms |
285464 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
477 ms |
297056 KB |
Output is correct |
2 |
Correct |
822 ms |
332156 KB |
Output is correct |
3 |
Correct |
367 ms |
293372 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
301 ms |
278244 KB |
Output is correct |
2 |
Correct |
813 ms |
335284 KB |
Output is correct |
3 |
Correct |
358 ms |
294432 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
329 ms |
288772 KB |
Output is correct |
2 |
Correct |
1829 ms |
633280 KB |
Output is correct |
3 |
Correct |
381 ms |
291964 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
324 ms |
293040 KB |
Output is correct |
2 |
Runtime error |
2747 ms |
786432 KB |
Execution killed with signal 9 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
184 ms |
276700 KB |
Output is correct |
2 |
Correct |
3383 ms |
656696 KB |
Output is correct |
3 |
Correct |
354 ms |
294816 KB |
Output is correct |