제출 #1042299

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1042299		Abito	Sirni (COCI17_sirni)	C++17	42 / 140	567 ms	786432 KiB

sirni

#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define ppb pop_back
#define ep insert
#define endl '\n'
#define elif else if
#define pow pwr
#define sqrt sqrtt
//#define int long long
#define ll long long
#define y1 YONE
typedef unsigned long long ull;
using namespace std;
const int N=1e7+5;
int a[N],n,par[N],sz[N];
int getpar(int x){
    if (x==par[x]) return x;
    return par[x]=getpar(par[x]);
}
void link(int x,int y){
    x=getpar(x);
    y=getpar(y);
    if (x==y) return;
    if (sz[x]>sz[y]) swap(x,y);
    sz[y]+=sz[x];
    par[x]=y;
    return;
}
int32_t main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    cin>>n;
    for (int i=1;i<=n;i++) cin>>a[i],par[i]=i,sz[i]=1;
    vector<vector<int>> v;
    for (int i=1;i<=n;i++){
        for (int j=i+1;j<=n;j++){
            v.pb({min(a[i]%a[j],a[j]%a[i]),i,j});
        }
    }
    sort(v.begin(),v.end());
    int ans=0;
    for (auto u:v){
        if (getpar(u[1])==getpar(u[2])) continue;
        link(u[1],u[2]);
        ans+=u[0];
    }cout<<ans<<endl;
    return 0;
}

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