Caisa and Tree

在dfs的過程中枚舉質(zhì)因子瞎搞搞就好啦， 不過這個題意真的表述不清。。

#include<bits/stdc++.h> #define LL long long #define fi first #define se second #define mk make_pair #define PLL pair<LL, LL> #define PLI pair<LL, int> #define PII pair<int, int> #define SZ(x) ((int)x.size()) #define ull unsigned long long using namespace std;const int N = 1e5 + 7; const int M = 2e6 + 7; const int inf = 0x3f3f3f3f; const LL INF = 0x3f3f3f3f3f3f3f3f; const int mod = 1e6 + 3; const double eps = 1e-8;int n, q, a[N], ans[N], depth[N]; bool prime[M]; vector<int> pfac[M]; vector<PII> Set[M]; vector<int> G[N];void dfs(int u, int fa) {depth[u] = depth[fa] + 1;ans[u] = -1;for(auto& t : pfac[a[u]])if(SZ(Set[t]) && (ans[u] == -1 || Set[t][SZ(Set[t])-1].fi > depth[ans[u]]))ans[u] = Set[t][SZ(Set[t])-1].se;for(auto& t : pfac[a[u]])Set[t].push_back(mk(depth[u], u));for(auto& v : G[u]) {if(v == fa) continue;dfs(v, u);}for(auto& t : pfac[a[u]])Set[t].pop_back(); }int main() {memset(prime, true, sizeof(prime));prime[0] = prime[1] = false;for(int i = 2; i < M; i++) {if(!prime[i]) continue;pfac[i].push_back(i);for(int j = i + i; j < M; j += i)prime[j] = false, pfac[j].push_back(i);}scanf("%d%d", &n, &q);for(int i = 1; i <= n; i++) scanf("%d", &a[i]);for(int i = 1; i < n; i++) {int u, v; scanf("%d%d", &u, &v);G[u].push_back(v);G[v].push_back(u);}dfs(1, 0);while(q--) {int op, v, w;scanf("%d%d", &op, &v);if(op == 1) {printf("%d\n", ans[v]);} else {scanf("%d", &w);a[v] = w;dfs(1, 0);}}return 0; }/* */

?

轉(zhuǎn)載于:https://www.cnblogs.com/CJLHY/p/10403544.html

總結(jié)

以上是生活随笔為你收集整理的Codeforces 463E Caisa and Tree的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。