結果

問題 No.1917 LCMST
ユーザー t98slidert98slider
提出日時 2022-04-30 01:29:42
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 266 ms / 4,000 ms
コード長 5,809 bytes
コンパイル時間 2,484 ms
コンパイル使用メモリ 182,356 KB
実行使用メモリ 38,624 KB
最終ジャッジ日時 2023-09-11 17:25:05
合計ジャッジ時間 14,690 ms
ジャッジサーバーID
(参考情報)
judge14 / judge13
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 4 ms
4,376 KB
testcase_01 AC 4 ms
4,376 KB
testcase_02 AC 4 ms
4,380 KB
testcase_03 AC 5 ms
4,400 KB
testcase_04 AC 5 ms
4,396 KB
testcase_05 AC 5 ms
4,508 KB
testcase_06 AC 5 ms
4,512 KB
testcase_07 AC 5 ms
4,468 KB
testcase_08 AC 4 ms
4,380 KB
testcase_09 AC 244 ms
21,036 KB
testcase_10 AC 245 ms
20,824 KB
testcase_11 AC 234 ms
20,884 KB
testcase_12 AC 209 ms
20,588 KB
testcase_13 AC 141 ms
12,468 KB
testcase_14 AC 220 ms
20,664 KB
testcase_15 AC 124 ms
8,860 KB
testcase_16 AC 144 ms
13,992 KB
testcase_17 AC 162 ms
20,720 KB
testcase_18 AC 181 ms
21,244 KB
testcase_19 AC 128 ms
9,340 KB
testcase_20 AC 119 ms
5,980 KB
testcase_21 AC 130 ms
8,612 KB
testcase_22 AC 118 ms
5,896 KB
testcase_23 AC 118 ms
6,048 KB
testcase_24 AC 129 ms
8,660 KB
testcase_25 AC 119 ms
5,944 KB
testcase_26 AC 123 ms
6,300 KB
testcase_27 AC 126 ms
9,560 KB
testcase_28 AC 127 ms
9,496 KB
testcase_29 AC 261 ms
36,788 KB
testcase_30 AC 259 ms
37,332 KB
testcase_31 AC 266 ms
36,972 KB
testcase_32 AC 260 ms
36,852 KB
testcase_33 AC 262 ms
37,812 KB
testcase_34 AC 105 ms
4,376 KB
testcase_35 AC 105 ms
4,376 KB
testcase_36 AC 105 ms
4,384 KB
testcase_37 AC 261 ms
37,212 KB
testcase_38 AC 257 ms
37,880 KB
testcase_39 AC 262 ms
38,624 KB
testcase_40 AC 258 ms
38,160 KB
testcase_41 AC 256 ms
37,072 KB
testcase_42 AC 254 ms
38,032 KB
testcase_43 AC 106 ms
4,536 KB
testcase_44 AC 106 ms
4,536 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)
#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(int)(n);k++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yes(ans) if(ans)printf("yes\n");else printf("no\n")
#define Yes(ans) if(ans)printf("Yes\n");else printf("No\n")
#define YES(ans) if(ans)printf("YES\n");else printf("NO\n")
#define popcount(v) __builtin_popcountll(v)
#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define vector3d(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))
#define vector4d(type,name,h,w,d,...) vector<vector<vector<vector<type>>>>name(h,vector<vector<vector<type>>>(w,vector<vector<type>>(d,vector<type>(__VA_ARGS__))))
using namespace std;
using ll = long long;
template<class T> using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
const int MOD=1000000007;
const int MOD2=998244353;
const int INF=1<<30;
const ll INF2=1LL<<60;
void scan(int& a){scanf("%d",&a);}
void scan(long long& a){scanf("%lld",&a);}
template<class T,class L>void scan(pair<T, L>& p){scan(p.first);scan(p.second);}
template<class T,class U,class V>void scan(tuple<T,U,V>& p){scan(get<0>(p));scan(get<1>(p));scan(get<2>(p));}
template<class T, size_t size> void scan(array<T, size>& a){ for(auto&& i : a) scan(i);}
template<class T> void scan(T& a){cin>>a;}
template<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}
void print(const int& a){printf("%d",a);}
void print(const long long& a){printf("%lld",a);}
void print(const double& a){printf("%.15lf",a);}
template<class T,class L>void print(const pair<T, L>& p){print(p.first);putchar(' ');print(p.second);}
template<class T> void print(const T& a){cout<<a;}
template<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}
void out(){putchar('\n');}
template<class T> void out(const T& t){print(t);putchar('\n');}
template <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}
template<class T> void dprint(const T& a){cerr<<a;}
template<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<" "<<*it;}}
void debug(){cerr<<'\n';}
template<class T> void debug(const T& t){dprint(t);cerr<<endl;}
template <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<" ";debug(tail...);}
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
ll modinv(ll a, ll m) {ll b = m, u = 1, v = 0;while (b) {ll t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;if (u < 0) u += m;return u;}
ll updivide(ll a,ll b){return (a+b-1)/b;}
template<class T> void chmax(T &a,const T b){if(b>a)a=b;}
template<class T> void chmin(T &a,const T b){if(b<a)a=b;}

struct dsu {
  public:
    dsu() : _n(0) {}
    dsu(int n) : _n(n), parent_or_size(n, -1) {}

    int merge(int a, int b) {
        assert(0 <= a && a < _n);
        assert(0 <= b && b < _n);
        int x = leader(a), y = leader(b);
        if (x == y) return x;
        if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);
        parent_or_size[x] += parent_or_size[y];
        parent_or_size[y] = x;
        return x;
    }

    bool same(int a, int b) {
        assert(0 <= a && a < _n);
        assert(0 <= b && b < _n);
        return leader(a) == leader(b);
    }

    int leader(int a) {
        assert(0 <= a && a < _n);
        if (parent_or_size[a] < 0) return a;
        return parent_or_size[a] = leader(parent_or_size[a]);
    }

    int size(int a) {
        assert(0 <= a && a < _n);
        return -parent_or_size[leader(a)];
    }

    std::vector<std::vector<int>> groups() {
        std::vector<int> leader_buf(_n), group_size(_n);
        for (int i = 0; i < _n; i++) {
            leader_buf[i] = leader(i);
            group_size[leader_buf[i]]++;
        }
        std::vector<std::vector<int>> result(_n);
        for (int i = 0; i < _n; i++) {
            result[i].reserve(group_size[i]);
        }
        for (int i = 0; i < _n; i++) {
            result[leader_buf[i]].push_back(i);
        }
        result.erase(
            std::remove_if(result.begin(), result.end(),
                           [&](const std::vector<int>& v) { return v.empty(); }),
            result.end());
        return result;
    }

  private:
    int _n;
    // root node: -1 * component size
    // otherwise: parent
    std::vector<int> parent_or_size;
};

int main(){
    INT(n);
    vector<ll> cnt(100001);
    int x,y;
    for(int i=0;i<n;i++){
        in(x);
        cnt[x]++;
    }
    vector<tuple<ll,int,int>> edge;
    ll ans = 0, d;
    for(ll i=1;i<=100000;i++){
        if(cnt[i]>=2)ans+=(cnt[i]-1)*i;
        ll pre=INF;
        for(ll j=i;j<=100000;j+=i){
            if(cnt[j]==0)continue;
            if(pre==INF)pre=j;
            else edge.emplace_back(j/i*pre,pre,j);
        }
    }
    sort(all(edge));
    dsu uf(100001);
    rep(i,edge.size()){
        tie(d,x,y)=edge[i];
        if(uf.same(x,y))continue;
        ans+=d;
        uf.merge(x,y);
    }
    out(ans);
}
0