Submission #1026536

#	Time	Username	Problem	Language	Result	Execution time	Memory
1026536		vjudge1	Sirni (COCI17_sirni)	C++17	42 / 140	1075 ms	786432 KiB

sirni

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

int n, p[100000], dsu[100000], h[100000];
priority_queue<pair<int, pair<int, int> > > q;

int findRoot(int k) {
    while(dsu[k] != k) 
        k = dsu[k];
    return k;
}

void unite(int a, int b) {
    a = findRoot(a);
    b = findRoot(b);
    if(h[a] > h[b])
        swap(a, b);
    dsu[a] = b;
    h[b] = max(h[a] + 1, h[b]);
}

int main() {
    cin>>n;
    for(int i = 0; i < n; i++) {
        cin>>p[i];
        dsu[i] = i;
        h[i] = 1;
    }
    for(int i = 0; i < n; i++)
        for(int j = i + 1; j < n; j++)
            q.push({-(max(p[i], p[j]) % min(p[i], p[j])), {i, j}});
    long long res = 0;
    while(q.size()) {
        int d = -q.top().first;
        int a = q.top().second.first;
        int b = q.top().second.second;
        q.pop();
        //cout<<endl<<"d: "<<d<<" a: "<<a<<" b: "<<b;
        if(findRoot(a) == findRoot(b))
            continue;
        //cout<<" +";
        unite(a, b);
        res += d;
    }
    //cout<<endl;
    cout<<res<<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