제출 #46360

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
46360		evpipis	Sirni (COCI17_sirni)	C++11	98 / 140	5093 ms	458132 KiB

sirni

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

#define pb push_back
#define fi first
#define se second
#define mp make_pair
typedef pair<int, int> ii;
typedef long long ll;

const int len = 1e5+2;
int cnt[100*len], nex[100*len][2], p[len], r[len];
int u[100 * len], v[100 * len], edcnt = 0;
int cnt_sz[100*len];
vector<int> vec[100*len];

int fin(int i){
    if (p[i] == i) return i;
    return p[i] = fin(p[i]);
}

void join(int i, int j){
    if (r[i] > r[j])
        p[j] = i;
    else{
        p[i] = j;
        if (r[i] == r[j]) r[j]++;
    }
}

void read(int &res){
    char c;
    while (c = getchar(), c < '0' || c > '9'){}
    res = c-'0';
    while (c = getchar(), c >= '0' && c <= '9')
        res = 10*res+c-'0';
}

int main(){
    int n, m = 0, k = 0;
    read(n);
    for (int i = 0; i < n; i++){
        int temp;
        read(temp);

        m = max(m, temp);
        if (!cnt[temp]) cnt[temp] = ++k;
    }

    for (int i = m; i >= 1; i--){
        nex[i][0] = nex[i+1][0];
        if (cnt[i]) nex[i][0] = i;

        nex[i][1] = nex[i+1][1];
        if (cnt[i+1]) nex[i][1] = i+1;
    }

    for (int i = 1; i <= k; i++){
        r[i] = 0;
        p[i] = i;
    }

    for (int i = 1; i <= m; i++) {
        if (cnt[i]) {
            for (int j = i; j <= m; j+=i){
                if (j == i && nex[j][1] && nex[j][1] < j+i){
                    cnt_sz[nex[j][1]-j]++;
                }
                else if (j != i && nex[j][0] && nex[j][0] < j+i){
                    cnt_sz[nex[j][0]-j]++;
                }
            }
        }
    }

    for (int i = 0; i <= m; i++){
        if (cnt_sz[i])
            vec[i].reserve(cnt_sz[i]);
    }

    for (int i = 1; i <= m; i++)
        if (cnt[i])
            for (int j = i; j <= m; j+=i){
                if (j == i && nex[j][1] && nex[j][1] < j+i) {
                    u[edcnt] = cnt[i];
                    v[edcnt] = cnt[nex[j][1]];
                    vec[nex[j][1]-j].pb(edcnt);
                    edcnt++;
                    //vec[nex[j][1]-j].pb(mp(cnt[i], cnt[nex[j][1]]));
                }
                else if (j != i && nex[j][0] && nex[j][0] < j+i){
                    u[edcnt] = cnt[i];
                    v[edcnt] = cnt[nex[j][0]];
                    vec[nex[j][0]-j].pb(edcnt);
                    edcnt++;
                    //vec[nex[j][0]-j].pb(mp(cnt[i], cnt[nex[j][0]]));
                }
            }

    ll ans = 0;
    for (int i = 0; i <= m; i++){
        if (k == 1) break;
        for (auto it : vec[i]){
            if (k == 1) break;
            int x = fin(u[it]), y = fin(v[it]);
            if (x != y)
                join(x, y), ans += i, k--;
        }
    }

    printf("%lld\n", ans);
    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: 0 / 14
• Subtask 9: 0 / 14
• Subtask 10: 0 / 14