제출 #1154328

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1154328		cpismylifeOwO	Sirni (COCI17_sirni)	C++20	126 / 140	5093 ms	81556 KiB

sirni

#include <bits/stdc++.h>

using namespace std;

const int inf = 1e7 + 1;
const long long mod = 1e9 + 7;
const int MaxN = 1e5 + 5;
const int MaxA = 1e7 + 5;

int n;
int arr[MaxN];

void Inp()
{
    cin >> n;
    for (int x = 1; x <= n; x++)
    {
        cin >> arr[x];
    }
    sort(arr + 1, arr + n + 1);
}

int parents[MaxN];
int sz[MaxN];
pair<int, int> cur[MaxN];

int FindSet(int p)
{
    if (parents[p] == p)
    {
        return p;
    }
    parents[p] = FindSet(parents[p]);
    return parents[p];
}

bool UnionSet(int a, int b)
{
    a = FindSet(a);
    b = FindSet(b);
    if (a == b)
    {
        return false;
    }
    if (sz[a] < sz[b])
    {
        swap(a, b);
    }
    parents[b] = a;
    sz[a] += sz[b];
    return true;
}

int pre[MaxA];
int dis[MaxA];
pair<int, int> now[MaxN];
bool mark[MaxN];

void Exc()
{
    int mxa = 0;
    for (int x = 1; x <= n; x++)
    {
        parents[x] = x;
        sz[x] = 1;
        mxa = max(mxa, arr[x]);
    }
    int cnt = 0;
    for (int x = 1; x <= n; x++)
    {
        int y = x;
        while (y <= n && arr[x] == arr[y])
        {
            UnionSet(x, y);
            mark[y] = false;
            y++;
        }
        y--;
        mark[y] = true;
        pre[arr[x]] = y;
        cnt++;
        x = y;
    }
    for (int x = mxa; x > 0; x--)
    {
        dis[x] = 0;
        if (!pre[x])
        {
            pre[x] = pre[x + 1];
            dis[x] = dis[x + 1] + 1;
        }
    }
    long long res = 0;
    while (cnt > 1)
    {
        for (int x = 1; x <= n; x++)
        {
            now[x] = cur[x] = make_pair(inf, 0);
        }
        for (int x = 1; x <= n; x++)
        {
            if (!mark[x])
            {
                continue;
            }
            if (arr[x] < mxa && dis[arr[x] + 1] + 1 < arr[x])
            {
                int p = pre[arr[x] + 1];
                if (FindSet(p) != FindSet(x))
                {
                    now[x] = min(now[x], make_pair(dis[arr[x] + 1] + 1, p));
                    now[p] = min(now[p], make_pair(dis[arr[x] + 1] + 1, x));
                }
            }
            for (int y = arr[x] + arr[x]; y <= mxa; y += arr[x])
            {
                int q = dis[y], p = pre[y];
                if (q < arr[x])
                {
                    if (FindSet(x) != FindSet(p))
                    {
                        now[x] = min(now[x], make_pair(q, p));
                        now[p] = min(now[p], make_pair(q, x));
                    }
                }
                else
                {
                    y += ((q / arr[x]) - 1) * arr[x];
                }
            }
        }
        for (int x = 1; x <= n; x++)
        {
            cur[FindSet(x)] = min(cur[FindSet(x)], now[x]);
        }
        for (int x = 1; x <= n; x++)
        {
            if (parents[x] == x && cur[x].first != inf && UnionSet(x, cur[x].second))
            {
                res += cur[x].first;
                cnt--;
            }
        }
    }
    cout << res;
}

int main()
{
    //freopen("A.INP", "r", stdin);
    //freopen("A.OUT", "w", stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int test = 1;
    //cin >> test;
    for (int x = 1; x <= test; x++)
    {
        Inp();
        Exc();
    }
    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: 0 / 14