제출 #1191001

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1191001		ulvix	Sirni (COCI17_sirni)	C++20	42 / 140	5095 ms	1864 KiB

sirni

#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];
    }
    vector<bool> b(n);
    vector<ll> mns(n,INF);
    mns[0]=0;
    ll ans=0;
    for(ll i=0;i<n;i++){
        ll best=INF;
        ll bestt=-1;
        for(ll j=0;j<n;j++){
            if(!b[j] && mns[j]<best){
                best=mns[j];
                bestt=j;
            }
        }
        b[bestt]=1;
        ans+=best;
        for(ll j=0;j<n;j++){
            if(b[j]) continue;
            ll a=min(v[bestt]%v[j],v[j]%v[bestt]);
            if(a<mns[j]){
                mns[j]=a;
            }
        }
    }
    cout<<ans;
}

• Subtask 1: 14 / 14
• Subtask 2: 14 / 14
• Subtask 3: 14 / 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