제출 #1171554

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1171554		imarn	Sirni (COCI17_sirni)	C++20	98 / 140	5106 ms	565720 KiB

sirni

#include<bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("avx2")
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define plx pair<ll,int>
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(),x.end()
#define vi vector<int>
#define vvi vector<vi>
#define pp pair<ll,int>
#define ub(x,i) upper_bound(all(x),i)-x.begin()
#define lb(x,i) lower_bound(all(x),i)-x.begin()
#define t3 tuple<int,int,int>
#define sz(x) (ll)x.size()
#define cd complex<double>
using namespace std;
const int mxn=1e7+1,mxk=1e5+1;
int r[mxn]{0};
int pr[mxk];
vector<int>a;
vector<pii>v;
int get(int r){
    return pr[r]==r?r:pr[r]=get(pr[r]);
}
bool cmp(pii x,pii y){
    return a[x.f]%a[x.s]<a[y.f]%a[y.s];
}
int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    int n;cin>>n;a.resize(n);
    for(int i=0;i<n;i++)cin>>a[i];sort(all(a));a.erase(unique(all(a)),a.end());
    n=a.size();for(int i=0;i<n;i++)r[a[i]]=i+1;
    for(int i=a[n-1];i>=0;i--)if(!r[i])r[i]=r[i+1];
    iota(pr,pr+n,0);
    for(int i=0;i<n-1;i++){
        v.pb({i+1,i});
        for(int j=2*a[i];j<mxn;j+=a[i]){
            if(r[j])v.pb({r[j]-1,i});
        }
    }sort(all(v),cmp);ll ans=0;
    for(auto [i,j] : v){
        if(get(i)==get(j))continue;
        pr[get(i)]=get(j);
        ans+=a[i]%a[j];
    }cout<<ans;
}

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