oj.uz

답안 #633614

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
633614 2022-08-22T20:36:26 Z inksamurai Sirni (COCI17_sirni) C++17
84 / 140
 2745 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++;
			}
			rep(_,2){
				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=nxt[nj]+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 75 ms 82812 KB Output is correct
2 Correct 1041 ms 277684 KB Output is correct
3 Correct 93 ms 84272 KB Output is correct

Subtask #2
0 / 14.0

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

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 80 ms 83124 KB Output is correct
2 Correct 81 ms 81956 KB Output is correct
3 Correct 90 ms 83452 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 639 ms 185980 KB Output is correct
2 Correct 2260 ms 481488 KB Output is correct
3 Correct 993 ms 284412 KB Output is correct

Subtask #5
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 153 ms 99236 KB Output is correct
2 Correct 1246 ms 280824 KB Output is correct
3 Correct 746 ms 182152 KB Output is correct

Subtask #6
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1208 ms 284376 KB Output is correct
2 Correct 2702 ms 481488 KB Output is correct
3 Correct 817 ms 185888 KB Output is correct

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 370 ms 105320 KB Output is correct
2 Correct 2745 ms 481444 KB Output is correct
3 Correct 869 ms 284384 KB Output is correct

Subtask #8
0 / 14.0

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

Subtask #9
0 / 14.0

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

Subtask #10
0 / 14.0

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