Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
68 views2 pages

ACM International Collegiate Programming Contest ASIA Regional - Seoul Problem C

The document describes the problem of finding the minimum number of replicas needed for a video on demand (VOD) service in a tree network to ensure quality of service for clients. Given a tree with nodes representing servers and clients, an original VOD server, and a distance threshold k, replicas may need to be placed on servers so that all clients are within distance k of the closest VOD server. The input specifies the tree network and test cases, while the output should report the minimum number of replicas needed for each test case.

Uploaded by

Gelfordasdf
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
68 views2 pages

ACM International Collegiate Programming Contest ASIA Regional - Seoul Problem C

The document describes the problem of finding the minimum number of replicas needed for a video on demand (VOD) service in a tree network to ensure quality of service for clients. Given a tree with nodes representing servers and clients, an original VOD server, and a distance threshold k, replicas may need to be placed on servers so that all clients are within distance k of the closest VOD server. The input specifies the tree network and test cases, while the output should report the minimum number of replicas needed for each test case.

Uploaded by

Gelfordasdf
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

The 32nd Annual

ACM International Collegiate Programming Contest ASIA Regional - Seoul Problem C


Network
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.
6 1 2 3 13 S 12 11 14 10 9 8 7 4 5

Consider a tree network with n

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

The 32nd Annual ACM Programming Contest ASIA Regional - Seoul


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. The following shows sample input and output for two test cases.

Sample Input
2 14 12 2 1 2 2 3 3 4 4 5 5 6 7 5 8 5 4 9 10 3 2 12 12 14 13 14 14 11 14 3 4 1 2 2 3 3 4 4 5 5 6 7 5 8 5 4 9 10 3 2 12 12 14 13 14 14 11

Output for the Sample Input


1 0

You might also like