oj.uz

답안 #633617

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
633617 2022-08-22T20:39:47 Z inksamurai Sirni (COCI17_sirni) C++17
84 / 140
 1123 ms 786432 KB 
#include <bits/stdc++.h>
#define int ll
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define rng(i,c,n) for(int i=c;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define vec(...) vector<__VA_ARGS__>
#define _3PGDklf ios::sync_with_stdio(0),cin.tie(0)
typedef long long ll;
using pii=pair<int,int>;
using vi=vector<int>;
void print(){cout<<'\n';}
template<class h,class...t>
void print(const h&v,const t&...u){cout<<v<<' ',print(u...);}
// e

struct dsu{
	int _n;
	vi si,par,leb;
	dsu(int n=0){
		init(n);
	}
	void init(int n=0){
		_n=n;
		par=vi(_n,0);
		si=vi(_n,0);
		leb=vi(_n,-1);
		rep(i,n){
			si[i]=1;
			par[i]=i;
		}	
	}
	int parent(int u){return par[u]=(par[u]==u?u:parent(par[u]));}
	bool same(int u,int v){return parent(u)==parent(v);}
	void merge(int u,int v){
		u=parent(u),v=parent(v);
		if(!same(u,v)){
			if(si[u]<si[v]) swap(u,v);
			leb[u]=max(leb[u],leb[v]);
			_n-=1;
			si[u]+=si[v];
			par[v]=u;
		}
	}
	int size(int v=-1){return v==-1?_n:si[parent(v)];}
};

const int _n=10000100;

int nxt[_n],usd[_n];

signed main(){
_3PGDklf;
	int n;
	cin>>n;
	vi a(n);
	rep(i,n){
		cin>>a[i];
	}
	sort(a.begin(), a.end());
	a.erase(unique(a.begin(), a.end()),a.end());
	if(a[0]==1){
		print(0);
		return 0;
	}
	n=sz(a);
	rep(i,n){
		usd[a[i]]=i+1;
	}
	per(i,_n-1){
		if(usd[i]){
			nxt[i]=usd[i];
		}else{
			nxt[i]=nxt[i+1];
		}
	}
	using T=pair<int,pii>;
	vec(T) es;
	for(int i=2;i<_n;i++){
		if(!usd[i]) continue;
		for(int j=0;j<_n;j+=i){
			int nj=j;
			if(j==i){
				nj++;
			}
			{
				int id=nxt[nj];
				if(id){
					id-=1;
					es.pb(T(min(i%a[id],a[id]%i),pii(usd[i]-1,id)));
				}else{
					break;
				}
				// nj=a[id]+1;
			}
		}
	}
	sort(es.begin(), es.end());
	dsu uf(n);
	int ans=0;
	for(auto&tp:es){
		int u=tp.se.fi,v=tp.se.se;
		if(!uf.same(u,v)){
			ans+=tp.fi;
			uf.merge(u,v);
		}
	}
	assert(uf.size()==1);
	print(ans);
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 73 ms 82792 KB Output is correct
2 Correct 404 ms 179188 KB Output is correct
3 Correct 95 ms 83484 KB Output is correct

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 72 ms 79264 KB Output is correct
2 Runtime error 648 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 74 ms 83064 KB Output is correct
2 Correct 73 ms 81720 KB Output is correct
3 Correct 70 ms 83148 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 297 ms 136712 KB Output is correct
2 Correct 859 ms 284416 KB Output is correct
3 Correct 438 ms 185948 KB Output is correct

Subtask #5
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 118 ms 92860 KB Output is correct
2 Correct 490 ms 182456 KB Output is correct
3 Correct 280 ms 132740 KB Output is correct

Subtask #6
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 581 ms 185944 KB Output is correct
2 Correct 1097 ms 284400 KB Output is correct
3 Correct 391 ms 136924 KB Output is correct

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 137 ms 92956 KB Output is correct
2 Correct 1123 ms 284564 KB Output is correct
3 Correct 403 ms 185940 KB Output is correct

Subtask #8
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 358 ms 206596 KB Output is correct
2 Runtime error 712 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #9
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 420 ms 206564 KB Output is correct
2 Runtime error 659 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 141 ms 135120 KB Output is correct
2 Runtime error 780 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -