UVALive3902 Network[贪心 DFS&&BFS]

UVALive - 3902 Network

Consider a tree network with n nodes where the internal nodes correspond to servers and the terminal nodes correspond to clients. The nodes are numbered from 1 to n. Among the servers, there is an original server S which provides VOD (Video On Demand) service. To ensure the quality of service for the clients, the distance from each client to the VOD server S should not exceed a certain value k. The distance from a node u to a node v in the tree is defined to be the number of edges on the path from u to v. If there is a nonempty subset C of clients such that the distance from each u in C to S is greater than k , then replicas of the VOD system have to be placed in some servers so that the distance from each client to the nearest VOD server (the original VOD system or its replica) is k or less.

Given a tree network, a server S which has VOD system, and a positive integer k, find the minimum number of replicas necessary so that each client is within distance k from the nearest server which has the original VOD system or its replica.

For example, consider the following tree network.

In the above tree, the set of clients is {1, 6, 7, 8, 9, 10, 11, 13}, the set of servers is {2, 3, 4, 5, 12, 14}, and the original VOD server is located at node 12.

For k = 2, the quality of service is not guaranteed with one VOD server at node 12 because the clients in {6, 7, 8, 9, 10} are away from VOD server at distance > k. Therefore, we need one or more replicas. When one replica is placed at node 4, the distance from each client to the nearest server of {12, 4} is less than or equal to 2. The minimum number of the needed replicas is one for this example.

Input

Your program is to read the input from standard input. The input consists of T test cases. The number of test cases (T ) is given in the first line of the input. The first line of each test case contains an integer n (3 ≤ n ≤ 1,000) which is the number of nodes of the tree network. The next line contains two integers s (1 ≤ s ≤ n) and k (k ≥ 1) where s is the VOD server and k is the distance value for ensuring the quality of service. In the following n − 1 lines, each line contains a pair of nodes which represent an edge of the tree network.

Output

Your program is to write to standard output. Print exactly one line for each test case. The line should contain an integer that is the minimum number of the needed replicas. 

---

题意：n台机器连成一个树状网络，其中叶节点是客户端，其他节点是服务器。现在有一台服务器在节点s，服务器能传播的信号的距离为k，因为有的用户距离服务器的距离大于k，所以必须添加服务器。问最少要添加几个服务器，才能使每个客户端都收到信号

---

 

从最深点开始贪心，选择k级祖先

注意只有叶子才是client，所以lst里只加入d>k的叶子行了

//
//  main.cpp
//  la3902
//
//  Created by Candy on 27/10/2016.
//  Copyright © 2016 Candy. All rights reserved.
//

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
using namespace std;
const int N=1005;
inline int read(){
    char c=getchar();int x=0,f=1;
    while(c<'0'||c>'9'){if(c=='-')f=-1; c=getchar();}
    while(c>='0'&&c<='9'){x=x*10+c-'0'; c=getchar();}
    return x*f;
}
int T,n,s,k,u,v;
struct edge{
    int v,ne;
}e[N<<1];
int h[N],cnt=0;
void ins(int u,int v){
    cnt++;
    e[cnt].v=v;e[cnt].ne=h[u];h[u]=cnt;
    cnt++;
    e[cnt].v=u;e[cnt].ne=h[v];h[v]=cnt;
}
struct node{
    int u,d;
    node(int a=0,int b=0):u(a),d(b){}
    bool operator <(const node &r)const{return d>r.d;}
};
node lst[N];int p=0;
int d[N],fa[N],q[N],head,tail;
void bfs(int s){
    memset(d,-1,sizeof(d));
    p=0;
    head=1;tail=0;
    q[++tail]=s; d[s]=0; fa[s]=0;
    while(head<=tail){
        int u=q[head++],child=0;
        for(int i=h[u];i;i=e[i].ne){
            int v=e[i].v;
            if(d[v]==-1){child++;
                d[v]=d[u]+1;
                fa[v]=u;
                q[++tail]=v;
            }
        }
        if(child==0&&d[u]>k) lst[++p]=node(u,d[u]);
    }
}
int vis[N];
void dfs(int u,int fa,int d){//printf("dfs %d %d\n",u,d);
    vis[u]=1;
    for(int i=h[u];i;i=e[i].ne){
        int v=e[i].v;
        if(v!=fa&&d<k) dfs(v,u,d+1);
    }
}
int main(int argc, const char * argv[]) {
    T=read();
    while(T--){
        n=read();s=read();k=read();
        cnt=0;
        memset(h,0,sizeof(h));
        memset(vis,0,sizeof(vis));
        for(int i=1;i<=n-1;i++){u=read();v=read();ins(u,v);}
        bfs(s);
        sort(lst+1,lst+1+p);
        int ans=0;
        for(int i=1;i<=p;i++){//except s
            int u=lst[i].u;//printf("u %d\n",u);
            if(vis[u]) continue;
            for(int j=1;j<=k;j++) u=fa[u];
            dfs(u,0,0);
            ans++;
        }
        printf("%d\n",ans);
    }
    
    return 0;
}