【思路要点】
- 考虑将 p k p^k pk 的贡献拆分为 p , p 2 , p 3 , . . . , p k p,p^2,p^3,...,p^k p,p2,p3,...,pk 分别的贡献,每一个数若在范围内出现,对答案产生 × p \times p ×p 的贡献,重复出现统计一次。
- 考虑询问 x , y x,y x,y ,它实际上考虑了 x x x 子树内所有深度不超过 d e p t h x + y depth_x+y depthx+y 的点,因此,若将询问按照 d e p t h x + y depth_x+y depthx+y 排序,离线操作,按照深度依次加入点,即可看做子树询问。
- d f s dfs dfs 序相邻的两个点 x , y x,y x,y 重复计算的贡献可在 l c a ( x , y ) lca(x,y) lca(x,y) 处减去,可用一棵平衡树或 s t d : : s e t std::set std::set 维护 d f s dfs dfs 序列,如此,子树询问就可以直接用树状数组维护了。
- 时间复杂度 O ( N L o g N L o g V ) O(NLogNLogV) O(NLogNLogV) 。
- 将上述树状数组改为可持久化线段树可以做到强制在线。
【代码】
#include<bits/stdc++.h> using namespace std; const int MAXN = 2e5 + 5; const int MAXM = 1e7 + 5; const int MAXP = 2e7 + 5; const int MAXLOG = 20; const int P = 998244353; typedef long long ll; typedef long double ld; typedef unsigned long long ull; template <typename T> void chkmax(T &x, T y) {x = max(x, y); } template <typename T> void chkmin(T &x, T y) {x = min(x, y); } template <typename T> void read(T &x) { x = 0; int f = 1; char c = getchar(); for (; !isdigit(c); c = getchar()) if (c == '-') f = -f; for (; isdigit(c); c = getchar()) x = x * 10 + c - '0'; x *= f; } template <typename T> void write(T x) { if (x < 0) x = -x, putchar('-'); if (x > 9) write(x / 10); putchar(x % 10 + '0'); } template <typename T> void writeln(T x) { write(x); puts(""); } int power(int x, int y) { if (y == 0) return 1; int tmp = power(x, y / 2); if (y % 2 == 0) return 1ll * tmp * tmp % P; else return 1ll * tmp * tmp % P * x % P; } struct BinaryIndexTree { int n, a[MAXN]; void init(int x) { n = x; for (int i = 1; i <= n; i++) a[i] = 1; } void modify(int x, int d) { for (int i = x; i <= n; i += i & -i) a[i] = 1ll * a[i] * d % P; } int query(int x) { int ans = 1; for (int i = x; i >= 1; i -= i & -i) ans = 1ll * ans * a[i] % P; return ans; } int query(int l, int r) { return 1ll * query(r) * power(query(l - 1), P - 2) % P; } } BIT; int type, n, m, val[MAXN], ans[MAXN]; int tot, prime[MAXM], f[MAXM], inv[MAXM]; int timer, dfn[MAXN], rit[MAXN], depth[MAXN], father[MAXN][MAXLOG]; vector <pair <int, int>> q[MAXN]; vector <int> a[MAXN], p[MAXN]; struct info {int x; }; bool operator < (info a, info b) {return dfn[a.x] < dfn[b.x]; } set <info> st[MAXM]; int lca(int x, int y) { if (depth[x] < depth[y]) swap(x, y); for (int i = MAXLOG - 1; i >= 0; i--) if (depth[father[x][i]] >= depth[y]) x = father[x][i]; if (x == y) return x; for (int i = MAXLOG - 1; i >= 0; i--) if (father[x][i] != father[y][i]) { x = father[x][i]; y = father[y][i]; } return father[x][0]; } void dfs(int pos, int fa) { dfn[pos] = ++timer; father[pos][0] = fa; depth[pos] = depth[fa] + 1; p[depth[pos]].push_back(pos); for (int i = 1; i < MAXLOG; i++) father[pos][i] = father[father[pos][i - 1]][i - 1]; for (auto x : a[pos]) if (x != fa) dfs(x, pos); rit[pos] = timer; } void sieve(int n) { inv[1] = 1; for (int i = 2; i <= n; i++) { inv[i] = (P - 1ll * (P / i) * inv[P % i] % P) % P; if (f[i] == 0) prime[++tot] = f[i] = i; for (int j = 1; j <= tot && prime[j] <= f[i]; j++) { int tmp = prime[j] * i; if (tmp > n) break; f[tmp] = prime[j]; } } } void ins(int val, int pos) { auto tmp = st[val].insert((info) {pos}).first; BIT.modify(dfn[pos], f[val]); auto pre = tmp, suf = tmp; if (pre != st[val].begin()) { pre--; int tpos = lca((*tmp).x, (*pre).x); BIT.modify(dfn[tpos], inv[f[val]]); if (++suf != st[val].end()) { tpos = lca((*tmp).x, (*suf).x); BIT.modify(dfn[tpos], inv[f[val]]); tpos = lca((*pre).x, (*suf).x); BIT.modify(dfn[tpos], f[val]); } } else if (++suf != st[val].end()) { int tpos = lca((*tmp).x, (*suf).x); BIT.modify(dfn[tpos], inv[f[val]]); } } int main() { freopen("half.in", "r", stdin); freopen("half.out", "w", stdout); read(type), read(n); for (int i = 1; i <= n; i++) read(val[i]); for (int i = 1; i <= n - 1; i++) { int x, y; read(x), read(y); a[x].push_back(y); a[y].push_back(x); } sieve(1e7); dfs(1, 0); read(m); for (int i = 1; i <= m; i++) { int x, y; read(x), read(y); q[min(depth[x] + y, n)].emplace_back(x, i); } BIT.init(n); for (int i = 1; i <= n; i++) { for (auto x : p[i]) { int tmp = val[x]; while (tmp != 1) { int p = f[tmp], q = 1; while (tmp % p == 0) { q *= p, tmp /= p; ins(q, x); } } } for (auto x : q[i]) ans[x.second] = BIT.query(dfn[x.first], rit[x.first]); } for (int i = 1; i <= m; i++) writeln(ans[i]); return 0; }