結果

問題 No.2497 GCD of LCMs
ユーザー pitP
提出日時 2023-10-07 06:59:07
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 52 ms / 2,000 ms
コード長 3,536 bytes
コンパイル時間 4,403 ms
コンパイル使用メモリ 273,760 KB
最終ジャッジ日時 2025-02-17 06:01:55
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 14
権限があれば一括ダウンロードができます

ソースコード

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<int> A(N);
    rep(i,N) cin >> A[i];
    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);
    }
    // 
    set<int> st;
    rep(i,N){
        auto facts = prime_factorize(A[i]);
        for(auto [p, e] : facts) st.insert(p);
    }
    int L = 0;
    map<int,int> p2idx, idx2p;
    for(auto itr=st.begin(); itr!=st.end(); itr++){
        p2idx[*itr] = L;
        idx2p[L++] = *itr;
    }
    vector<vector<int>> primes(N, vector<int>(L, 0));
    rep(i,N){
        auto facts = prime_factorize(A[i]);
        for(auto [p, e] : facts) {
            primes[i][p2idx[p]] = e;
        }
    }
    // 
    auto dijkstra = [&](int p_idx){
        vector<int> dist(N, INF);
        dist[0] = primes[0][p_idx];
        priority_queue<pii> pq;
        pq.push(make_pair(dist[0], 0));
        while(!pq.empty()){
            int cost = pq.top().first;
            int now = pq.top().second;
            pq.pop();
            if (cost != dist[now]) continue;
            for(auto nxt : g[now]){
                if (max(primes[nxt][p_idx], cost) < dist[nxt]){
                    dist[nxt] = max(primes[nxt][p_idx], cost);
                    pq.push(make_pair(max(primes[nxt][p_idx], cost), nxt));
                }
            }
        }
        return dist;
    };
    vector<mint> ans(N, mint(1));
    rep(j,L) {
        auto dist = dijkstra(j);
        rep(i,N) ans[i] *= mint(idx2p[j]).pow(dist[i]);
    }
    rep(i,N) cout << ans[i] << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0