제출 #884435

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
884435		gutzzy	Sirni (COCI17_sirni)	C++14	42 / 140	524 ms	786432 KiB

sirni

#include <bits/stdc++.h>
using namespace std;

vector<int> par;

int find(int x){
    if(par[x]==x) return x;
    par[x] = find(par[x]);
    return par[x];
}

void merge(int x, int y){
    x = find(x);
    y = find(y);
    par[max(x,y)] = min(x,y);
}

int main(){
    int n;
    cin >> n;
    vector<int> ps(n);
    int m = 0;
    for(int i=0;i<n;i++){
        cin >> ps[i];
        m = max(m,ps[i])+1;
    }
    
    // minimum spanning tree
    
    vector<pair<int,pair<int,int>>> edges;
    par = vector<int>(m);
    for(int i=0;i<m;i++) par[i] = i;
    
    for(int i=0;i<n;i++){
        int l = ps[i];
        for(int j=i;j<n;j++){
            int r = ps[j];
            edges.push_back({min(l%r,r%l),{l,r}});
        }
    }
    
    sort(edges.begin(),edges.end());
    
    int ans = 0;
    int v = 0;
    
    for(auto e:edges){
        int a = e.second.first;
        int b = e.second.second;
        if(find(a)!=find(b)){
            merge(a,b);
            ans += e.first;
            v++;
            if(v==n-1) break;
        }
    }
    
    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