Submission #481715

#	Time	Username	Problem	Language	Result	Execution time	Memory
481715		Johann	Sirni (COCI17_sirni)	C++14	42 / 140	5071 ms	1868 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>

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];
    }
    int next = 0, curr = 0;
    vb visited(n, false);
    ll total = 0;
    vi dists(n, INT_MAX);
    for (int i = 0; i < n-1; i++) {
        curr = next;
        next = 0;
        visited[curr] = true;
        for (int v = 0; v < n; v++) {
            if (visited[v]) continue;
            dists[v] = min(dists[v], min(cards[curr] % cards[v], cards[v] % cards[curr]));
            if (dists[v] < dists[next]) next = v;
        }
        total += (ll) dists[next];
    }
    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