Submission #481730

#	Time	Username	Problem	Language	Result	Execution time	Memory
481730		Johann	Sirni (COCI17_sirni)	C++14	42 / 140	5100 ms	786436 KiB

sirni

// https://oj.uz/problem/view/COCI17_sirni
#include<bits/stdc++.h>
using namespace std;

#define ll long long
#define vi vector<int>
#define vb vector<bool>
#define pii pair<int, int>
#define vpii vector<pii>
#define vvpii vector<vpii>

struct DSU {
    vi e;
    void init(int n) { e.assign(n, -1); }
    int get(int x) { return e[x] < 0 ? x : e[x] = get(e[x]); }
    bool connected(int a, int b) { return get(a) == get(b); }
    bool unite(int a, int b) {
        a = get(a), b = get(b); if (a == b) return 0;
        if (e[a] > e[b]) swap(a, b);
        e[a] += e[b]; e[b] = a;
        return 1;
    }
};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);

    int n;
    cin >> n;
    vi cards(n);
    for (int i = 0; i < n; i++) {
        cin >> cards[i];
    }
    sort(cards.begin(), cards.end());
    int mincard = cards[0];
    vvpii edges(mincard);
    int dist;
    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            dist = cards[j] % cards[i];
            if (dist < mincard) edges[dist].push_back(make_pair(i, j));
        }
    }

    DSU uf;
    uf.init(n);
    ll total = 0;
    int a, b;
    for (ll i = 0; i < mincard; i++) {
        for (pii edge : edges[i]) {
            tie(a, b) = edge;
            if (uf.unite(a, b)) total += i;
        }
    }
    cout << total << "\n";
}

• 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