Submission #483518

#	Time	Username	Problem	Language	Result	Execution time	Memory
483518		oneloveforever	Sirni (COCI17_sirni)	C++14	0 / 140	61 ms	6724 KiB

sirni

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define x first
#define y second
#define ii pair<int,int>
int n;
const int M=1e5+7;
struct DSU
{
    vector<int>sz,trace;
    int n;
    DSU(int _n=0)
    {
        n=_n;
        sz.assign(n+7,1);
        trace.resize(n+7);
        iota(trace.begin(),trace.end(),0);
    }
    int find_dsu(int x)
    {
        return trace[x]==x?trace[x]:find_dsu(trace[x]);
    }
    bool check(int x,int y)
    {
        int u=find_dsu(x);
        int v=find_dsu(y);
        if(u==v)return false;
        if(sz[u]>sz[v])swap(u,v);
        trace[u]=v;
        sz[v]+=sz[u];
        return true;
    }
};
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin>>n;
    vector<vector<ii> >edge(M+10);
    vector<int>a(n+1);
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
    }
    sort(a.begin(),a.end());
    for(int i=1;i<=n;i++)
    {
        int vt=i;
        for(int need=a[i];need<M;need+=a[i])
        {
            while(vt+1<=n&&a[vt+1]<need)vt+=1;
            edge[a[vt]%a[i]].push_back(make_pair(i,vt));
        }
    }
    DSU dsu(n);
    int ans=0;
    for(int i=0;i<M;i++)
    {
        for(ii node:edge[i])
        {
            //cout<<node.x<<" "<<node.y<<" "<<i<<endl;
            if(dsu.check(node.x,node.y))ans+=i;
        }
    }
    cout<<ans;
}

• 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