結果

問題 No.1917 LCMST
ユーザー tko919tko919
提出日時 2022-08-25 03:36:46
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 601 ms / 4,000 ms
コード長 6,085 bytes
コンパイル時間 3,058 ms
コンパイル使用メモリ 215,780 KB
実行使用メモリ 54,688 KB
最終ジャッジ日時 2024-04-20 15:15:15
合計ジャッジ時間 18,710 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 3 ms
6,144 KB
testcase_01 AC 5 ms
6,144 KB
testcase_02 AC 5 ms
5,888 KB
testcase_03 AC 8 ms
6,528 KB
testcase_04 AC 8 ms
6,400 KB
testcase_05 AC 9 ms
6,400 KB
testcase_06 AC 8 ms
6,400 KB
testcase_07 AC 8 ms
6,272 KB
testcase_08 AC 6 ms
6,016 KB
testcase_09 AC 509 ms
38,104 KB
testcase_10 AC 574 ms
37,980 KB
testcase_11 AC 557 ms
38,052 KB
testcase_12 AC 525 ms
37,448 KB
testcase_13 AC 281 ms
25,884 KB
testcase_14 AC 528 ms
37,696 KB
testcase_15 AC 210 ms
20,372 KB
testcase_16 AC 280 ms
26,048 KB
testcase_17 AC 378 ms
35,448 KB
testcase_18 AC 445 ms
36,100 KB
testcase_19 AC 204 ms
19,708 KB
testcase_20 AC 138 ms
16,856 KB
testcase_21 AC 176 ms
19,716 KB
testcase_22 AC 134 ms
16,988 KB
testcase_23 AC 134 ms
16,980 KB
testcase_24 AC 170 ms
19,892 KB
testcase_25 AC 143 ms
16,848 KB
testcase_26 AC 149 ms
17,096 KB
testcase_27 AC 157 ms
19,444 KB
testcase_28 AC 168 ms
19,564 KB
testcase_29 AC 546 ms
54,656 KB
testcase_30 AC 536 ms
54,628 KB
testcase_31 AC 555 ms
54,536 KB
testcase_32 AC 536 ms
54,528 KB
testcase_33 AC 556 ms
54,404 KB
testcase_34 AC 41 ms
13,368 KB
testcase_35 AC 40 ms
13,568 KB
testcase_36 AC 39 ms
13,440 KB
testcase_37 AC 533 ms
54,376 KB
testcase_38 AC 544 ms
54,648 KB
testcase_39 AC 533 ms
54,376 KB
testcase_40 AC 537 ms
54,512 KB
testcase_41 AC 546 ms
54,388 KB
testcase_42 AC 601 ms
54,688 KB
testcase_43 AC 53 ms
13,848 KB
testcase_44 AC 46 ms
13,824 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 1 "library/Template/template.hpp"
#include <bits/stdc++.h>
using namespace std;

#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(v) (v).begin(),(v).end()
using ll=long long int;
const int inf = 0x3fffffff;
const ll INF = 0x1fffffffffffffff;
template<typename T>inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<typename T>inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
#line 2 "library/Utility/fastio.hpp"
#include <unistd.h>

class FastIO{
    static constexpr int L=1<<16;
    char rdbuf[L];
    int rdLeft=0,rdRight=0;
    inline void reload(){
        int len=rdRight-rdLeft;
        memmove(rdbuf,rdbuf+rdLeft,len);
        rdLeft=0,rdRight=len;
        rdRight+=fread(rdbuf+len,1,L-len,stdin);
    }
    inline bool skip(){
        for(;;){
            while(rdLeft!=rdRight and rdbuf[rdLeft]<=' ')rdLeft++;
            if(rdLeft==rdRight){
                reload();
                if(rdLeft==rdRight)return false;
            }
            else break;
        }
        return true;
    }
    template<typename T,enable_if_t<is_integral<T>::value,int> =0>inline bool _read(T& x){
        if(!skip())return false;
        if(rdLeft+20>=rdRight)reload();
        bool neg=false;
        if(rdbuf[rdLeft]=='-'){
            neg=true;
            rdLeft++;
        }
        x=0;
        while(rdbuf[rdLeft]>='0' and rdLeft<rdRight){
            x=x*10+(neg?-(rdbuf[rdLeft++]^48):(rdbuf[rdLeft++]^48));
        }
        return true;
    }
    template<typename T,enable_if_t<is_floating_point<T>::value,int> =0>inline bool _read(T& x){
        if(!skip())return false;
        if(rdLeft+20>=rdRight)reload();
        bool neg=false;
        if(rdbuf[rdLeft]=='-'){
            neg=true;
            rdLeft++;
        }
        x=0;
        while(rdbuf[rdLeft]>='0' and rdbuf[rdLeft]<='9' and rdLeft<rdRight){
            x=x*10+(rdbuf[rdLeft++]^48);
        }
        if(rdbuf[rdLeft]!='.')return true;
        rdLeft++;
        T base=.1;
        while(rdbuf[rdLeft]>='0' and rdbuf[rdLeft]<='9' and rdLeft<rdRight){
            x+=base*(rdbuf[rdLeft++]^48);
            base*=.1;
        }
        if(neg)x=-x;
        return true;
    }
    inline bool _read(char& x){
        if(!skip())return false;
        if(rdLeft+1>=rdRight)reload();
        x=rdbuf[rdLeft++];
        return true;
    }
    inline bool _read(string& x){
        if(!skip())return false;
        for(;;){
            int pos=rdLeft;
            while(pos<rdRight and rdbuf[pos]>' ')pos++;
            x.append(rdbuf+rdLeft,pos-rdLeft);
            if(rdLeft==pos)break;
            rdLeft=pos;
            if(rdLeft==rdRight)reload();
            else break;
        }
        return true;
    }
    template<typename T>inline bool _read(vector<T>& v){
        for(auto& x:v){
            if(!_read(x))return false;
        }
        return true;
    }

