2017CCPC女生赛 hdu 6031 Innumerable Ancestors

题目链接

分析：
二分答案，然后枚举A集合的元素，把那个深度的节点放到集合里，再枚举B集合的点看能否有集合里的节点是B的祖先。

自己真是好菜＝ ＝不光这个倍增，还有ST，我一直把for (int k = 1; (1 << k) <= n; k ++) 写成 for (int k = 1; k <= n; k <<= 1) ＝ ＝而且总检查不出这个错－ －写个博客提醒一下。

代码：

#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
#include <set>

using namespace std;

const int maxn = 1e5 + 5;

vector<int> G[maxn];
int a[maxn], b[maxn];
int far[maxn][20];
int dep[maxn];
int n, m, maxh;
int A, B;

void dfs(int u, int fa, int d) {
    dep[u] = d;
    far[u][0] = fa;
    for (unsigned i = 0; i < G[u].size(); i ++) {
        int v = G[u][i];
        if (v == fa) continue;
        dfs(v, u, d + 1);
    }
}

void init() {
    for (int k = 1; (1 << k) <= n; k ++)
        for (int i = 1; i <= n; i ++)
            if (far[i][k - 1] != -1)
                far[i][k] = far[far[i][k - 1]][k - 1];
}

int getfar(int u, int d) {
    if (d < 0) return -1;

    for (int i = 0; (1 << i) <= n; i ++) {
        if (u == -1) break;
        if ((d >> i) & 1) u = far[u][i];
    }
    return u;
}

bool check(int mid) {
    set<int> st;
    for (int i = 1; i <= A; i ++) {
        int k = dep[a[i]] - mid;
        int u = getfar(a[i], k);
        if (u == -1) continue;
        st.insert(u);
    }

    for (int i = 1; i <= B; i ++) {
        int k = dep[b[i]] - mid;
        int u = getfar(b[i], k);
        if (u == -1) continue;
        if (st.find(u) != st.end()) return true;
    }
    return false;
}

int main(int argc, char const *argv[]) {
    while (cin >> n >> m) {

        for (int i = 0; i <= n; i ++)
            G[i].clear();
        memset(far, -1, sizeof(far));

        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, 1, 1);
        init();

        while (m --) {
            maxh = 1;
            scanf("%d", &A);
            for (int i = 1; i <= A; i ++) {
                scanf("%d", a + i);
                maxh = max(maxh, dep[a[i]]);
            }
            scanf("%d", &B);
            for (int i = 1; i <= B; i ++)
                scanf("%d", b + i);

            int lb = 1, ub = maxh, res = -1;
            while (lb <= ub) {
                int mid = (lb + ub) >> 1;
                if (check(mid)) {
                    res = mid;
                    lb = mid + 1;
                }
                else
                    ub = mid - 1;
            }

            printf("%d\n", res);
        }
    }
    return 0;
}