Submission #1174223

#	Time	Username	Problem	Language	Result	Execution time	Memory
1174223		InvMOD	Sirni (COCI17_sirni)	C++20	84 / 140	5065 ms	828312 KiB

sirni

#include<bits/stdc++.h>

using namespace std;

#define sz(v) (int)(v).size()

#define all(v) (v).begin(), (v).end()
#define compact(v) (v).erase(unique(all(v)), (v).end())

using ll = long long;

const int N = 1e5, M = 1e7 + 1;

int n, i, nxt, par[N], answer, near[M];

int asc(int x){
    return par[x] < 0 ? x : par[x] = asc(par[x]);
}

bool join(int u, int v){
    u = asc(u), v = asc(v);
    if(u == v) return false;

    if(par[u] > par[v]) swap(u, v);

    par[u] += par[v];
    par[v] = u;
    return true;
}

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

    cin >> n;

    vector<int> a(n);
    for(i = 0; i < n; i++){
        cin >> a[i];
    }

    sort(all(a)), compact(a);
    for(i = 0; i < sz(a); i++){
        near[a[i]] = i;
        par[i] = -1;
    }

    for(i = a.back(); i > a[0] + 1; i--){
        near[i - 1] = (!near[i - 1] ? near[i] : near[i - 1]);
    }

    vector<pair<int, pair<int,int>>> E;
    for(i = sz(a) - 2; i >= 0; i--){
        E.push_back(make_pair(a[i + 1] % a[i], make_pair(i, i + 1)));
        for(nxt = a[i] * 2; nxt <= a.back(); nxt += a[i]){
            E.push_back(make_pair(a[near[nxt]] % a[i], make_pair(i, near[nxt])));
        }
    }
    sort(all(E));

    for(i = 0; i < sz(E); i++){
        if(join(E[i].second.first, E[i].second.second)){
            answer = answer + E[i].first;
        }
    }

    cout << answer << "\n";
    return 0;
}

• Subtask 1: 14 / 14
• Subtask 2: 0 / 14
• Subtask 3: 14 / 14
• Subtask 4: 14 / 14
• Subtask 5: 14 / 14
• Subtask 6: 14 / 14
• Subtask 7: 14 / 14
• Subtask 8: 0 / 14
• Subtask 9: 0 / 14
• Subtask 10: 0 / 14