제출 #1026738

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

sirni

#include <bits/stdc++.h>

using namespace std;

int parent[100005], sz[100005];

int Find(int x) {
    if (x==parent[x])
        return x;
    return parent[x]=Find(parent[x]);
}

void Union(int a, int b) {
    a=Find(a), b=Find(b);
    if (a==b) return;
    if (sz[a]<sz[b])
        swap(a,b);
    sz[a]+=sz[b];
    parent[b]=a;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    int a[n];
    for (int i=0;i<n;i++)
        cin >> a[i];
    vector<pair<int, pair<int,int> > > v;
    for (int i=0;i<n;i++) {
        for (int j=i+1;j<n;j++) {
            int dolz=min(a[i]%a[j], a[j]%a[i]);
            v.push_back({dolz, {i,j}});
        }
    }
    for (int i=0;i<n;i++)
        sz[i]=1, parent[i]=i;
    sort(v.begin(), v.end());
    int rez=0;
    for (auto [dolz, edge]:v) {
        int a=edge.first, b=edge.second;
        if (Find(a)!=Find(b)) {
            rez+=dolz;
            Union(a, b);
        }
    }
    cout << rez;

    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