結果

問題 No.2497 GCD of LCMs
ユーザー 👑 AngrySadEightAngrySadEight
提出日時 2023-09-05 18:04:40
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 631 ms / 2,000 ms
コード長 5,689 bytes
コンパイル時間 6,207 ms
コンパイル使用メモリ 248,832 KB
実行使用メモリ 10,652 KB
最終ジャッジ日時 2024-06-23 13:34:06
合計ジャッジ時間 9,727 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 4 ms
5,248 KB
testcase_02 AC 4 ms
5,248 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 4 ms
5,376 KB
testcase_07 AC 54 ms
5,376 KB
testcase_08 AC 184 ms
5,632 KB
testcase_09 AC 213 ms
5,760 KB
testcase_10 AC 374 ms
9,984 KB
testcase_11 AC 142 ms
6,272 KB
testcase_12 AC 453 ms
8,148 KB
testcase_13 AC 585 ms
10,496 KB
testcase_14 AC 127 ms
9,472 KB
testcase_15 AC 106 ms
9,216 KB
testcase_16 AC 631 ms
10,652 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

ll my_pow(ll x, ll n, ll mod) {
    // 　繰り返し二乗法．x^nをmodで割った余り．
    ll ret;
    if (n == 0) {
        ret = 1;
    } else if (n % 2 == 1) {
        ret = (x * my_pow((x * x) % mod, n / 2, mod)) % mod;
    } else {
        ret = my_pow((x * x) % mod, n / 2, mod);
    }
    return ret;
}

ll inv(ll x, ll mod) { return my_pow(x, mod - 2, mod); }

int main() {
    ll N, M;
    cin >> N >> M;
    assert(N >= 1 && N <= 250);
    assert(M >= N - 1 && M <= min(N * (N - 1) / 2, 8000LL));
    vector<ll> A(N);
    for (ll i = 0; i < N; i++) {
        cin >> A[i];
        assert(A[i] >= 1);
        assert(A[i] < 998244353);
    }
    vector<ll> U(M);
    vector<ll> V(M);
    map<pll, ll> edges;
    for (ll i = 0; i < M; i++) {
        cin >> U[i] >> V[i];
        assert(U[i] >= 1);
        assert(U[i] < V[i]);
        assert(V[i] <= N);
        assert(edges[pll(U[i], V[i])] == 0);
        edges[pll(U[i], V[i])]++;
        U[i]--;
        V[i]--;
    }
    dsu tree(N);
    for (ll i = 0; i < M; i++) {
        tree.merge(U[i], V[i]);
    }
    for (ll i = 0; i < N; i++) {
        assert(tree.same(0, i));
    }
    map<ll, ll> mp;
    vector<map<ll, ll>> mp_vec(N);
    for (ll i = 0; i < N; i++) {
        ll A_cpy = A[i];
        for (ll j = 2; j * j <= A[i]; j++) {
            while (true) {
                if (A_cpy % j != 0) {
                    break;
                }
                A_cpy /= j;
                mp[j]++;
                mp_vec[i][j]++;
            }
        }
        if (A_cpy != 1) {
            mp[A_cpy]++;
            mp_vec[i][A_cpy]++;
        }
    }
    vector<ll> primes(0);
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        primes.push_back(itr->first);
    }
    ll INF = 2000000000;
    vector<ll> ans(N, 1);
    for (ll i = 0; i < primes.size(); i++) {
        ll p = primes[i];
        vector<vector<pll>> graph(N, vector<pll>(0));
        for (ll j = 0; j < M; j++) {
            graph[U[j]].push_back(pll(V[j], mp_vec[V[j]][p]));
            graph[V[j]].push_back(pll(U[j], mp_vec[U[j]][p]));
        }
        vector<ll> dist(N, INF);
        priority_queue<pll, vector<pll>, greater<pll>> pque;
        dist[0] = mp_vec[0][p];
        pque.push(pll(dist[0], 0));
        while (pque.size()) {
            pll pp = pque.top();
            pque.pop();
            ll prev_d = pp.first;
            ll prev_e = pp.second;
            if (dist[prev_e] < prev_d) {
                continue;
            }
            for (ll j = 0; j < graph[prev_e].size(); j++) {
                ll next_e = graph[prev_e][j].first;
                ll next_d = graph[prev_e][j].second;
                next_d = max(next_d, prev_d);
                if (next_d < dist[next_e]) {
                    dist[next_e] = next_d;
                    pque.push(pll(next_d, next_e));
                }
            }
        }
        // debug(dist);
        for (ll j = 0; j < N; j++) {
            ans[j] = (ans[j] * my_pow(p, dist[j], mod2)) % mod2;
        }
    }
    for (ll i = 0; i < N; i++) {
        cout << ans[i] << endl;
    }
}
0