Submission #1190995

#TimeUsernameProblemLanguageResultExecution timeMemory
1190995ulvixSirni (COCI17_sirni)C++20
0 / 140
5095 ms1220 KiB
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define all(x) x.begin(),x.end()
const ll sz=1e5+100;
const ll mod=1e9+7;
const ll INF=1e18;
using namespace std;
using namespace __gnu_pbds;
template<class T>
using indexed_multiset=tree<T,null_type,less_equal<T>,rb_tree_tag,tree_order_statistics_node_update>;
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll n;
    cin>>n;
    vector<ll> v(n);
    for(ll i=0;i<n;i++){
        cin>>v[i];
    }
    set<ll> s;
    s.insert(0);
    ll ans=0;
    while(s.size()<n){
        ll mn=LLONG_MAX;
        ll mnn=-1;
        for(ll i:s){
        for(ll j=0;j<n;j++){
            if(s.count(j)) continue;
            ll a=min(v[i]%v[j],v[j]%v[i]);
            if(a<mn){
                mn=a;
                mnn=j;
            }
        }
        }
        s.insert(mnn);
        ans+=mn;
    }
    cout<<ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...