POJ - 2114 Boatherds 树分治

题目链接：https://cn.vjudge.net/problem/POJ-2114

题意：存不存在距离为k的，k是多组输入

题解：这个题，如果用vector保存，然后二分查找的话，跑了1s多一点，但是用map记录的话，直接就T了，在看了下数据，开个1e7的数组记录，63ms，当然也是离线做的，直接把时间跑到vj第四哈哈。

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
using namespace std;
typedef long long ll;
const int N = 1e4 + 10;
struct EDGE {
    int to, d, nex;
}e[N * 2];
int n, k, pnum;
int head[N], len;
int vis[N];
int son[N], max_son[N];
void Init() {
    for(int i = 0 ; i <= n; i++) {
        head[i] = -1;
        vis[i] = 0;
    }
    len = 0;
}
void AddEdge(int x, int y, int z) {
    e[len].to = y;
    e[len].d = z;
    e[len].nex = head[x];
    head[x] = len++;
}
void getroot(int u, int fa, int &root, int &minn) {
    son[u] = 1;
    max_son[u] = 0;
    int to;
    for(int i = head[u]; i != -1; i = e[i].nex) {
        to = e[i].to;
        if(to == fa || vis[to]) continue;
        getroot(to, u, root, minn);
        son[u] += son[to];
        max_son[u] = max(max_son[u], son[to]);
    }
    max_son[u] = max(max_son[u], pnum - son[u]);
    if(max_son[u] < minn) {
        minn = max_son[u];
        root = u;
    }
}
int mp[10000010];
int pval[N], cnt;
int q[N], ans[N], m;
void getdis(int u, int fa, int d) {
    pval[++cnt] = d;
    int to;
    for(int i = head[u]; i != -1; i = e[i].nex) {
        to = e[i].to;
        if(to == fa || vis[to]) continue;
        getdis(to, u, d + e[i].d);
    }
}
int dfs(int u) {
    int minn = N, root;
    getroot(u, -1, root, minn);
    vis[root] = 1;
    int res = 0;
    int to;
    mp[0] = 1;
    for(int i = head[root]; i != -1; i = e[i].nex) {
    	to = e[i].to;
    	if(vis[to]) continue;
    	cnt = 0;
    	getdis(to, root, e[i].d);
    	for(int j = 1; j <= cnt; j++) {
    		for(int k = 1; k <= m; k++)
    			if(pval[j] <= q[k] && mp[q[k] - pval[j]])
					ans[k] = 1; 
		}
		
    	for(int j = 1; j <= cnt; j++) mp[pval[j]]++;
	}
	for(int i = head[root]; i != -1; i = e[i].nex) {
    	to = e[i].to;
    	if(vis[to]) continue;
    	cnt = 0;
    	getdis(to, root, e[i].d);
    	for(int j = 1; j <= cnt; j++) mp[pval[j]] = 0;
	}
    for(int i = head[root]; i != -1; i = e[i].nex) {
        to = e[i].to;
        if(vis[to]) continue;
        pnum = son[to];
        res += dfs(to);
    }
//    cout << root << " " << res << endl;
    return res;
}
int main() {
    int x, y, z = 1;
    int res;
    while(~scanf("%d", &n) && n) {
        Init();
        for(int i = 1; i <= n; i++) {
            while(scanf("%d", &x) && x) {
                scanf("%d", &z);
                AddEdge(x, i, z);
                AddEdge(i, x, z);
            }
			
        }
        m = 0;
        while(scanf("%d", &k) && k) {
            m++;
            q[m] = k;
            ans[m] = 0;
        }
        pnum = n;
        res = dfs(1);
        for(int i = 1; i <= m; i++)
        printf(ans[i] ? "AYE\n" : "NAY\n");
        printf(".\n");
    }
    return 0;
}

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long ll;
const int N = 1e4 + 10;
struct EDGE {
    int to, d, nex;
}e[N * 2];
int n, k, pnum;
int head[N], len;
int vis[N];
int son[N], max_son[N];
void Init() {
    for(int i = 0 ; i <= n; i++) {
        head[i] = -1;
        vis[i] = 0;
    }
    len = 0;
}
void AddEdge(int x, int y, int z) {
    e[len].to = y;
    e[len].d = z;
    e[len].nex = head[x];
    head[x] = len++;
}
void getroot(int u, int fa, int &root, int &minn) {
    son[u] = 1;
    max_son[u] = 0;
    int to;
    for(int i = head[u]; i != -1; i = e[i].nex) {
        to = e[i].to;
        if(to == fa || vis[to]) continue;
        getroot(to, u, root, minn);
        son[u] += son[to];
        max_son[u] = max(max_son[u], son[to]);
    }
    max_son[u] = max(max_son[u], pnum - son[u]);
    if(max_son[u] < minn) {
        minn = max_son[u];
        root = u;
    }
}
vector<int> dis;
void getdis(int u, int fa, int d) {
    dis.push_back(d);
    int to;
    for(int i = head[u]; i != -1; i = e[i].nex) {
        to = e[i].to;
        if(to == fa || vis[to]) continue;
        getdis(to, u, d + e[i].d);
    }
}
int getnum(int u, int d) {
    int res = 0;
    dis.clear();
    getdis(u, -1, d);
    sort(dis.begin(), dis.end());
    int l = dis.size();
    for(int i = 0; i < l; i++) {
        if(dis[i] > k) break;
        res += upper_bound(dis.begin(), dis.end(), k - dis[i]) - lower_bound(dis.begin(), dis.end(), k - dis[i]);
    }
 //   cout << u << " " << res << endl;
    return res;
}
int dfs(int u) {
    int minn = N, root;
    getroot(u, -1, root, minn);
    vis[root] = 1;
    int res = 0;
    res += getnum(root, 0);
    int to;
    for(int i = head[root]; i != -1; i = e[i].nex) {
        to = e[i].to;
        if(vis[to]) continue;
        pnum = son[to];
        res -= getnum(to, e[i].d);
        res += dfs(to);
    }
    return res;
}
int main() {
    int x, y, z = 1;
    int res;
    while(~scanf("%d", &n) && n) {
        Init();
        for(int i = 1; i <= n; i++) {
            while(scanf("%d", &x) && x) {
                scanf("%d", &z);
                AddEdge(x, i, z);
                AddEdge(i, x, z);
            }

        }
        while(scanf("%d", &k) && k) {
            for(int i = 1; i <= n; i++) vis[i] = 0;
            pnum = n;
            res = dfs(1);
           // cout << res << endl;
            printf(res ? "AYE\n" : "NAY\n");

        }
        printf(".\n");
    }
    return 0;
}