Submission #884430

#	Time	Username	Problem	Language	Result	Execution time	Memory
884430		gutzzy	Sirni (COCI17_sirni)	C++14	42 / 140	1497 ms	786432 KiB

sirni

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

int find(int x, vector<int> &par){
    if(par[x]==x) return x;
    par[x] = find(par[x],par);
    return par[x];
}

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

int main(){
    int n;
    cin >> n;
    vector<int> ps(n);
    unordered_map<int,int> pton;
    for(int i=0;i<n;i++){
        cin >> ps[i];
        pton[ps[i]] = i; // si p son diferents!! (no ho diu a l'enunciat..)
    }
    
    // minimum spanning tree
    
    vector<pair<int,pair<int,int>>> edges;
    vector<int> par(n);
    for(int i=0;i<n;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),{pton[l],pton[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,par)!=find(b,par)){
            merge(a,b,par);
            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