JZOJ.5286【NOIP2017模拟8.16】花花的森林

  1 #include<iostream>
  2 #include<cstdio>
  3 #include<cstring>
  4 #include<cstdlib>
  5 #include<algorithm>
  6 #include<cmath>
  7 #include<ctime>
  8 #define N 200005
  9 #define mo 1000000007
 10 using namespace std;
 11 int head[N],next[N*2],to[N*2],va[N],up[N][30],deep[N],x[N],y[N],n,f[N],num,qwq[N],sx[N],sy[N],fa[N],ma;
 12 long long ans,dis[N],an[N];
 13 long long kuai(long long a,int b){
 14     long long d=1;
 15     long long qwq=a;
 16     while (b){
 17         if (b&1) d=d*qwq%mo;
 18         qwq=qwq*qwq%mo;
 19         b>>=1;
 20     }
 21     return d;
 22 }
 23 void add(int u,int v){
 24     num++;
 25     next[num]=head[u];
 26     to[num]=v;
 27     head[u]=num;
 28     num++;
 29     next[num]=head[v];
 30     to[num]=u;
 31     head[v]=num;
 32 }
 33 void updata(int u){
 34     dis[u]=dis[fa[u]]+va[u];
 35     up[u][0]=fa[u];
 36     for (int i=1;i<=25;i++)
 37      up[u][i]=up[up[u][i-1]][i-1];
 38     for (int i=head[u];i;i=next[i]){
 39         int v=to[i];
 40         if (v!=fa[u])
 41          deep[v]=deep[u]+1,fa[v]=u,updata(v);
 42     }
 43 }
 44 int lca(int u,int v){
 45     if (deep[u]<deep[v]) swap(u,v);
 46     for (int i=20;i>=0;i--)
 47      if (deep[v]<=deep[up[u][i]])
 48       u=up[u][i];
 49     if (u==v) return u;
 50     for (int i=20;i>=0;i--)
 51      if (up[u][i]!=up[v][i])
 52       u=up[u][i],v=up[v][i];
 53     return up[u][0];
 54 }
 55 int find(int x){
 56     if (f[x]==x) return x;
 57     f[x]=find(f[x]);
 58     return f[x];
 59 }
 60 void work(int a,int b){
 61     if (deep[a]>deep[b]) swap(a,b);
 62     int f1=find(a),f2=find(b);
 63     f[f2]=f1;
 64     long long qaq=dis[sx[f1]],qvq=dis[sy[f1]],qoq=dis[sx[f2]],qsq=dis[sy[f2]];
 65     int t1=sx[f1],t2=sy[f1],t3=sx[f2],t4=sy[f2];
 66     int l1=lca(sx[f1],sx[f2]),l2=lca(sx[f1],sy[f2]),l3=lca(sy[f1],sx[f2]),l4=lca(sy[f1],sy[f2]),l5=lca(sx[f2],sy[f2]),l6=lca(sx[f1],sy[f1]);
 67     long long tmp3=qaq+qvq-2*dis[l6]+va[l6],tmp2=qsq+qoq-2*dis[l5]+va[l5];
 68     long long tmp1=tmp3;
 69     if (qaq+qoq-2*dis[l1]+va[l1]>tmp1) tmp1=qaq+qoq-2*dis[l1]+va[l1],sx[f1]=t1,sy[f1]=t3;
 70     if (qaq+qsq-2*dis[l2]+va[l2]>tmp1) tmp1=qaq+qsq-2*dis[l2]+va[l2],sx[f1]=t1,sy[f1]=t4;
 71     if (qvq+qoq-2*dis[l3]+va[l3]>tmp1) tmp1=qvq+qoq-2*dis[l3]+va[l3],sx[f1]=t2,sy[f1]=t3;
 72     if (qvq+qsq-2*dis[l4]+va[l4]>tmp1) tmp1=qvq+qsq-2*dis[l4]+va[l4],sx[f1]=t2,sy[f1]=t4;
 73     if (qsq+qoq-2*dis[l5]+va[l5]>tmp1) tmp1=qsq+qoq-2*dis[l5]+va[l5],sx[f1]=t3,sy[f1]=t4;
 74     ans=ans*((tmp1%mo)%mo*(kuai(tmp2,mo-2)%mo)%mo*(kuai(tmp3,mo-2)%mo)%mo)%mo;
 75     an[ma]=ans;
 76     ma--;
 77 }
 78 int main(){
 79     scanf("%d",&n);
 80     for (int i=1;i<=n;i++){
 81      scanf("%d",&va[i]);
 82      f[i]=i;
 83      sx[i]=i;
 84      sy[i]=i;
 85     }
 86     for (int i=1,u,v;i<n;i++){
 87         scanf("%d%d",&u,&v);
 88         x[i]=u;
 89         y[i]=v;
 90         add(u,v);
 91     }
 92     deep[1]=0;
 93     dis[0]=0;
 94     fa[1]=1;
 95     deep[1]=0;
 96     updata(1);
 97     for (int i=1;i<n;i++)
 98      scanf("%d",&qwq[i]);
 99     num=0;
100     ans=1;
101     for (int i=1;i<=n;i++)
102      ans=(ans*(va[i]%mo))%mo;
103     ma=n;
104     an[ma]=ans;
105     ma--;
106     for (int i=n-1;i>=1;i--){
107         work(x[qwq[i]],y[qwq[i]]);
108     }
109     for (int i=1;i<=n;i++)
110      printf("%lld\n",an[i]);
111     return 0;
112 }