Submission #1139300

#	Time	Username	Problem	Language	Result	Execution time	Memory
1139300		ChottuF	Sirni (COCI17_sirni)	C++20	0 / 140	83 ms	16060 KiB

sirni

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

struct DSU {
    vector<int> parent, sz, min_val;
    DSU(int n, const vector<int>& arr) {
        parent.resize(n);
        sz.resize(n, 1);
        min_val.resize(n);
        for (int i = 0; i < n; ++i) {
            parent[i] = i;
            min_val[i] = arr[i];
        }
    }
    
    int find(int x) {
        if (parent[x] != x) {
            parent[x] = find(parent[x]);
        }
        return parent[x];
    }
    
    void merge(int a, int b) {
        a = find(a);
        b = find(b);
        if (a == b) return;
        if (sz[a] < sz[b]) swap(a, b);
        parent[b] = a;
        sz[a] += sz[b];
        min_val[a] = min(min_val[a], min_val[b]);
    }
};

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    
    int n;
    cin >> n;
    vector<int> arr(n);
    for (int i = 0; i < n; ++i) {
        cin >> arr[i];
    }
    
    if (n == 1) {
        cout << 0;
        return 0;
    }
    
    sort(arr.begin(), arr.end());
    unordered_map<int, vector<int>> value_indices;
    for (int i = 0; i < n; ++i) {
        value_indices[arr[i]].push_back(i);
    }
    
    vector<int> unique_x;
    unique_x.push_back(arr[0]);
    for (int i = 1; i < n; ++i) {
        if (arr[i] != arr[i-1]) {
            unique_x.push_back(arr[i]);
        }
    }
    
    DSU dsu(n, arr);
    int max_val = arr.back();
    
    for (int x : unique_x) {
        auto& indices = value_indices[x];
        if (indices.empty()) continue;
        int first_idx = indices[0];
        for (size_t i = 1; i < indices.size(); ++i) {
            dsu.merge(first_idx, indices[i]);
        }
        
        for (int k = 2; ; ++k) {
            long long y = (long long)x * k;
            if (y > max_val) break;
            if (value_indices.count(y)) {
                auto& y_indices = value_indices[y];
                if (y_indices.empty()) continue;
                int y_first = y_indices[0];
                dsu.merge(first_idx, y_first);
            }
        }
    }
    
    int m = arr[0];
    int m_root = dsu.find(0);
    unordered_set<int> roots;
    for (int i = 0; i < n; ++i) {
        roots.insert(dsu.find(i));
    }
    
    int sum = 0;
    for (int root : roots) {
        if (root == m_root) continue;
        sum += dsu.min_val[root] % m;
    }
    
    cout << sum;
    return 0;
}

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