Submission #856151

#	Time	Username	Problem	Language	Result	Execution time	Memory
856151		vjudge1	Sirni (COCI17_sirni)	C++17	0 / 140	5092 ms	49316 KiB

sirni

#ifndef Local
    #pragma GCC optimize("O3,unroll-loops")
    #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#endif
#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define lim 100001
#define till 1000001
using namespace std;
const int mod=1000000007ll;

int parent[lim];
int find(int i){
    if(parent[i]==i)return i;
    return parent[i]=find(parent[i]);
}
void unite(int i,int j){
    int x=parent[i],y=parent[j];
    parent[x]=y;
}

vector<int>all[till];

int mody(int i,int j){
    return max(i,j)%min(i,j);
}

void solve(){
    int n;
    cin>>n;
    int a[n];
    for(int i=0;i<n;i++){
        parent[i]=i;
        cin>>a[i];
    }
    sort(a,a+n);
    int ans=0;
    int uni[n];
    memset(uni,0,sizeof(uni));
    vector<int>opp;
    for(int i=n-1;0<=i;i--){
        if(uni[i]==2)continue;
        int to1=-1,to2=-1;
        //cerr<<i<<" "<<find(i)<<"::\n";
        for(int j=i-1;0<=j;j--){
            if(find(i)!=find(j)&&uni[j]!=2){
                //cerr<<j<<" "<<find(j)<<"\n";
                if(to1==-1){
                    to1=j;
                }else if(to2==-1||mody(a[i],a[j])<mody(a[i],a[to2])){
                    to2=j;
                    if(mody(a[i],a[to2])<mody(a[i],a[to1])){
                        swap(to1,to2);
                    }
                }
            }
        }
        if(to1!=-1){
            ans+=mody(a[i],a[to1]);
            opp.pb(mody(a[i],a[to1]));
            uni[i]++;
            uni[to1]++;
            //cerr<<"unite "<<i<<" "<<find(i)<<" "<<to1<<" "<<find(to1)<<"\n";
            unite(i,to1);
        }
        if(to2!=-1&&uni[i]!=2&&find(i)!=find(to2)){
            ans+=mody(a[i],a[to2]);
            opp.pb(mody(a[i],a[to2]));
            uni[i]++;
            uni[to2]++;
            //cerr<<"unite "<<i<<" "<<find(i)<<" "<<to2<<" "<<find(to2)<<"\n";
            unite(i,to2);
        }
        /*
        cerr<<to1<<" "<<to2<<"\n";
        for(int i:uni){
            cerr<<i<<" ";
        }cerr<<"\n";
        */
    }
    sort(opp.begin(),opp.end());
    int k=0,didnt[2];
    for(int i=0;i<n;i++){
        if(uni[i]==1)didnt[k++]=i;
    }
        //cerr<<didnt[0]<<" "<<didnt[1]<<"\n";
    if(mody(a[didnt[0]],a[didnt[1]])<opp.back()){
        ans-=opp.back();
        ans+=mody(a[didnt[0]],a[didnt[1]]);
    }
    cout<<ans<<"\n";
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
#ifdef Local  
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
#endif
    int t=1;
    //cin>>t;
    while (t--)
    {
        solve();
    }
}

• 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