# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
934855 | PieArmy | Sirni (COCI17_sirni) | C++17 | 5039 ms | 786432 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
typedef long long ll;
ll pie(ll army){return (1ll<<army);}
#include <bits/stdc++.h>
#define fr first
#define sc second
#define pb push_back
#define endl '\n';
#define mid ((left+right)>>1)
const ll inf=2000000000000000005;
const int sonsuz=2000000005;
using namespace std;
ll fpow(ll x,ll y,ll m=0){if(y<0){cout<<"powError";return -1;}if(m)x%=m;ll res=1;while(y>0){if(y&1)res*=x;x*=x;if(m){x%=m;res%=m;}y>>=1;}return res;}
struct DSU{
int n;
vector<int>par,siz;
DSU(int N){
n=N;
par.resize(n);iota(par.begin(),par.end(),0);
siz.resize(n,1);
}
int get(int x){
if(par[x]==x)return x;
return par[x]=get(par[x]);
}
bool unite(int x,int y){
x=get(x);y=get(y);
if(x==y)return false;
if(siz[x]<siz[y])swap(x,y);
par[y]=x;
siz[x]+=siz[y];
return true;
}
};
void code(){
int n;cin>>n;
int arr[n];for(int &x:arr)cin>>x;
sort(arr,arr+n);
int mx=arr[n-1];
vector<int>v;
int las=-1;
for(int i=0;i<n;i++){
if(arr[i]!=las)v.pb(arr[i]);
las=arr[i];
}
n=v.size();
vector<int>nex(mx+2);
int pos=n-1;
for(int i=mx+1;i>=0;i--){
nex[i]=pos;
if(pos&&(i==v[pos-1])){
pos--;
nex[i]=pos;
}
}
priority_queue<vector<int>>pq;
for(int i=0;i<n;i++){
for(int j=v[i];j<=mx;j+=v[i]){
if(nex[j]==i){
pq.push({j-v[nex[j+1]],i,nex[j+1]});
continue;
}
pq.push({j-v[nex[j]],i,nex[j]});
}
}
ll ans=0;
DSU dsu(n);
while(pq.size()){
int cos=-pq.top()[0],a=pq.top()[1],b=pq.top()[2];
pq.pop();
if(dsu.unite(a,b))
ans+=cos;
}
cout<<ans;
}
int main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);
bool usaco=0;if(usaco){freopen(".in","r",stdin);freopen(".out","w",stdout);}
int t=1;
if(!t)cin>>t;
while(t--){code();cout<<endl;}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |