結果

問題 No.2497 GCD of LCMs
ユーザー pitP
提出日時 2023-10-06 23:13:12
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
TLE  
実行時間 -
コード長 3,694 bytes
コンパイル時間 4,707 ms
コンパイル使用メモリ 271,128 KB
最終ジャッジ日時 2025-02-17 05:33:25
ジャッジサーバーID
(参考情報)
judge1 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 4 TLE * 1 -- * 9
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
istream &operator>>(istream &is, modint &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint &a) { return os << a.val(); }
istream &operator>>(istream &is, modint998244353 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint998244353 &a) { return os << a.val(); }
istream &operator>>(istream &is, modint1000000007 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint1000000007 &a) { return os << a.val(); }
typedef long long ll;
typedef vector<vector<int>> Graph;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define rep(i,n) for (int i = 0;i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define my_sort(x) sort(x.begin(), x.end())
#define my_max(x) *max_element(all(x))
#define my_min(x) *min_element(all(x))
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<62) - 1;
const int MOD = 998244353;
const int MOD2 = 1e9+7;
const double PI = acos(-1);
vector<int> di = {1,0,-1,0};
vector<int> dj = {0,1,0,-1};
#ifdef LOCAL
# include <debug_print.hpp>
# define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
# define debug(...) (static_cast<void>(0))
#endif
vector<pll> prime_factorize(ll n){
vector<pll> res;
for(ll i = 2; i * i <= n ; i++){
if(n % i != 0ll)continue;
ll tmp = 0ll;
while(n % i == 0ll){
tmp++;
n /= i;
}
res.push_back(make_pair(i,tmp));
}
if (n != 1ll) res.push_back(make_pair(n,1ll));
return res;
}
using mint = modint998244353;
int main(){
cin.tie(0);
ios_base::sync_with_stdio(false);
int N,M; cin >> N >> M;
vector<bool> visited(N, false);
vector<int> A(N);
rep(i,N) cin >> A[i];
//
set<int> st;
rep(i,N){
auto res = prime_factorize(A[i]);
for(auto [p, e] : res){
st.insert(p);
}
}
map<int,int> p2idx, idx2p;
int cnt = 0;
for(auto itr = st.begin(); itr != st.end(); itr++){
idx2p[cnt] = *itr;
p2idx[*itr] = cnt++;
}
int L = st.size();
vector<vector<pii>> buf(N);
rep(i,N)rep(j,L){
int e = 0;
int v = A[i];
while((v % idx2p[j]) == 0){
v /= idx2p[j];
e++;
}
if(e)buf[i].push_back(make_pair(j, e));
}
debug(buf);
//
Graph g(N);
rep(_,M){
int U,V; cin >> U >> V;
g[U - 1].push_back(V - 1);
g[V - 1].push_back(U - 1);
}
vector<int> ans(L, INF);
vector<int> tmp(L, 0);
auto dfs = [&](auto dfs, int now, int goal) -> void {
if (now == goal){
rep(j,L) chmin(ans[j], tmp[j]);
return;
}
for(auto nxt : g[now]){
if (visited[nxt]) continue;
vector<int> org = tmp;
for(auto [j, e] : buf[nxt]){
chmax(tmp[j], e);
}
visited[nxt] = true;
dfs(dfs, nxt, goal);
visited[nxt] = false;
tmp = org;
}
};
rep(i,N){
rep(j,L)ans[j] = INF;
visited[0] = true;
for(auto [j, e] : buf[0]){
chmax(tmp[j], e);
}
dfs(dfs, 0, i);
visited[0] = false;
mint dot = mint(1);
rep(j,L)rep(_,ans[j]) dot *= idx2p[j];
cout << dot << endl;
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0