NAIPC2016 I. Tourists【LCA】

题意：求一棵树上$\sum i$号节点到它所有因子的路径和;
分析：预处理因子，LCA求树上两点距离(logn).

#include <cstdio>
#include <algorithm>
#include <cmath>
#include <queue>
#include <vector>
#include <cstring>
using namespace std;
typedef long long LL;

const int MAXN = 4e5 + 10;
int gw[MAXN][30]; 
int grand[MAXN][30];
int depth[MAXN];
int n, N;

struct node {
    int to;
    int cos;
}e;
vector<node> G[MAXN];
vector<int> V[MAXN];
inline void dfs(int x, int fa) { 
    for(int i = 1; i <= N; ++i) {
        grand[x][i] = grand[grand[x][i - 1]][i - 1];
        gw[x][i] = gw[x][i - 1] + gw[grand[x][i - 1]][i - 1];
    }
    for(int i = 0; i < G[x].size(); ++i) {
        e = G[x][i];
        if(e.to == fa) continue;
        depth[e.to] = depth[x] + 1;
        grand[e.to][0] = x;
        gw[e.to][0] = e.cos;
        dfs(e.to, x);
    }
}

inline void init() {
    for(int i = 2; i <= n; ++i) {
        for(int j = 1; j * j <= i; ++j) {
            if(i % j == 0) V[i].push_back(j);
            if(i % j == 0 && i / j != j) V[i].push_back(i / j);
        }
    }
    N = floor(log(double(n)) / log(2.0));
    dfs(1, -1);
}

inline int lca(int a, int b) {
    if(depth[a] > depth[b]) swap(a, b);
    int ans = 0;
    for(int i = N; i >= 0; --i) {
        if(depth[a] < depth[b] && depth[grand[b][i]] >= depth[a]) {
            ans += gw[b][i];
            b = grand[b][i];
        }
    }
    for(int i = N; i >= 0; --i) {
        if(grand[a][i] == grand[b][i]) continue;
        ans += gw[a][i];
        ans += gw[b][i];
        a = grand[a][i];
        b = grand[b][i];
    }
    if(a != b) ans += gw[a][0] + gw[b][0];
    return ans;
}


int main() {
    int x, y, w = 1;
    scanf("%d", &n);
    for(int i = 1; i < n; ++i) {
        scanf("%d %d", &x, &y);
        e.to = y, e.cos = w;
        G[x].push_back(e);
        e.to = x;
        G[y].push_back(e);
    }
    init(); LL sum = 0;
    for(int i = 1; i <= n; ++i) {
        for(int j = 0; j < V[i].size(); ++j) {
            int u = V[i][j];
            if(u == i) continue;
          //  printf("## %d %d\n", u, i);
            sum += lca(u, i) + 1;
        }
    }
    printf("%lld\n", sum);
    return 0;
}