제출 #949335

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
949335		vjudge1	Sirni (COCI17_sirni)	C++17	98 / 140	4138 ms	338060 KiB

sirni

#include <bits/stdc++.h>
#define int long long
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
using namespace std;
const int N=1e5+5;
int p[N];
int find_set(int v){
    if(p[v]==v)return v;
    return p[v]=find_set(p[v]);
}
bool union_set(int u,int v){
    u=find_set(u);
    v=find_set(v);
    if(u==v)return false;
    p[u]=v;
    return true;
}
signed main(){
    ios_base::sync_with_stdio();
    cin.tie(0);cout.tie(0);
    int n;
    cin>>n;
    vector <int> a(n);
    for(int i=0;i<n;i++)cin>>a[i];
    vector < vector <int> > v;
    sort(all(a));
    if(n<=1000){
        for(int i=0;i<n;i++){
            for(int j=i+1;j<n;j++){
                int x=min({a[i]%a[j],a[j]%a[i]});
                v.pb({x,i,j});
            }
        }
    }
    else{
        for(int i=0;i<n;i++){
            if(i-1>=0 && a[i]==a[i-1])continue;
            for(int j=a[i];j<=1e6;j+=a[i]){
                auto it=lower_bound(all(a),j);
                if(j==a[i])it=upper_bound(all(a),j);
                if(it!=a.end()){
                    int pos=it-a.begin();
                    v.pb({min(a[pos]%a[i],a[i]%a[pos]),pos,i});
                }
            }
        }
    }
    sort(all(v));
    for(int i=0;i<n;i++)p[i]=i;
    int ans=0;
    for(auto x : v){
        int w=x[0];
        int u=x[1];
        int v=x[2];
        //cout<<w<<" "<<u<<" "<<v<<"\n";
        if(union_set(u,v))ans+=w;
    }
    cout<<ans<<"\n";
}

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