oj.uz

Submission #863237

# Submission time Handle Problem Language Result Execution time Memory
863237 2023-10-19T20:53:39 Z blacktulip Sirni (COCI17_sirni) C++17
56 / 140
 2225 ms 437012 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long lo;

#define fi first
#define se second
#define endl "\n"
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)
#define _ << " " <<

const lo inf = 1000000000;
const lo li = 500005;
const lo mod = 1000000007;

int n,m,a[li],k,flag,t,fa[li],vis[10000005];
long long cev;
string s;
vector<pair<int,pair<int,int>>> v;
set<pair<int,int>> st;

inline int dsu(int x){
	if(x==fa[x])return x;
	return fa[x]=dsu(fa[x]);
}

int main(void){
	//~ fio();
	cin>>n;
	FOR{
		fa[i]=i;
		cin>>a[i];	
	}
	sort(a+1,a+n+1);
	if(a[1]==1){cout<<"0\n";return 0;}
	FOR st.insert({a[i],i});
	FOR{
		if(a[i]==a[i-1]){
			v.pb({0,{i-1,i}});
			continue;
		}
		if(vis[a[i]]){v.pb({0,{i,vis[a[i]]}});continue;}
		int mn=1000000000;
		int ind=-1;
		for(int j=a[i];j<=10000000;j+=a[i]){
			if(!vis[j])vis[j]=i;
			auto it=st.lower_bound({j,-inf});
			if(j==a[i])it=st.upper_bound({j,inf});
			if(it!=st.end()){
				v.pb({it->fi-j,{it->se,i}});
				if(it->fi-j<mn){mn=it->fi-j;ind=it->se;}
			}
		}
		//~ cout<<i<<" ()() "<<endl;
		if(~ind)v.pb({mn,{ind,i}});
	}
	int last=0,ind=0,cnt=1;
	for(int i=1;i<=n;i++){
		while(cnt<a[i]){
			//~ cout<<vis[cnt]<<" () "<<a[i]<<endl;
			//~ if(vis[cnt] && vis[cnt]!=i){last=cnt;ind=vis[cnt];}
			if(vis[cnt]){last=cnt;ind=vis[cnt];}
			cnt++;
		}
		if(ind)v.pb({a[i]-last,{ind,i}});
	}
	sort(v.begin(),v.end());
	for(auto go:v){
		int co=go.fi;
		int x=go.se.fi;
		int y=go.se.se;
		//~ cout<<x<<" () "<<y<<" () "<<co<<endl;
		if(dsu(x)==dsu(y))continue;
		
		fa[dsu(x)]=dsu(y);
		cev+=co;
	}
	cout<<cev<<endl;
	return 0;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 20316 KB Output is correct
2 Correct 430 ms 91628 KB Output is correct
3 Correct 27 ms 39508 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 167 ms 41768 KB Output is correct
2 Correct 2173 ms 437012 KB Output is correct
3 Correct 35 ms 43208 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 21084 KB Output is correct
2 Correct 11 ms 11868 KB Output is correct
3 Correct 19 ms 29468 KB Output is correct

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1183 ms 60384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 182 ms 47248 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1669 ms 73804 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1047 ms 50896 KB Output is correct
2 Correct 2225 ms 96704 KB Output is correct
3 Correct 2029 ms 73644 KB Output is correct

Subtask #8
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 450 ms 72108 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 480 ms 72624 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 80 ms 46540 KB Output isn't correct
2 Halted 0 ms 0 KB -