    char wtbuf[L],tmp[50];
    int wtRight=0;
    inline void flush(){
        fwrite(wtbuf,1,wtRight,stdout);
        wtRight=0;
    }
    inline void _write(const char& x){
        if(wtRight>L-32)flush();
        wtbuf[wtRight++]=x;
    }
    inline void _write(const string& x){
        for(auto& c:x)_write(c);
    }
    template<typename T,enable_if_t<is_integral<T>::value,int> =0>inline void _write(T x){
        if(wtRight>L-32)flush();
        if(x==0){
            _write('0');
            return;
        }
        else if(x<0){
            _write('-');
            if (__builtin_expect(x == std::numeric_limits<T>::min(), 0)) {
                switch (sizeof(x)) {
                case 2: _write("32768"); return;
                case 4: _write("2147483648"); return;
                case 8: _write("9223372036854775808"); return;
                }
            }
            x=-x;
        }
        int pos=0;
        while(x!=0){
            tmp[pos++]=char((x%10)|48);
            x/=10;
        }
        rep(i,0,pos)wtbuf[wtRight+i]=tmp[pos-1-i];
        wtRight+=pos;
    }
    template<typename T>inline void _write(const vector<T>& v){
        rep(i,0,v.size()){
            if(i)_write(' ');
            _write(v[i]);
        }
    }
public:
    FastIO(){}
    ~FastIO(){flush();}
    inline void read(){}
    template <typename Head, typename... Tail>inline void read(Head& head,Tail&... tail){
        assert(_read(head));
        read(tail...); 
    }
    template<bool ln=true,bool space=false>inline void write(){if(ln)_write('\n');}
    template <bool ln=true,bool space=false,typename Head, typename... Tail>inline void write(const Head& head,const Tail&... tail){
        if(space)_write(' ');
        _write(head);
        write<ln,true>(tail...); 
    }
};

/**
 * @brief Fast IO
 */
#line 2 "library/DataStructure/unionfind.hpp"

struct UnionFind{
    vector<int> par; int n;
    UnionFind(){}
    UnionFind(int _n):par(_n,-1),n(_n){}
    int root(int x){return par[x]<0?x:par[x]=root(par[x]);}
    bool same(int x,int y){return root(x)==root(y);}
    int size(int x){return -par[root(x)];}
    bool unite(int x,int y){
        x=root(x),y=root(y); if(x==y)return false;
        if(size(x)>size(y))swap(x,y);
        par[y]+=par[x]; par[x]=y; n--; return true;
    }
};

/**
 * @brief Union Find
 */
#line 4 "sol.cpp"

FastIO io;
int main(){
    int n;
    io.read(n);
    vector<ll> a(n);
    io.read(a);

    sort(ALL(a));
    ll res=0;
    rep(i,0,n-1)if(a[i]==a[i+1])res+=a[i];
    a.erase(unique(ALL(a)),a.end());
    n=a.size();
    vector<int> ids[101010];
    rep(i,0,n){
        for(int g=1;g*g<=a[i];g++)if(a[i]%g==0){
            ids[g].push_back(i);
            if(g*g!=a[i])ids[a[i]/g].push_back(i);
        }
    }
    
    using P=pair<int,int>;
    using P2=pair<ll,P>;
    vector<P2> es;
    rep(g,1,100010){
        rep(j,1,ids[g].size()){
            es.push_back({a[ids[g][0]]*a[ids[g][j]]/g,{ids[g][0],ids[g][j]}});
        }
    }
    sort(ALL(es));
    UnionFind uni(n);
    for(auto& [w,uv]:es){
        auto [u,v]=uv;
        if(uni.same(u,v))continue;;
        res+=w;
        uni.unite(u,v);
    }
    io.write(res);
    return 0;
}
0