Submission #1254294

#	Time	Username	Problem	Language	Result	Execution time	Memory
1254294		rcll	Sirni (COCI17_sirni)	C++20	140 / 140	1055 ms	573744 KiB

sirni

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

struct DSU {
    int cnt;
    int size;
    vector<int> e;
    DSU (int _) : size (_) {
        e=vector<int> (size,-1);
    }
    int root(int x) {
        return (e[x] < 0 ? x : (e[x]=root(e[x])));
    }
    bool same(int x,int y) {
        return root(x) == root(y);
    }
    void unite(int x,int y) {
        if (same(x,y)) return;
        x=root(x),y=root(y);
        if (-e[x] > -e[y]) {
            swap(x,y);
        }
        e[y] += e[x];
        e[x]=y;
        cnt --;
    }
};

const int N=(int)1e5;
const int Mx=(int)1e7;
int n;
int a[N];
int nxt[Mx + 1];
vector<pair<int,int>> edges[Mx + 1];

void solve() {
    cin >> n;
    for (int i=0; i < n;i++) {
        cin >> a[i];
    }
    sort(a,a + n);
    int ptr=1;
    for (int i=1; i < n; i++) {
        if (a[i] != a[i - 1]) {
            a[ptr]=a[i];
            ptr ++;
        }
    }
    n=ptr;
    for (int i=0; i < n; i++) {
        nxt[a[i]]=-(i + 1);
    }
    for (int i=a[n - 1] - 1; i >= 0; i--) {
        if (nxt[i] == 0) {
            nxt[i]=nxt[i + 1];
            if (nxt[i] < 0) nxt[i] *= -1;
        }
    }
    for (int i=0; i < n - 1; i++) {
        for (int j=a[i]; j <= a[n - 1]; j += a[i]) {
            int nt;
            if (j == a[i]) {
                nt=(nxt[a[i] + 1] < 0 ? -nxt[a[i] + 1] : nxt[a[i] + 1]);
            } else {
                nt=(nxt[j] < 0 ? -nxt[j] : nxt[j]);

            }
            if (a[nt - 1] >= j + a[i]) continue;
            edges[a[nt - 1] - j].push_back(make_pair(i + 1,nt));
        }
    }
    int64_t ans=0;
    DSU d(n);
    for (int i=0; i < a[n - 1]; i++) {
        for (auto& e : edges[i]) {
            if (!d.same(e.first - 1,e.second - 1)) {
                d.unite(e.first - 1,e.second - 1);
                ans += i;
            }
        }
    }
    cout << ans << '\n';
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    solve();
    return 0;
}

• 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: 14 / 14
• Subtask 9: 14 / 14
• Subtask 10: 14 / 14