# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
66551 | 2018-08-11T11:43:55 Z | KLPP | Sirni (COCI17_sirni) | C++14 | 0 ms | 0 KB |
#include<algorithm> #include<stdio.h> using namespace std; #define MAXP 10000000 int pnt[MAXP+5]; int parent[1000000]; int size[1000000]; 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(arr[0]==1){ printf("0"); return; } int pn=1; for(int i=1;i<n;i++){ if(arr[i]!=arr[pn-1]){ arr[pn]=arr[i]; pn++; } } n=pn; int k=arr[n-1]; for(int i=0;i<k+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; for(int i=0;i<n;i++){ parent[i]=i; size[i]=1; } 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<k;j+=arr[i]){ if(pnt[j]!=-1 && !component(i,pnt[j])){ merge(i,pnt[j]); CC--; ans+=round; } } } } round++; }printf("%lld",ans); return 0; }