제출 #1168611

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1168611		Hanksburger	Sirni (COCI17_sirni)	C++20	140 / 140	2198 ms	82948 KiB

sirni

#include <bits/stdc++.h>
#define int long long
using namespace std;
int exist[10000005], par[100005], sz[100005];
vector<int> adj[100005], vec;
int findPar(int u)
{
    return par[u]==u?u:(par[u]=findPar(par[u]));
}
int addEdge(int u, int v)
{
    if (findPar(u)==findPar(v))
        return 0;
    if (sz[par[u]]>sz[par[v]])
        swap(u, v);
    sz[par[v]]+=sz[par[u]];
    par[par[u]]=par[v];
    return 1;
}
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n, ans=0;
    cin >> n;
    for (int i=0; i<n; i++)
    {
        int x;
        cin >> x;
        vec.push_back(x);
    }
    sort(vec.begin(), vec.end());
    vec.resize(unique(vec.begin(), vec.end())-vec.begin());
    for (int i=0; i<vec.size(); i++)
    {
        exist[vec[i]]=i+1;
        par[i]=i;
        sz[i]=1;
    }
    for (int i=0;; i++)
    {
        for (int j=0; j<vec.size(); j++)
        {
            if (vec[j]<=i)
                continue;
            if (j<10)
            {
                for (int k=0; k<vec.size(); k++)
                    if (vec[k]%vec[j]==i && addEdge(j, k))
                        ans+=i;
            }
            else
            {
                for (int k=vec[j]+i; k<=10000000; k+=vec[j])
                    if (exist[k] && addEdge(j, exist[k]-1))
                        ans+=i;
            }
        }
        if (sz[findPar(0)]==vec.size())
        {
            cout << 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: 14 / 14
• Subtask 9: 14 / 14
• Subtask 10: 14 / 14