#757218 (C++17) No.1917 LCMST

提出ソース

結果

問題	No.1917 LCMST
ユーザー	n_vip
提出日時	2022-04-29 23:24:28
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	447 ms / 4,000 ms
コード長	7,761 bytes
コンパイル時間	2,071 ms
コンパイル使用メモリ	160,828 KB
実行使用メモリ	34,416 KB
最終ジャッジ日時	2024-06-29 05:09:42
合計ジャッジ時間	17,471 ms
ジャッジサーバーID （参考情報）	judge2 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	47 ms 14,976 KB
testcase_01	AC	45 ms 15,104 KB
testcase_02	AC	44 ms 15,104 KB
testcase_03	AC	48 ms 15,360 KB
testcase_04	AC	46 ms 15,360 KB
testcase_05	AC	46 ms 15,232 KB
testcase_06	AC	48 ms 15,360 KB
testcase_07	AC	45 ms 15,360 KB
testcase_08	AC	44 ms 14,976 KB
testcase_09	AC	389 ms 22,348 KB
testcase_10	AC	380 ms 22,304 KB
testcase_11	AC	382 ms 23,672 KB
testcase_12	AC	417 ms 33,796 KB
testcase_13	AC	386 ms 33,636 KB
testcase_14	AC	405 ms 27,784 KB
testcase_15	AC	323 ms 26,512 KB
testcase_16	AC	386 ms 34,416 KB
testcase_17	AC	447 ms 33,780 KB
testcase_18	AC	435 ms 34,112 KB
testcase_19	AC	281 ms 23,492 KB
testcase_20	AC	252 ms 22,604 KB
testcase_21	AC	284 ms 23,652 KB
testcase_22	AC	250 ms 22,712 KB
testcase_23	AC	253 ms 22,732 KB
testcase_24	AC	285 ms 23,624 KB
testcase_25	AC	262 ms 22,748 KB
testcase_26	AC	261 ms 23,092 KB
testcase_27	AC	279 ms 23,176 KB
testcase_28	AC	281 ms 23,304 KB
testcase_29	AC	444 ms 19,020 KB
testcase_30	AC	441 ms 19,148 KB
testcase_31	AC	442 ms 19,184 KB
testcase_32	AC	436 ms 19,148 KB
testcase_33	AC	430 ms 19,024 KB
testcase_34	AC	158 ms 19,108 KB
testcase_35	AC	155 ms 19,104 KB
testcase_36	AC	153 ms 19,108 KB
testcase_37	AC	436 ms 20,044 KB
testcase_38	AC	431 ms 20,044 KB
testcase_39	AC	436 ms 19,916 KB
testcase_40	AC	428 ms 19,948 KB
testcase_41	AC	438 ms 19,972 KB
testcase_42	AC	416 ms 20,044 KB
testcase_43	AC	181 ms 19,408 KB
testcase_44	AC	180 ms 19,408 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#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);}
};

ll solve(const vector<int> &vs){
	vv<int> facts(100345);
	reps(i,1,facts.size())for(int j=i;j<facts.size();j+=i) facts[j].eb(i);
	const int n=vs.size();
	vector<pll> mn(100345,pll(MOD,-1));
	vector<tuple<ll,int,int>> es;
	rep(i,n){
		cauto &v=vs[i];
		for(cauto &g:facts[v])if(cauto &[u,j]=mn[g]; j>=0) es.eb(u*v/__gcd<ll>(u,v),i,j);
		for(cauto &g:facts[v]) MN(mn[g], pll(v,i));
	}
	sort(all(es));
	UF uf(n);
	ll re=0;
	for(cauto &[v,i,j]:es)if(uf(i,j)) re+=v;
	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);
	// cauto n=50000;
	// vector<int> vs(n); iota(all(vs),50001);
	ll re=0;
	set<int> st;
	for(cauto &v:vs-sorted-reversed){
		if(st.emplace(v).Y){
			for(int i=v+v;i<112345;i+=v)if(st.erase(i)) re+=i;
		}else{
			re+=v;
		}
	}
	out(st.size(),1);
	re+=solve(vector<int>(all(st)));
	cout<<re NL;
	return 0;
}

yukicoder

結果

テストケース

ソースコード