Codeforces 463 E 乱搞

来源：互联网发布：大数据时代的重要性编辑：程序博客网时间：2024/05/21 14:44
/**Rainto96*Beijing University of Posts and Telecommunications School of Software Engineering*http://blog.csdn.net/u011775691给一颗树，每个点有点权有两种操作1.问从根1到某个点i经过的点中（v1,v2,v3,,,vk , vk=i）gcd(f[vp],f[i])>1的深度最深的点i是哪个2.把某个节点的权修改为某个值做的时候题读错了，写了两个复杂版本。。。各种对拍出数据才搞出来因为操作2只有最多50个，就是个乱搞题离线搞，每两个操作之间dfs离线搞，搞两百万个全局桶，记录从根到当前结点的路径中各个质因子有哪些节点查完后加上该点信息递归儿子然后该点dfs结束后把该点信息弹走*/#include <bits/stdc++.h>using namespace std;#define pb push_back#define ALL(x) x.begin(),x.end()#define VINT vector<int>#define PII pair<int,int>#define MP(x,y) make_pair((x),(y))#define ll long long#define ull unsigned ll#define MEM0(x)  memset(x,0,sizeof(x))#define MEM(x,val) memset((x),val,sizeof(x))#define scan(x) scanf("%d",&(x))#define scan2(x,y) scanf("%d%d",&(x),&(y))#define scan3(x,y,z) scanf("%d%d%d",&(x),&(y),&(z))#define scan4(x,y,z,k) scanf("%d%d%d%d",&(x),&(y),&(z),&(k))#define Max(a,b) a=max(a,b)#define Min(a,b) a=min(a,b)using namespace std;const int MAXN=111111;int dep[MAXN];//map<int , int >mp[2222222];vector<int > mp[2222222];int f[MAXN];VINT G[MAXN];vector<int > que[MAXN];int ans[MAXN];struct Prime{        static const long long SIZ=8888;        int prm[SIZ+10];        bool visP[SIZ+10];        int pn;        Prime(){getPrm();}        void getPrm(){                for(int i=2;i<=SIZ;i++){                        if(!visP[i]){                                prm[pn++]=i;                                for(int j=i;j<=SIZ;j+=i) visP[j]=true;                        }                }        }}P;void dfs(int now, int fa ,int depth){        dep[now] = depth;        int sta[26] , tail=0;        int val = f[now];        for(int i=0;P.prm[i]*P.prm[i]<=val && i<P.pn;i++){                if(val % P.prm[i] == 0){                        sta[tail++] = P.prm[i];                        while(val % P.prm[i] == 0) val /= P.prm[i];                }        }        if(val>1) sta[tail++] = val;        int maxdep = -1;        int res = -1;        for(int i=0;i<tail;i++){                int p = sta[i];                if(mp[p].empty()) continue;                auto it = mp[p].back();                if(dep[it] > maxdep) {                        maxdep = dep[it];                        res = it;                }        }        for(auto idx : que[now]){                if(res != -1)                        ans[idx] = res;                else                        ans[idx] = -1;        }        for(int i=0;i<tail;i++){                mp[sta[i]].pb(now);        }        for(auto to : G[now]){                if(to == fa) continue;                dfs(to , now ,depth+1);        }        for(int i=0;i<tail;i++){                mp[sta[i]].pop_back();        }}int main(){#ifndef ONLINE_JUDGEfreopen("C:/OJ/in.txt","r",stdin);freopen("C:/OJ/outmy.txt","w",stdout);#endif        int n,q;        scan2(n,q);        for(int i=1;i<=n;i++) scan(f[i]);        for(int i=1;i<=n-1;i++){                int u,v;scan2(u,v);                G[u].pb(v);                G[v].pb(u);        }        vector<int > seq;        for(int i=1;i<=q;i++){                int kd;scan(kd);                if(kd==1){                        int node;scan(node);                        que[node].pb(i);                        seq.pb(i);                }else{                        dfs(1,-1,0);                        for(int i=0;i<seq.size();i++){                                printf("%d\n",ans[seq[i]]);                        }                        for(int i=0;i<=n;i++) que[i].clear();                        seq.clear();                        int v , w;                        scan2(v,w);                        f[v] = w;                }        }        if(seq.size()!=0){                dfs(1,-1,0);                for(int i=0;i<seq.size();i++){                        printf("%d\n",ans[seq[i]]);                }        }        return 0;}
0 0