Submission #1160190

#	Time	Username	Problem	Language	Result	Execution time	Memory
1160190		12345678	Sirni (COCI17_sirni)	C++17	70 / 140	3781 ms	851968 KiB

sirni

#include <bits/stdc++.h>

using namespace std;

const int nx=1e5+5, kx=1e7+5;

int n, dsu[nx], mx, idx, res, p[nx];
vector<int> qrs[kx];
vector<pair<int, int>> edg[kx], v;

int find(int x)
{
    if (dsu[x]==x) return x;
    return dsu[x]=find(dsu[x]);
}

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n;
    for (int i=1; i<=n; i++) cin>>p[i], dsu[i]=i, mx=max(mx, p[i]), v.push_back({p[i], i});
    sort(v.begin(), v.end());
    idx=n-1;
    for (int i=1; i<=n; i++) for (int j=2*p[i]; j<=mx; j+=p[i]) qrs[j].push_back(i);
    for (int i=mx; i>=1; i--)
    {
        while (idx>0&&v[idx-1].first>=i) idx--;
        for (auto x:qrs[i]) edg[v[idx].first-i].push_back({x, v[idx].second});
    }
    idx=n;
    for (int i=n-1; i>=0; i--)
    {
        while (idx>0&&v[idx-1].first>v[i].first) idx--;
        if (idx<n) edg[v[idx].first-v[i].first].push_back({v[idx].second, v[i].second});
    }
    for (int i=1; i<n; i++) if (v[i].first==v[i-1].first) dsu[find(v[i].second)]=find(v[i-1].second);
    for (int i=0; i<=mx; i++)
    {
        for (auto [u, v]:edg[i])
        {
            //cout<<"edg "<<u<<' '<<v<<' '<<i<<'\n';
            if (find(u)!=find(v)) res+=i, dsu[find(u)]=find(v);
        }
    }
    //for (int i=1; i<=n; i++) cout<<dsu[i]<<' ';
    //cout<<'\n';
    cout<<res;

}
/*
10
7 10 5 6 4 7 9 8 7 2
*/

• Subtask 1: 14 / 14
• Subtask 2: 0 / 14
• Subtask 3: 14 / 14
• Subtask 4: 14 / 14
• Subtask 5: 0 / 14
• Subtask 6: 14 / 14
• Subtask 7: 14 / 14
• Subtask 8: 0 / 14
• Subtask 9: 0 / 14
• Subtask 10: 0 / 14