# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
715399 |
2023-03-26T15:36:33 Z |
fuad27 |
Sirni (COCI17_sirni) |
C++11 |
|
3260 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;
DSU d(1e5+10);
int main () {
cin.tie(0)->sync_with_stdio(0);
for(int i = 0;i<N;i++)great[i]=1e9;
int n;
cin >> n;
v.resize(n);
{
for(int i = 0;i<n;i++) {
cin >> v[i];
}
sort(v.begin(), v.end() );
v.erase( unique( v.begin(), v.end() ), v.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]});
}
}
}
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 |
143 ms |
274744 KB |
Output is correct |
2 |
Correct |
369 ms |
307316 KB |
Output is correct |
3 |
Correct |
151 ms |
275140 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
195 ms |
274872 KB |
Output is correct |
2 |
Runtime error |
1987 ms |
786432 KB |
Execution killed with signal 9 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
148 ms |
274816 KB |
Output is correct |
2 |
Correct |
144 ms |
274616 KB |
Output is correct |
3 |
Correct |
142 ms |
274932 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
279 ms |
284676 KB |
Output is correct |
2 |
Correct |
588 ms |
314268 KB |
Output is correct |
3 |
Correct |
326 ms |
297220 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
172 ms |
276656 KB |
Output is correct |
2 |
Correct |
521 ms |
298828 KB |
Output is correct |
3 |
Correct |
336 ms |
284840 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
456 ms |
297660 KB |
Output is correct |
2 |
Correct |
724 ms |
332468 KB |
Output is correct |
3 |
Correct |
335 ms |
293460 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
273 ms |
278064 KB |
Output is correct |
2 |
Correct |
764 ms |
335916 KB |
Output is correct |
3 |
Correct |
319 ms |
296188 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
269 ms |
288452 KB |
Output is correct |
2 |
Correct |
1683 ms |
633688 KB |
Output is correct |
3 |
Correct |
289 ms |
291380 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
273 ms |
292712 KB |
Output is correct |
2 |
Runtime error |
2906 ms |
786432 KB |
Execution killed with signal 9 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
172 ms |
276852 KB |
Output is correct |
2 |
Correct |
3260 ms |
657032 KB |
Output is correct |
3 |
Correct |
335 ms |
295808 KB |
Output is correct |