結果
| 問題 | No.2497 GCD of LCMs |
| ユーザー |
 Misuki
|
| 提出日時 | 2024-01-25 16:00:36 |
| 言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 48 ms / 2,000 ms |
| コード長 | 5,757 bytes |
| コンパイル時間 | 2,872 ms |
| コンパイル使用メモリ | 222,892 KB |
| 実行使用メモリ | 5,376 KB |
| 最終ジャッジ日時 | 2024-09-28 07:20:53 |
| 合計ジャッジ時間 | 3,554 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 14 |
ソースコード
#pragma GCC optimize("O2")#include <algorithm>#include <array>#include <bit>#include <bitset>#include <cassert>#include <cctype>#include <cfenv>#include <cfloat>#include <chrono>#include <cinttypes>#include <climits>#include <cmath>#include <compare>#include <complex>#include <concepts>#include <cstdarg>#include <cstddef>#include <cstdint>#include <cstdio>#include <cstdlib>#include <cstring>#include <deque>#include <fstream>#include <functional>#include <initializer_list>#include <iomanip>#include <ios>#include <iostream>#include <istream>#include <iterator>#include <limits>#include <list>#include <map>#include <memory>#include <new>#include <numbers>#include <numeric>#include <ostream>#include <queue>#include <random>#include <ranges>#include <set>#include <span>#include <sstream>#include <stack>#include <streambuf>#include <string>#include <tuple>#include <type_traits>#include <variant>//#define int ll#define INT128_MAX (__int128)(((unsigned __int128) 1 << ((sizeof(__int128) * __CHAR_BIT__) - 1)) - 1)#define INT128_MIN (-INT128_MAX - 1)#define clock chrono::steady_clock::now().time_since_epoch().count()#ifdef DEBUG#define dbg(x) cout << (#x) << " = " << x << '\n'#else#define dbg(x)#endifnamespace R = std::ranges;namespace V = std::views;using namespace std;using ll = long long;using ull = unsigned long long;using ldb = long double;using pii = pair<int, int>;using pll = pair<ll, ll>;//#define double ldbtemplate<class T>ostream& operator<<(ostream& os, const pair<T, T> pr) {return os << pr.first << ' ' << pr.second;}template<class T, size_t N>ostream& operator<<(ostream& os, const array<T, N> &arr) {for(const T &X : arr)os << X << ' ';return os;}template<class T>ostream& operator<<(ostream& os, const vector<T> &vec) {for(const T &X : vec)os << X << ' ';return os;}template<class T>ostream& operator<<(ostream& os, const set<T> &s) {for(const T &x : s)os << x << ' ';return os;}//reference: https://github.com/NyaanNyaan/library/blob/master/modint/montgomery-modint.hpp#L10//note: mod should be a prime less than 2^30.template<uint32_t mod>struct MontgomeryModInt {using mint = MontgomeryModInt;using i32 = int32_t;using u32 = uint32_t;using u64 = uint64_t;static constexpr u32 get_r() {u32 res = 1, base = mod;for(i32 i = 0; i < 31; i++)res *= base, base *= base;return -res;}static constexpr u32 get_mod() {return mod;}static constexpr u32 n2 = -u64(mod) % mod; //2^64 % modstatic constexpr u32 r = get_r(); //-P^{-1} % 2^32u32 a;static u32 reduce(const u64 &b) {return (b + u64(u32(b) * r) * mod) >> 32;}static u32 transform(const u64 &b) {return reduce(u64(b) * n2);}MontgomeryModInt() : a(0) {}MontgomeryModInt(const int64_t &b): a(transform(b % mod + mod)) {}mint pow(u64 k) const {mint res(1), base(*this);while(k) {if (k & 1)res *= base;base *= base, k >>= 1;}return res;}mint inverse() const { return (*this).pow(mod - 2); }u32 get() const {u32 res = reduce(a);return res >= mod ? res - mod : res;}mint& operator+=(const mint &b) {if (i32(a += b.a - 2 * mod) < 0) a += 2 * mod;return *this;}mint& operator-=(const mint &b) {if (i32(a -= b.a) < 0) a += 2 * mod;return *this;}mint& operator*=(const mint &b) {a = reduce(u64(a) * b.a);return *this;}mint& operator/=(const mint &b) {a = reduce(u64(a) * b.inverse().a);return *this;}mint operator-() { return mint() - mint(*this); }bool operator==(mint b) const {return (a >= mod ? a - mod : a) == (b.a >= mod ? b.a - mod : b.a);}bool operator!=(mint b) const {return (a >= mod ? a - mod : a) != (b.a >= mod ? b.a - mod : b.a);}friend mint operator+(mint a, mint b) { return a += b; }friend mint operator-(mint a, mint b) { return a -= b; }friend mint operator*(mint a, mint b) { return a *= b; }friend mint operator/(mint a, mint b) { return a /= b; }friend ostream& operator<<(ostream& os, const mint& b) {return os << b.get();}friend istream& operator>>(istream& is, mint& b) {int64_t val;is >> val;b = mint(val);return is;}};using mint = MontgomeryModInt<998244353>;signed main() {ios::sync_with_stdio(false), cin.tie(NULL);int n, m; cin >> n >> m;vector<int> a(n);for(int &x : a)cin >> x;vector<vector<int>> g(n);while(m--) {int u, v; cin >> u >> v;u--, v--;g[u].emplace_back(v);g[v].emplace_back(u);}vector<int> cand;for(int x : a) {int y = x;for(int i = 2; i * i <= x; i++) {if (y % i != 0) continue;cand.emplace_back(i);while(y % i == 0) y /= i;}if (y != 1)cand.emplace_back(y);}R::sort(cand);cand.resize(unique(cand.begin(), cand.end()) - cand.begin());dbg(cand);vector<mint> ans(n, 1);for(int p : cand) {vector<int> w(n);for(int i = 0; i < n; i++)while(a[i] % p == 0)w[i]++, a[i] /= p;vector<int> vis(n, -1);array<queue<int>, 30> q;q[w[0]].push(0);for(int i = 0; i < 30; i++) {while(!q[i].empty()) {int v = q[i].front(); q[i].pop();if (vis[v] != -1) continue;vis[v] = i;for(int x : g[v])q[max(i, w[x])].push(x);}}array<mint, 30> powP;powP[0] = 1;for(int i = 1; i < 30; i++)powP[i] = powP[i - 1] * p;dbg(vis);dbg(w);for(int i = 0; i < n; i++)ans[i] *= powP[vis[i]];}for(mint x : ans)cout << x << '\n';return 0;}