結果
| 問題 | No.1917 LCMST |
| ユーザー |
 n_vip
|
| 提出日時 | 2022-04-29 22:34:51 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 8,549 bytes |
| コンパイル時間 | 2,318 ms |
| コンパイル使用メモリ | 172,824 KB |
| 実行使用メモリ | 53,952 KB |
| 最終ジャッジ日時 | 2024-06-29 04:11:22 |
| 合計ジャッジ時間 | 76,555 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge4 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 117 ms
28,248 KB |
| testcase_01 | AC | 49 ms
19,072 KB |
| testcase_02 | AC | 204 ms
28,248 KB |
| testcase_03 | WA | - |
| testcase_04 | WA | - |
| testcase_05 | WA | - |
| testcase_06 | WA | - |
| testcase_07 | WA | - |
| testcase_08 | AC | 192 ms
28,320 KB |
| testcase_09 | WA | - |
| testcase_10 | WA | - |
| testcase_11 | WA | - |
| testcase_12 | WA | - |
| testcase_13 | WA | - |
| testcase_14 | WA | - |
| testcase_15 | WA | - |
| testcase_16 | WA | - |
| testcase_17 | WA | - |
| testcase_18 | WA | - |
| testcase_19 | WA | - |
| testcase_20 | WA | - |
| testcase_21 | WA | - |
| testcase_22 | WA | - |
| testcase_23 | WA | - |
| testcase_24 | WA | - |
| testcase_25 | WA | - |
| testcase_26 | WA | - |
| testcase_27 | WA | - |
| testcase_28 | WA | - |
| testcase_29 | AC | 1,273 ms
23,008 KB |
| testcase_30 | AC | 1,269 ms
23,132 KB |
| testcase_31 | AC | 1,275 ms
23,004 KB |
| testcase_32 | AC | 1,271 ms
23,092 KB |
| testcase_33 | AC | 1,269 ms
23,024 KB |
| testcase_34 | AC | 204 ms
23,092 KB |
| testcase_35 | AC | 205 ms
23,072 KB |
| testcase_36 | AC | 202 ms
22,968 KB |
| testcase_37 | AC | 1,964 ms
34,220 KB |
| testcase_38 | AC | 1,973 ms
34,132 KB |
| testcase_39 | AC | 2,006 ms
34,216 KB |
| testcase_40 | AC | 2,027 ms
34,092 KB |
| testcase_41 | AC | 1,989 ms
34,224 KB |
| testcase_42 | WA | - |
| testcase_43 | WA | - |
| testcase_44 | WA | - |
ソースコード
#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#include<cassert>
#include<random>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int X = 0;X < (int)(Y);++X)
#define reps(X,S,Y) for (int X = (int)(S);X < (int)(Y);++X)
#define rrep(X,Y) for (int X = (int)(Y)-1;X >=0;--X)
#define rreps(X,S,Y) for (int X = (int)(Y)-1;X >= (int)(S);--X)
#define repe(X,Y) for (X = 0;X < (Y);++X)
#define peat(X,Y) for (;X < (Y);++X)
#define all(X) X.begin(),X.end()
#define rall(X) X.rbegin(),X.rend()
#define eb emplace_back
#define UNIQUE(X) X.erase(unique(all(X)),X.end())
#define Endl endl
#define NL <<"\n"
#define cauto const auto
using namespace std;
using ll=long long;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
template<class T> using vv=vector<vector<T>>;
template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}
template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}
//#undef NUIP
#ifdef NUIP
#include "benri.h"
#else
#define out(args...)
#endif
void ouT(ll x,int d=3){auto re=to_string(x);if((int)re.size()>d) re=x>0?"oo":"-oo";cout<<string(d-re.size(),' ')<<re<<",";}
#ifdef __cpp_init_captures
template<typename T>vector<T> table(int n, T v){ return vector<T>(n, v);}
template <class... Args> auto table(int n, Args... args){auto val = table(args...); return vector<decltype(val)>(n, move(val));}
#endif
template<class A,class B> pair<A,B> operator+(const pair<A,B> &p,const pair<A,B> &q){ return {p.X+q.X,p.Y+q.Y};}
template<class A,class B,class C,class D> pair<A,B>& operator+=(pair<A,B> &p,const pair<C,D> &q){ p.X+=q.X; p.Y+=q.Y; return p;}
template<class A,class B> pair<A,B> operator-(const pair<A,B> &p,const pair<A,B> &q){ return {p.X-q.X,p.Y-q.Y};}
template<class A,class B,class C,class D> pair<A,B>& operator-=(pair<A,B> &p,const pair<C,D> &q){ p.X-=q.X; p.Y-=q.Y; return p;}
template<class A,class B> istream& operator>>(istream &is, pair<A,B> &p){ is>>p.X>>p.Y; return is;}
template<class T=ll> T read(){ T re; cin>>re; return re;}
template<class T=ll> T read(const T &dec){ T re; cin>>re; return re-dec;}
template<class T=ll> vector<T> readV(const int sz){ vector<T> re(sz); for(auto &x:re) x=read<T>(); return re;}
template<class T=ll> vector<T> readV(const int sz, const T &dec){ vector<T> re(sz); for(auto &x:re) x=read<T>(dec); return re;}
vv<int> readG(const int &n,const int &m){ vv<int> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); g[a].pb(b); g[b].pb(a);} return g;}
vv<int> readG(const int &n){ return readG(n,n-1);}
vv<int> readD(const int &n,const int &m){ vv<int> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); g[a].pb(b); } return g;}
vv<int> readD(const int &n){ return readD(n,n-1);}
template<class T> vv<pair<int,T>> readG(const int &n,const int &m){ vv<pair<int,T>> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); cauto c=read<T>(); g[a].eb(b,c); g[b].eb(a,c);} return g;}
template<class T> vv<pair<int,T>> readG(const int &n){ return readG<T>(n,n-1);}
template<class T> vv<pair<int,T>> readD(const int &n,const int &m){ vv<pair<int,T>> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); cauto c=read<T>(); g[a].eb(b,c); } return g;}
template<class T> vv<pair<int,T>> readD(const int &n){ return readD<T>(n,n-1);}
#ifdef __cpp_deduction_guides
template<typename T> vector<T> readT(int n, T v){ return readV(n,v);}
template <class... Args> auto readT(int n, Args... args){ vector re(1,readT(args...));rep(_,n-1) re.eb(readT(args...)); return re;}
template<class Tuple, size_t... Is> void read_tuple_impl(istream &is, Tuple& t, index_sequence<Is...>){((is >> get<Is>(t)), ...);}
template<class... Args> auto& operator>>(istream &is, tuple<Args...>& t){ read_tuple_impl(is, t, index_sequence_for<Args...>{}); return is;}
template<class T> bool erase(multiset<T> &st, const T &v){if(cauto it=st.find(v); it==st.end()) return false; else{ st.erase(it); return true;}}
#endif
#ifdef __cpp_init_captures
template<typename T, size_t... Is> void addadd(T& t1, const T& t2, integer_sequence<size_t, Is...>){ cauto l = { (get<Is>(t1) += get<Is>(t2), 0)... }; (void)l;}
template <typename...T>tuple<T...>& operator += (tuple<T...>& lhs, const tuple<T...>& rhs){ addadd(lhs, rhs, index_sequence_for<T...>{}); return lhs;}
template <typename...T>tuple<T...> operator +(tuple<T...> lhs, const tuple<T...>& rhs){ return lhs += rhs;}
template<typename T, size_t... Is> void subsub(T& t1, const T& t2, integer_sequence<size_t, Is...>){ cauto l = { (get<Is>(t1) -= get<Is>(t2), 0)... }; (void)l;}
template <typename...T>tuple<T...>& operator -= (tuple<T...>& lhs, const tuple<T...>& rhs){ subsub(lhs, rhs, index_sequence_for<T...>{}); return lhs;}
template <typename...T>tuple<T...> operator - (tuple<T...> lhs, const tuple<T...>& rhs){ return lhs -= rhs;}
#endif
#define TT cauto TTT=read();rep(_,TTT)
struct sorted_impl{template<class T>friend vector<T>operator-(vector<T>a,sorted_impl){sort(all(a));return a;}friend string operator-(string a,sorted_impl){sort(all(a));return a;}}sorted;struct reversed_impl{template<class T>friend vector<T>operator-(vector<T> a,reversed_impl){reverse(all(a));return a;}friend string operator-(string a,reversed_impl){reverse(all(a));return a;}}reversed;struct distinct_impl{template<class T>friend vector<T>operator-(vector<T> a,distinct_impl){sort(all(a));UNIQUE(a);return a;}}distinct;template<class S>struct sortedWith{const S f;sortedWith(const S &f):f(f){}template<class T>friend vector<T>operator-(vector<T> a,const sortedWith&b){sort(all(a),[&](cauto&i,cauto&j){return b.f(i)<b.f(j);});return a;}};
template<class T>int operator/(const T&v,const vector<T>&vs){return lower_bound(all(vs),v)-vs.begin();}
vector<int> Inds(const int n){vector<int> inds(n);iota(all(inds),0);return inds;}
const ll MOD=1e9+7; //998244353;
struct UF{
vector<int> data;
UF(const int &size):data(size,-1){}
int unite(int x, int y){
x=root(x); y=root(y);
if(x==y) return 0;
if(-data[y]>-data[x]) swap(x,y);
data[x]+=data[y]; data[y]=x;
return y+1;
}
bool findSet(const int &x, const int &y){ return root(x)==root(y);}
int root(const int &x){ return data[x]<0?x:data[x]=root(data[x]);}
int size(const int &x){ return -data[root(x)];}
int size(){ return count_if(all(data),[](const int &x){ return x<0;});}; //unverified
int operator()(const int &x, const int &y){ return unite(x,y);}
// int operator()(const pii &xy){ return unite(xy.X,xy.Y);}
int operator[](const int &x){ return root(x);}
bool operator[](const pii &xy){ return findSet(xy.X,xy.Y);}
};
vector<int> primes,prime;
vv<pii> facts;
class PRPRPR{
public:
PRPRPR(int PRIME_MAX){
prime.resize(PRIME_MAX);
for(int i=2;i<PRIME_MAX;i++)if(!prime[i]){
primes.pb(i);
for(int j=i*2;j<PRIME_MAX;j+=i)
prime[j]=1;
}
// fact();
}
void fact(){
facts.resize(prime.size());
for(cauto &p:primes){
for(ll i=p;i<(int)facts.size();i+=p) facts[i].eb(p,1);
for(ll pp=1ll*p*p;pp<(int)facts.size();pp*=p){
for(ll i=pp;i<facts.size();i+=pp) ++facts[i].back().Y;
}
}
}
} prprprpr(112345);
ll solve(const vector<int> &vs){
const int n=vs.size();
const int N=112345;
vv<pii> g(2*N);
reps(i,1,N){
for(cauto &p:primes){
cauto j=i*p;
if(j>=N) break;
g[N+j].eb(N+i,j/i);
g[i].eb(j,j/i);
}
g[N+i].eb(i,i);
}
vector<tuple<int,int,int>> es;
rep(d,20)rep(s,2)if((n-1)>>d){
vector<pll> dst(2*N,pll(MOD,0));
using piii=pair<pll,int>;
priority_queue<piii,vector<piii>,greater<piii>> pq;
rep(i,n)if((i>>d&1)==s && MN(dst[N+vs[i]],pll(1,i))) pq.emplace(dst[N+vs[i]],N+vs[i]);
while(pq.size()){
cauto [d,v]=pq.top(); pq.pop();
if(dst[v]!=d) continue;
for(cauto &[u,d]:g[v])if(MN(dst[u],pll(d*dst[v].X,dst[v].Y))) pq.emplace(dst[u],u);
}
rep(i,n)if((i>>d&1)!=s) es.eb(dst[vs[i]].X, i, dst[vs[i]].Y);
}
sort(all(es));
out(es,1);
ll re=0;
UF uf(n);
for(cauto &[d,x,y]:es)if(uf(x,y)) re+=d;
return re;
}
int main(){
ios_base::sync_with_stdio(false); cin.tie(0);
cout<<fixed<<setprecision(0);
cauto n=read(0);
cauto vs=readV(n,0);
ll re=0;
set<int> st;
for(cauto &v:vs-sorted-reversed){
for(int i=v;i<112345;i+=v)if(st.erase(i)) re+=i;
st.emplace(v);
}
re+=solve(vector<int>(all(st)));
cout<<re NL;
return 0;
}