# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
66532 | KLPP | Sirni (COCI17_sirni) | C++14 | 5055 ms | 41560 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<iostream>
#include<vector>
#include<queue>
#include<algorithm>
#include<stdio.h>
using namespace std;
#define MAXP 10000000
int pnt[MAXP+5];
int parent[1000000];
int size[1000000];
void begin(int n){
for(int i=0;i<n;i++){
parent[i]=i;
size[i]=1;
}
}
int root(int x){
if(parent[x]==x)return x;
parent[x]=root(parent[x]);
return parent[x];
}
bool component(int a, int b){
a=root(a);
b=root(b);
if(root(a)==root(b))return true;
return false;
}
void merge(int a, int b){
a=root(a);
b=root(b);
if(a==b)return;
if(size[a]<size[b]){
size[b]+=size[a];
parent[a]=b;
return;
}
size[a]+=size[b];
parent[b]=a;
}
int main(){
int n;
scanf("%d",&n);
int arr[n];
for(int i=0;i<n;i++)scanf("%d",&arr[i]);
sort(arr,arr+n);
if(n<=1000){
vector<pair<int,pair<int,int> > >Edges;
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
Edges.push_back(pair<int,pair<int,int> >(arr[j]%arr[i],pair<int,int>(i,j)));
}
}
sort(Edges.begin(),Edges.end());
begin(n);
long long int ans=0;
int CC=n;
for(int i=0;i<Edges.size() && CC>1;i++){
int x,y;
x=Edges[i].second.first;
y=Edges[i].second.second;
if(!component(x,y)){
merge(x,y);
CC--;
ans+=Edges[i].first;
}
//cout<<x<<" "<<y<<endl;
}cout<<ans<<endl;
return 0;
}
vector<int> array;
array.push_back(arr[0]);
for(int i=1;i<n;i++){
if(arr[i]!=arr[i-1]){
array.push_back(arr[i]);
}
}
n=array.size();
for(int i=0;i<n;i++)arr[i]=array[i];
for(int i=0;i<MAXP+5;i++)pnt[i]=-1;
for(int i=0;i<n;i++){
pnt[arr[i]-1]=i;
}
long long int ans=0;
int CC=n;
begin(n);
int round=0;
while(CC>1){
//Plog(n)
for(int i=0;i<n;i++){
if(arr[i]>round){
for(int j=arr[i]+round-1;j<MAXP+5;j+=arr[i]){
if(pnt[j]!=-1 && !component(i,pnt[j])){
merge(i,pnt[j]);
CC--;
ans+=round;
}
}
}
}
round++;
}printf("%lld\n",ans);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |