2017年10月5提高组T1 直径

Description

---

Input

---

Output

---

Hint

---

Solution

---

类似的，这样的题目我们可以考虑倒过来离线做，这样就变成了不断加边的步骤，用并查集维护一下合并的小树，同时记录子树内的直径

一个结论：两棵树合并后直径的两个端点，一定是两棵树各自直径共四个端点中的两个
这样我们用带权的并查集+倍增搞一搞就可以了

最近打这种几k的题目都不太顺手啊

Code

---

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <iostream>
#include <algorithm>
#define rep(i, st, ed) for (int i = st; i <= ed; i += 1)
#define drp(i, st, ed) for (int i = st; i >= ed; i -= 1)
#define erg(i, st) for (int i = ls[st]; i; i = e[i].next)
#define fill(x, t) memset(x, t, sizeof(x))
#define max(x, y) ((x)>(y)?(x):(y))
#define min(x, y) ((x)<(y)?(x):(y))
#define abs(x) ((x)<(0)?(-(x)):(x))
#define ll long long
#define MOD 1000000007
#define N 100001
#define E N * 2 + 1
#define L 1001
struct edge {int x, y, next;} e[E];
int dep[N], f[N][17], r1[N], r2[N], fa[N], ls[N], t[N], q[N];
ll len[N], prt[N], dis[N];
inline int read() {
    int x = 0; char ch = getchar();
    for(; ch<'0'||ch>'9'; ch=getchar());
    for(; ch<='9'&&ch>='0'; (x*=10)+=ch-'0',ch=getchar());
    return x;
}
inline int getFather(int now) {
    if (fa[now] == 0) {
        return now;
    }
    fa[now] = getFather(fa[now]);
    return fa[now];
}
inline void dfs(int now) {
    rep(i, 1, 16) {
        f[now][i] = f[f[now][i - 1]][i - 1];
    }
    erg(i, now) {
        if (e[i].y == f[now][0]) {
            continue;
        }
        f[e[i].y][0] = now;
        dep[e[i].y] = dep[now] + 1;
        dis[e[i].y] = dis[now] + t[e[i].y];
        dfs(e[i].y);
    }
}
inline int lca(int x, int y) {
    if (x == y) {
        return x;
    }
    if (dep[x] < dep[y]) {
        x ^= y;
        y ^= x;
        x ^= y;
    }
    drp(i, 16, 0) {
        if (dep[f[x][i]] >= dep[y]) {
            x = f[x][i];
        }
    }
    if (x == y) {
        return x;
    }
    drp(i, 16, 0) {
        if (f[x][i] != f[y][i]) {
            x = f[x][i];
            y = f[y][i];
        }
    }
    return f[x][0];
}
inline ll getDis(int x, int y) {
    int LCA = lca(x, y);
    return dis[x] + dis[y] - dis[LCA]*2 + t[LCA];
}
inline void merge(int x, int y) {
    x = getFather(x);
    y = getFather(y);
    fa[x] = y;
    int tx = r1[x];
    int ty = r2[x];
    int LEN = getDis(tx, ty);
    int w = getDis(tx, ty);
    if ((w = getDis(r1[x], r1[y])) > LEN) {
        tx = r1[x];
        ty = r1[y];
        LEN = w;
    }
    if ((w = getDis(r1[x], r2[y])) > LEN) {
        tx = r1[x];
        ty = r2[y];
        LEN = w;
    }
    if ((w = getDis(r2[x], r1[y])) > LEN) {
        tx = r2[x];
        ty = r1[y];
        LEN = w;
    }
    if ((w = getDis(r2[x], r2[y])) > LEN) {
        tx = r2[x];
        ty = r2[y];
        LEN = w;
    }
    if ((w = getDis(r1[y], r2[y])) > LEN) {
        tx = r1[y];
        ty = r2[y];
        LEN = w;
    }
    r1[y] = tx;
    r2[y] = ty;
    len[y] = LEN;
}
inline ll ksm(ll x, int y) {
    if (y == 1) {
        return x;
    }
    ll tmp = ksm(x, y / 2) % MOD;
    tmp = (tmp * tmp) % MOD;
    if (y % 2 == 1) {
        tmp = (tmp * x) % MOD;
    }
    return tmp;
}
int main(void) {
    freopen("len.in","r",stdin);
    freopen("len.out","w",stdout);
    int n = read();
    ll ans = 1;
    rep(i, 1, n) {
        t[i] = read();
        (ans *= t[i]) %= MOD;
        r1[i] = r2[i] = i;
        len[i] = t[i];
    }
    rep(i, 1, n - 1) {
        int x = read();
        int y = read();
        e[i * 2 - 1] = (edge) {x, y, ls[x]};
        ls[x] = i * 2 - 1;
        e[i * 2] = (edge) {y, x, ls[y]};
        ls[y] = i * 2;
    }
    dep[1] = 1;
    dis[1] = t[1];
    dfs(1);
    rep(i, 1, n - 1) {
        q[i] = read();
        q[i] = q[i] * 2 - 1;
    }
    prt[n] = ans;
    drp(i, n - 1, 1) {
        (ans *= ksm(len[getFather(e[q[i]].x)], MOD - 2)) %= MOD;
        (ans *= ksm(len[getFather(e[q[i]].y)], MOD - 2)) %= MOD;
        merge(e[q[i]].x, e[q[i]].y);
        (ans *= len[getFather(e[q[i]].x)]) %= MOD;
        prt[i] = ans;
    }
    rep(i, 1, n) {
        std:: cout << prt[i] << std:: endl;
    }
    return 0;
}