Submission #668488

#	Time	Username	Problem	Language	Result	Execution time	Memory
668488		Doxeno	Sirni (COCI17_sirni)	C++17	98 / 140	5098 ms	399956 KiB

sirni

#pragma gcc optimise("O3")
#include <algorithm>
#include <bits/stdc++.h>
#include <functional>
#include <numeric>

using namespace std;


int main(){
    int N;
    cin >> N;
    set<int> s;
    int a;

    for(int i = 0; i < N; ++i){
        cin >> a;
        s.insert(a);
    }
    N = s.size();
    vector<int> v;
    for(auto x: s)v.emplace_back(x);
    int m = 1e7 + 2;

    long long ans = 0;
    vector<array<int,3>> eg;

    for(int i = 0; i < N; ++i){
        for(int j = v[i]; j <= v.back(); j += v[i]){
            int k = lower_bound(v.begin() + i + 1, v.end(), j) -v.begin();
            if(k >= N || v[k] - j >= v[i])continue;
            eg.push_back({v[k] - j, k, i});
        }
    }


    vector<int> dad(N), sz(N, 1);
    iota(dad.begin(), dad.end(), 0);

    function<int(int)> find=[&](int a){
        if(dad[a] != a)dad[a] = find(dad[a]);
        return dad[a];
    };
    auto uni = [&](int a, int b) -> bool{
        a = find(a);
        b = find(b);
        if(a == b)return 0;
        if(sz[a] < sz[b])swap(a,b);
        dad[b] = a;
        sz[a] += sz[b];
        return 1;
    };
    sort(eg.begin(), eg.end());
    for(auto [w, i, j]: eg){
        if(uni(i, j))ans += w;
    }



    cout << ans << endl;
    return 0;
}

Compilation message (stderr)

sirni.cpp:1: warning: ignoring '#pragma gcc optimise' [-Wunknown-pragmas]
    1 | #pragma gcc optimise("O3")
      | 
sirni.cpp: In function 'int main()':
sirni.cpp:23:9: warning: unused variable 'm' [-Wunused-variable]
   23 |     int m = 1e7 + 2;
      |         ^

• Subtask 1: 14 / 14
• Subtask 2: 14 / 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