結果

問題 No.1917 LCMST
ユーザー rianoriano
提出日時 2022-03-28 23:32:57
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 414 ms / 4,000 ms
コード長 7,273 bytes
コンパイル時間 3,310 ms
コンパイル使用メモリ 194,124 KB
実行使用メモリ 75,956 KB
最終ジャッジ日時 2023-09-10 17:00:31
合計ジャッジ時間 18,229 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 125 ms
25,084 KB
testcase_01 AC 125 ms
25,120 KB
testcase_02 AC 122 ms
24,976 KB
testcase_03 AC 125 ms
25,936 KB
testcase_04 AC 125 ms
25,720 KB
testcase_05 AC 127 ms
25,788 KB
testcase_06 AC 125 ms
25,832 KB
testcase_07 AC 124 ms
25,996 KB
testcase_08 AC 123 ms
24,992 KB
testcase_09 AC 413 ms
74,872 KB
testcase_10 AC 414 ms
75,500 KB
testcase_11 AC 409 ms
75,760 KB
testcase_12 AC 374 ms
50,092 KB
testcase_13 AC 273 ms
39,300 KB
testcase_14 AC 390 ms
74,708 KB
testcase_15 AC 242 ms
35,008 KB
testcase_16 AC 274 ms
37,900 KB
testcase_17 AC 307 ms
49,844 KB
testcase_18 AC 332 ms
50,008 KB
testcase_19 AC 248 ms
34,440 KB
testcase_20 AC 233 ms
31,032 KB
testcase_21 AC 247 ms
36,188 KB
testcase_22 AC 232 ms
30,928 KB
testcase_23 AC 231 ms
30,992 KB
testcase_24 AC 247 ms
35,004 KB
testcase_25 AC 233 ms
31,056 KB
testcase_26 AC 239 ms
35,688 KB
testcase_27 AC 242 ms
34,548 KB
testcase_28 AC 246 ms
34,672 KB
testcase_29 AC 332 ms
75,824 KB
testcase_30 AC 381 ms
75,504 KB
testcase_31 AC 385 ms
74,784 KB
testcase_32 AC 406 ms
74,724 KB
testcase_33 AC 339 ms
75,184 KB
testcase_34 AC 207 ms
24,932 KB
testcase_35 AC 206 ms
25,116 KB
testcase_36 AC 209 ms
25,128 KB
testcase_37 AC 384 ms
75,956 KB
testcase_38 AC 385 ms
75,444 KB
testcase_39 AC 383 ms
74,664 KB
testcase_40 AC 391 ms
74,604 KB
testcase_41 AC 398 ms
75,704 KB
testcase_42 AC 396 ms
74,808 KB
testcase_43 AC 211 ms
25,896 KB
testcase_44 AC 211 ms
25,884 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: 関数 ‘int main()’ 内:
main.cpp:264:13: 警告: structured bindings only available with ‘-std=c++17’ or ‘-std=gnu++17’ [-Wc++17-extensions]
  264 |     for(auto[c,u,v]:ed){
      |             ^

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define rrep2(i,n,k) for(int i=n-1;i>=n-k;i--)
#define vll(n,i) vector<long long>(n,i)
#define v2ll(n,m,i) vector<vector<long long>>(n,vll(m,i))
#define v3ll(n,m,k,i) vector<vector<vector<long long>>>(n,v2ll(m,k,i))
#define v4ll(n,m,k,l,i) vector<vector<vector<vector<long long>>>>(n,v3ll(m,k,l,i))
#define all(v) v.begin(),v.end()
#define chmin(k,m) k = min(k,m)
#define chmax(k,m) k = max(k,m)
#define Pr pair<ll,ll>
#define Tp tuple<ll,ll,ll>
#define riano_ std::ios::sync_with_stdio(false);std::cin.tie(nullptr)

#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")

//Graph
struct graph {
    long long N;
	vector<vector<tuple<long long,long long,int>>> G;
    vector<long long> par_v;
    vector<long long> par_e;
    int edge_count = 0;
    
	graph(long long n) {
        N = n;
		G = vector<vector<tuple<long long,long long,int>>>(N);
        par_v = vector<long long>(N,-1);
        par_e = vector<long long>(N,-1);
	}

    void unite(long long a,long long b,long long cost = 1,bool directed = false){
        G[a].emplace_back(b,cost,edge_count);
        if(!directed) G[b].emplace_back(a,cost,edge_count);
        edge_count++;
    }
};

const ll mod = 1e9+7;
template<uint64_t mod>
struct modint{
    uint64_t val;
    constexpr modint(const int64_t val_=0) noexcept:val((val_%int64_t(mod)+int64_t(mod))%int64_t(mod)){}
    constexpr modint operator-() const noexcept{
        return modint(*this)=mod-val;
    }
    constexpr modint operator+(const modint rhs) const noexcept{
        return modint(*this)+=rhs;
    }
    constexpr modint operator-(const modint rhs) const noexcept{
        return modint(*this)-=rhs;
    }
    constexpr modint operator*(const modint rhs) const noexcept{
        return modint(*this)*=rhs;
    }
    constexpr modint operator/(const modint rhs) const noexcept{
        return modint(*this)/=rhs;
    }
    constexpr modint &operator+=(const modint rhs) noexcept{
        val+=rhs.val;
        val-=((val>=mod)?mod:0);
        return (*this);
    }
    constexpr modint &operator-=(const modint rhs) noexcept{
        val+=((val<rhs.val)?mod:0);
        val-=rhs.val;
        return (*this);
    }
    constexpr modint &operator*=(const modint rhs) noexcept{
        val=val*rhs.val%mod;
        return (*this);
    }
    constexpr modint &operator/=(modint rhs) noexcept{
        uint64_t ex=mod-2;
        modint now=1;
        while(ex){
            now*=((ex&1)?rhs:1);
            rhs*=rhs,ex>>=1;
        }
        return (*this)*=now;
    }
    modint & operator++(){
        val++;
        if (val == mod) val = 0;
        return *this;
    }
    modint operator++(int){
        modint<mod> res = *this;
        ++*this;
        return res;
    }
    constexpr bool operator==(const modint rhs) noexcept{
        return val==rhs.val;
    }
    constexpr bool operator!=(const modint rhs) noexcept{
        return val!=rhs.val;
    }
    friend constexpr ostream &operator<<(ostream& os,const modint x) noexcept{
        return os<<(x.val);
    }
    friend constexpr istream &operator>>(istream& is,modint& x) noexcept{
        uint64_t t;
        is>>t,x=t;
        return is;
    }
};
typedef modint<mod> mint;
mint pw(long long a,long long b,long long m = mod){
    if(a%m==0) return mint(0);
    if(b==0) return mint(1);
    else if(b%2==0){
        long long x = pw(a,b/2,m).val;
        return mint(x*x);
    }
    else{
        long long x = pw(a,b-1,m).val;
        return mint(a*x);
    }
}
mint modinv(long long a, long long m = mod) {
    long long b = m, u = 1, v = 0;
    while (b) {
        long long t = a / b;
        a -= t * b; swap(a, b);
        u -= t * v; swap(u, v);
    }
    u %= m;
    return mint(u);
}
#define vm(n,i) vector<mint>(n,i)
#define v2m(n,m,i) vector<vector<mint>>(n,vm(m,i))
#define v3m(n,m,k,i) vector<vector<vector<mint>>>(n,v2m(m,k,i))
#define v4m(n,m,k,l,i) vector<vector<vector<vector<mint>>>>(n,v3m(m,k,l,i))
void out(vector<ll> &v){
    for(ll x:v) cout << x << " ";
    cout << "\n"; return;
}


//Unionfind
//size>4e5 の時はvが足りなくなるので注意
struct unionfind {
	//自身が親であれば、その集合に属する頂点数に-1を掛けたもの
	//そうでなければ親のid
	vector<long long> r;
    vector<bool> lp;
    vector<long long> cnt;
    vector<long long> repr;
    vector<long long> per;
	unionfind(long long N,vector<long long> v=vector<long long>(4e5+2,0)) { //vで代表点の優先順位をinput
		r = vector<long long>(N, -1);
        lp = vector<bool>(N,false);
        cnt = vector<long long>(N, 0);
        repr = vector<long long>(N, -1);
        rep(i,N) repr[i] = i;
        per = v;
	}
	long long root(long long x) {
		if (r[x] < 0) return x;
		return r[x] = root(r[x]);
	}
	bool unite(long long x, long long y) {
		x = root(x);
		y = root(y);
		if (x == y){
            lp[x] = true;
            return false;
        }
        long long tmp = 0;
		if (r[x] > r[y]) swap(x, y);
        tmp = repr[x];
        if(per[repr[x]]>per[repr[y]]){
            tmp = repr[y];
        }
		r[x] += r[y];
        cnt[x] += cnt[y];
		r[y] = x;
        repr[x] = tmp;
        lp[x] = (lp[x]||lp[y]);
		return true;
	}

	long long size(long long x) {
		return max(-r[root(x)],0LL);
	}
    long long count(long long x){
        return cnt[root(x)];
    }
    long long represent(long long x){
        return repr[root(x)];
    }
  
    // 2つのデータx, yが属する木が同じならtrueを返す
    bool same(long long x, long long y) { 
        long long rx = root(x);
        long long ry = root(y);
        return rx == ry;
    }
    //閉路の存在判定
    bool loop(ll x){
        return lp[root(x)];
    }
    //重みをつける場合
    void eval(ll i,ll x){
        cnt[i] = x;
    }
    void eval_add(ll i,ll x = 1){
        cnt[i] += x;
    }
};
    

int main(){
    riano_; ll ans = 0;
    ll N,M,K,H,W,Q,L,R,T; cin >> N;
    //main関数内で 
    unionfind uf(1e5+1);
    vector<ll> c(1e5+1,0);
    vector<ll> m(1e5+1,2e12);
    vector<vector<ll>> div(1e5+1);
    vector<Tp> ed;
    rep(i,1e5+1){
        for(int j=1;j*j<=i;j++){
            if(i%j==0){
                div[i].push_back(j);
                div[i].push_back(i/j);
            }
        }
    }
    ll mn = 2e9;
    rep(i,N){
        ll a; cin >> a; c[a]++; chmin(mn,a);
    }
    rep(i,1e5+1){
        if(c[i]==0) continue;
        if(c[i]>1) ans += (ll)(i)*(c[i]-1);
        // if(i!=mn){
        //     ll cand = 2e12;
        //     for(ll j:div[i]){
        //         if(i%j==0){
        //             chmin(cand,m[j]*(ll)(i));
        //         }
        //     }
        //     ans += cand;
        // }
        for(ll j:div[i]){
            if(i%j==0){
                chmin(m[j],(ll)(i/j));
            }
        }
    }
    rep(i,1e5+1){
        if(c[i]==0) continue;
        for(ll j:div[i]){
            if(i%j==0){
                ed.emplace_back((ll)(i)*m[j],(ll)i,m[j]*j);
            }
        }
    }
    sort(all(ed));
    for(auto[c,u,v]:ed){
        if(uf.same(u,v)) continue;
        ans += c;
        uf.unite(u,v);
    }

    cout << ans << endl;
}
0