hdu4607 Park Visit（树的直径）

Park Visit

Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1826    Accepted Submission(s): 798

Problem Description

Claire and her little friend, ykwd, are travelling in Shevchenko's Park! The park is beautiful - but large, indeed. N feature spots in the park are connected by exactly (N-1) undirected paths, and Claire is too tired to visit all of them. After consideration, she decides to visit only K spots among them. She takes out a map of the park, and luckily, finds that there're entrances at each feature spot! Claire wants to choose an entrance, and find a way of visit to minimize the distance she has to walk. For convenience, we can assume the length of all paths are 1.
Claire is too tired. Can you help her?

 

Input

An integer T(T≤20) will exist in the first line of input, indicating the number of test cases.
Each test case begins with two integers N and M(1≤N,M≤10⁵), which respectively denotes the number of nodes and queries.
The following (N-1) lines, each with a pair of integers (u,v), describe the tree edges.
The following M lines, each with an integer K(1≤K≤N), describe the queries.
The nodes are labeled from 1 to N.

 

Output

For each query, output the minimum walking distance, one per line.

 

Sample Input

1
4 2
3 2
1 2
4 2
2
4

 

Sample Output

1
4

 

Source

2013 Multi-University Training Contest 1

 

Recommend

liuyiding

 #include <iostream>
 #include <cstdio>
 #include <cstring>
 #include <algorithm>
 #include <cmath>
 using namespace std;
 const int N = ;
 int n,m;
 int head[N];
 struct node {
     int v,w,next;
 }edge[N<<];
 int cnt;
 void add(int u, int v, int w) {
     edge[cnt].v = v;
     edge[cnt].w = w;
     edge[cnt].next = head[u];
     head[u] = cnt++;
 }
 int vis[N];
 int dist[N];
 int que[N];
 int ret;
 int bfs(int u) {
     memset(vis, , sizeof(vis));
     int start = ;
     int rear = ;
     que[] = u;
     vis[u] = ;
     dist[u] = ;
     int i;
     int ans = ;
     while (start < rear) {
         start++;
         int tmp = que[start];
         for (i = head[tmp]; i != -; i = edge[i].next) {
             int v = edge[i].v;
             if (!vis[v]) {
                 rear++;
                 que[rear] = v;
                 vis[v] = ;
                 dist[v] = dist[tmp] + edge[i].w;
                 if (dist[v] > ans) {
                     ans = dist[v];
                     ret = v;
                 }
             }
         }
     }
     return ans;
 }
 int main() {
 //    freopen("in.txt","r",stdin);
     int i;
     int u,v;
     int T;
     scanf("%d",&T);
     while (T--) {
         scanf("%d %d",&n,&m);
         memset(head, -, sizeof(head));
         cnt = ;
         for (i = ; i < n; i++) {
             scanf("%d %d",&u,&v);
             add(u,v,);
             add(v,u,);
         }
         bfs();
         int ans = bfs(ret);
         for (i = ; i < m; i++) {
             int t;
             scanf("%d",&t);
             if (t <= ans + )
                 printf("%d\n", t - );
             else
                 printf("%d\n", ans + (t - ans - ) * );
         }
     }
     return ;
 }