제출 #412759

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
412759		kshitij_sodani	Sirni (COCI17_sirni)	C++14	0 / 140	669 ms	436032 KiB

sirni

//#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define mp make_pair
#define pb push_back
#define a first 
#define b second
#define endl '\n'

llo n;
bool vis[10000001];
llo ind[10000001];
llo re[10000001+1];
llo par[100001];
llo find(llo no){
	if(par[no]==no){
		return no;
	}
	par[no]=find(par[no]);
	return par[no];
}
vector<pair<llo,llo>> pre[10000001];
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin>>n;
	llo ind2=0;

	for(llo i=0;i<n;i++){
		llo x;
		cin>>x;
		if(vis[x]==0){
			vis[x]=1;
			ind[x]=ind2;
			//cout<<x<<":"<<ind2<<endl;
			ind2++;
		}
	}	
	for(llo i=0;i<ind2;i++){
		par[i]=i;
	}
	re[10000001]=-1;
	for(llo i=10000000;i>=1;i--){
		re[i]=re[i+1];
		if(vis[i]==1){
			re[i]=i;
		}
	}
	for(llo i=1;i<=10000000;i++){
		if(vis[i]==1){
			for(llo j=i;j<=10000000;j+=i){
				if(re[j]>=0){
					pre[re[j]-j].pb({ind[re[j]],ind[i]});
				}
			}
		}
	}
	llo ans=0;
	for(llo i=0;i<=10000000;i++){
		for(auto j:pre[i]){
			llo x=find(j.a);
			llo y=find(j.b);
			//cout<<x<<","<<y<<","<<j.a<<","<<j.b<<endl;
			if(x==y){

			}
			else{
				ans+=i;
				par[x]=y;
			}
		}
	}
	cout<<ans<<endl;






	return 0;
}
 

• Subtask 1: 0 / 14
• Subtask 2: 0 / 14
• Subtask 3: 0 / 14
• Subtask 4: 0 / 14
• Subtask 5: 0 / 14
• Subtask 6: 0 / 14
• Subtask 7: 0 / 14
• Subtask 8: 0 / 14
• Subtask 9: 0 / 14
• Subtask 10: 0 / 14