제출 #1272908

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1272908		flaming_top1	Sirni (COCI17_sirni)	C++20	0 / 140	74 ms	80720 KiB

sirni

#include <bits/stdc++.h>

#define SPED                                                                                                           \
    ios_base::sync_with_stdio(false);                                                                                  \
    cin.tie(0);                                                                                                        \
    cout.tie(0);

#define endl "\n"
#define fi first
#define se second
#define lint long long
#define fami signed
#define lore main
#define freefire freopen
#define Data tuple<lint, int, int>

const lint INF = 0x1f1f1f1f1f1f1f1f;
const lint NEG = 0xE1E1E1E1E1E1E1E1;

using namespace std;

int mx;
int n, idx[10000005], near[10000005], N, sz[100005], par[100005];
lint a[100005];
int diff[100005], diff_sz;
Data edges[2000005];
int edges_sz;

void setup()
{
    for (int i = 1; i <= N; i++)
    {
        sz[i] = 1;
        par[i] = i;
    }
}

int find_par(int now)
{
    return par[now] == now ? now : par[now] = find_par(par[now]);
}

void combine(int l, int r)
{
    l = find_par(l);
    r = find_par(r);
    if (l == r)
        return;
    if (sz[l] < sz[r])
        swap(l, r);
    par[r] = l;
    sz[l] += sz[r];
}

void sang()
{
    for (int i = 1; i <= mx; i++)
    {
        if (idx[i])
            for (int j = i * 2; j <= mx; j += i)
                if (idx[j])
                    combine(idx[i], idx[j]);
    }
}

fami lore()
{
    SPED;
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
        diff[++diff_sz] = a[i];
    }
    diff[++diff_sz] = -1;
    sort(diff + 1, diff + diff_sz + 1);
    diff_sz = unique(diff + 1, diff + diff_sz + 1) - (diff + 1);
    N = diff_sz;

    for (int i = 1; i <= N; i++)
        idx[diff[i]] = i;

    mx = diff[N];

    setup();

    sang();

    lint mst = 0;

    for (int i = mx; i >= 1; i--)
    {
        near[i] = near[i + 1];
        if (idx[i])
            near[i] = i;
    }

    for (int i = 1; i <= N; i++)
    {
        lint val = diff[i];
        for (lint j = val; j <= mx; j += val)
        {
            lint l = j + 1, r = min(j + val - 1, (lint)mx);
            if (near[l] <= r)
            {
                int v = idx[near[l]];
                if (v && v != i)
                    edges[++edges_sz] = {near[l] - j, i, v};
            }
        }
    }

    sort(edges + 1, edges + edges_sz + 1);

    for (int i = 1; i <= edges_sz; i++)
    {
        auto [w, u, v] = edges[i];
        if (find_par(u) != find_par(v))
        {
            mst += w;
            combine(u, v);
        }
    }
    cout << mst;
}
// Let your soul wander where dreams are born.

• 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