链接
题解
d f s dfs dfs的过程中对每种质数记录包含这个质数的最靠后的点
只有50次修改,那我就每次都暴力重新 d f s dfs dfs整棵树
代码
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define iinf 0x3f3f3f3f
#define linf (1ll<<60)
#define eps 1e-8
#define maxn 2000010
#define maxe 2000010
#define cl(x) memset(x,0,sizeof(x))
#define rep(_,__) for(_=1;_<=(__);_++)
#define em(x) emplace(x)
#define emb(x) emplace_back(x)
#define emf(x) emplace_front(x)
#define fi first
#define se second
#define de(x) cerr<<#x<<" = "<<x<<endl
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll read(ll x=0)
{
ll c, f(1);
for(c=getchar();!isdigit(c);c=getchar())if(c=='-')f=-f;
for(;isdigit(c);c=getchar())x=x*10+c-0x30;
return f*x;
}
vector<ll> f[maxn];
ll ans[maxn], depth[maxn], a[maxn];
vector<ll> lis[maxn];
vector<ll> to[maxn];
void dfs(ll u, ll fa)
{
depth[u]=depth[fa]+1;
for(auto d:f[a[u]])
{
if(!lis[d].empty() and (ans[u]==-1 or depth[lis[d].back()]>depth[ans[u]]))
ans[u]=lis[d].back();
lis[d].emb(u);
}
for(auto v:to[u])
if(v!=fa)dfs(v,u);
for(auto d:f[a[u]])lis[d].pop_back();
}
int main()
{
ll n, u, v, i, j, q;
n=read(), q=read();
rep(i,n)a[i]=read();
for(i=2;i<maxn;i++)
{
if(f[i].size())continue;
for(j=i;j<maxn;j+=i)f[j].emb(i);
}
rep(i,n-1)
{
u=read(), v=read();
to[u].emb(v), to[v].emb(u);
}
rep(i,n)ans[i]=-1;
dfs(1,0);
while(q--)
{
ll type=read(), x=read(), y;
if(type==1)
{
printf("%lld\n",ans[x]);
}
else
{
y=read();
a[x]=y;
rep(i,n)ans[i]=-1;
dfs(1,0);
}
}
return 0;
}