結果
| 問題 |
No.3250 最小公倍数
|
| ユーザー |
 GOTKAKO
|
| 提出日時 | 2025-08-29 22:07:03 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 6,757 bytes |
| コンパイル時間 | 2,693 ms |
| コンパイル使用メモリ | 221,588 KB |
| 実行使用メモリ | 176,832 KB |
| 最終ジャッジ日時 | 2025-08-29 22:07:36 |
| 合計ジャッジ時間 | 31,234 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 |
| other | AC * 18 TLE * 3 |
ソースコード
#include <bits/stdc++.h>
using namespace std;
//入力が必ず-mod<a<modの時.
template<const int mod>
struct modint{ //mod変更が不可能.
public:
long long v = 0;
static void setmod(int m){} //飾り.
static constexpr long long getmod(){return mod;}
modint(){v = 0;} modint(int a){v = a<0?a+mod:a;} modint(long long a){v = a<0?a+mod:a;}
modint(unsigned int a){v = a;} modint(unsigned long long a){v = a;}
long long val()const{return v;}
modint &operator=(const modint &b) = default;
modint operator+()const{return (*this);}
modint operator-()const{return modint(0)-(*this);}
modint operator+(const modint b)const{return modint(v)+=b;}
modint operator-(const modint b)const{return modint(v)-=b;}
modint operator*(const modint b)const{return modint(v)*=b;}
modint operator/(const modint b)const{return modint(v)/=b;}
modint operator+=(const modint b){
v += b.v; if(v >= mod) v -= mod;
return *this;
}
modint operator-=(const modint b){
v -= b.v; if(v < 0) v += mod;
return *this;
}
modint operator*=(const modint b){v = v*b.v%mod; return *this;}
modint operator/=(modint b){ //b!=0 mod素数が必須.
if(b == 0) assert(false);
int left = mod-2;
while(left){if(left&1) *this *= b; b *= b; left >>= 1;}
return *this;
}
modint operator++(){*this += 1; return *this;}
modint operator--(){*this -= 1; return *this;}
modint operator++(int){*this += 1; return *this;}
modint operator--(int){*this -= 1; return *this;}
bool operator==(const modint b)const{return v == b.v;}
bool operator!=(const modint b)const{return v != b.v;}
bool operator>(const modint b)const{return v > b.v;}
bool operator>=(const modint b)const{return v >= b.v;}
bool operator<(const modint b)const{return v < b.v;}
bool operator<=(const modint b)const{return v <= b.v;}
modint pow(long long n)const{
modint ret = 1,p = v;
if(n < 0) p = p.inv(),n = -n;
while(n){
if(n&1) ret *= p;
p *= p; n >>= 1;
}
return ret;
}
modint inv()const{return modint(1)/v;} //素数mod必須.
};
using mint = modint<998244353>; const long long mod = 998244353;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int Limit = 1001001; //Limit->必要なサイズ fac->x! facinv->1/x! inv->1/x.
vector<mint> fac(Limit+1,1),facinv(Limit+1);
{
int mod = mint::getmod(),invstart = min(mod-1,Limit);
for(int i=1; i<=Limit; i++) fac.at(i) = fac.at(i-1)*i;
facinv.at(invstart) = fac.at(invstart).inv();
for(int i=invstart-1; i>=0; i--) facinv.at(i) = facinv.at(i+1)*(i+1);
}
vector<mint> inv(Limit+1); for(int i=1; i<=Limit; i++) inv.at(i) = fac.at(i-1)*facinv.at(i); //必要なら解放.
auto nCr = [&](int n,int r) -> mint {
if(n < r || r < 0 || n < 0) return 0;
return fac.at(n)*facinv.at(r)*facinv.at(n-r);
};
int Need = 1001001;
vector<vector<pair<int,int>>> Pf(Need+1);
vector<bool> prime(Need+1,true);
prime.at(0) = false; prime.at(1) = false;
for(int i=2; i<=Need; i++){
if(!prime.at(i)) continue;
Pf.at(i) = {{i,1}};
for(int k=i+i; k<=Need; k+=i){
prime.at(k) = false;
int f = 0,k2 = k;
while(k2%i == 0) f++,k2 /= i;
Pf.at(k).push_back({i,f});
}
}
int N; cin >> N;
vector<int> A(N);
for(auto &a : A) cin >> a;
vector<vector<int>> Graph(N);
for(int i=0; i<N-1; i++){
int u,v; cin >> u >> v;
u--; v--;
Graph.at(u).push_back(v);
Graph.at(v).push_back(u);
}
{
vector<int> siz(N);
auto dfs = [&](auto dfs,int pos,int back) -> int {
int ret = 1;
for(auto to : Graph.at(pos)) if(to != back) ret += dfs(dfs,to,pos);
siz.at(pos) = ret;
return ret;
};
dfs(dfs,0,-1);
for(auto &g : Graph) sort(g.begin(),g.end(),[&](auto a,auto b){return siz.at(a)>siz.at(b);});
}
vector<mint> answer(N);
{
vector<vector<pair<int,int>>> C(1001001);
for(int i=2; i<1001001; i++) if(prime.at(i)){
C.at(i).resize(20);
long long v = 1;
for(int k=0; k<20; k++){
C.at(i).at(k) = {0,v};
if(k == 0) C.at(i).at(k) = {1,v};
v *= i;
if(v >= 1001001) break;
}
}
vector<int> best(1001001);
mint now = 1;
auto dfs = [&](auto dfs,int pos,int back,bool leader) -> void {
int big = -1;
for(auto to : Graph.at(pos)){
if(to == back) continue;
big = to; break;
}
for(auto to : Graph.at(pos)){
if(to == back || to == big) continue;
dfs(dfs,to,pos,false);
}
if(big != -1) dfs(dfs,big,pos,true);
{
auto dfs2 = [&](auto dfs2,int po,int ba) -> void {
for(auto [p,e] : Pf.at(A.at(po))){
if(best.at(p) < e){
auto [ign,v1] = C.at(p).at(best.at(p));
now *= inv.at(v1);
best.at(p) = e;
now *= C.at(p).at(e).second;
}
C.at(p).at(e).first++;
}
for(auto to : Graph.at(po)) if(to != ba) dfs2(dfs2,to,po);
};
for(auto to : Graph.at(pos)){
if(to == back || to == big) continue;
dfs2(dfs2,to,pos);
}
}
for(auto [p,e] : Pf.at(A.at(pos))){
if(best.at(p) < e){
auto [ign,v1] = C.at(p).at(best.at(p));
now *= inv.at(v1);
best.at(p) = e;
now *= C.at(p).at(e).second;
}
C.at(p).at(e).first++;
}
answer.at(pos) = now;
if(!leader){
auto dfs2 = [&](auto dfs2,int po,int ba) -> void {
for(auto to : Graph.at(po)){
if(to == ba) continue;
dfs2(dfs2,to,po);
}
for(auto [p,e] : Pf.at(A.at(po))){
best.at(p) = 0;
C.at(p).at(e).first--;
}
};
now = 1,dfs2(dfs2,pos,back);
}
};
dfs(dfs,0,-1,true);
}
for(auto &a : answer) cout << a.v << "\n";
}