寒假翻译题训练 1月28号

链接：https://acs.jxnu.edu.cn/problem/HDU1011

题目：

描述：

You, the leader of Starship Troopers, are sent to destroy a base of the bugs. The base is built underground. It is actually a huge cavern, which consists of many rooms connected with tunnels. Each room is occupied by some bugs, and their brains hide in some of the rooms. Scientists have just developed a new weapon and want to experiment it on some brains. Your task is to destroy the whole base, and capture as many brains as possible.

To kill all the bugs is always easier than to capture their brains. A map is drawn for you, with all the rooms marked by the amount of bugs inside, and the possibility of containing a brain. The cavern's structure is like a tree in such a way that there is one unique path leading to each room from the entrance. To finish the battle as soon as possible, you do not want to wait for the troopers to clear a room before advancing to the next one, instead you have to leave some troopers at each room passed to fight all the bugs inside. The troopers never re-enter a room where they have visited before.

A starship trooper can fight against 20 bugs. Since you do not have enough troopers, you can only take some of the rooms and let the nerve gas do the rest of the job. At the mean time, you should maximize the possibility of capturing a brain. To simplify the problem, just maximize the sum of all the possibilities of containing brains for the taken rooms. Making such a plan is a difficult job. You need the help of a computer.

输入：

The input contains several test cases. The first line of each test case contains two integers N (0 < N <= 100) and M (0 <= M <= 100), which are the number of rooms in the cavern and the number of starship troopers you have, respectively. The following N lines give the description of the rooms. Each line contains two non-negative integers -- the amount of bugs inside and the possibility of containing a brain, respectively. The next N - 1 lines give the description of tunnels. Each tunnel is described by two integers, which are the indices of the two rooms it connects. Rooms are numbered from 1 and room 1 is the entrance to the cavern.

The last test case is followed by two -1's.

输出：

For each test case, print on a single line the maximum sum of all the possibilities of containing brains for the taken rooms.

翻译如下

描述：

你是歼星舰的舰长，被安排去消灭基地里的bug。基地位于地下一个巨大的山洞里，这里有很多房间，房间通过一个通道连接着彼此。每一个房间都被一些bug占领了，而他们的大脑藏在一些房间里。科学家们发明了一种新型武器，并且想要用这些大脑做实验。你的任务是摧毁整个基地，并且捕获尽可能多的大脑用于实验。消灭bug总是比捕获大脑要简单。现在给你一张基地的地图，地图上显示了每个房间里的bug数，以及可能包含的大脑数量。基地的形状类似一颗树，所以每个房间只有一个独立的入口。为了让这场战斗尽可能快的结束，你不能等到士兵成功消灭完房间里所有的bug后再前往下一个房间，相反，你只能在一个房间里留下一定量的士兵让他们参与战斗。士兵们不会回到之前他们去过的房间。一个歼星舰的士兵可以与20个bug战斗。然而你并没有足够多的士兵，你只能挑选一些房间让士兵们处于战斗，其他房间我们将会使用毒气弹对里面的bug进行无差别屠杀。同时你要捕获尽可能多的大脑。为了简化这个问题，你只用求出你能捕获的最多的大脑。制定一个这样的计划是很困难的，所以你需要电脑的帮助。
 

输入：

输入包含多组样例。对于每组样例，第一行包含2个整数N，M (0 < N <= 100，0 <= M <= 100)，N表示房间数，M表示你的士兵数。接下来N行表示房间的具体情况。每一行包含两个非负整数，前者表示房间的bug数，后者表示房间可能含有的大脑数。接下来N-1表示通道的具体情况。每一个通道有两个整数来表示它的具体情况，这两个整数表示该通道连接的两个房间的序号。房间号从一号开始，并且一号房间是基地的起点。最后的样例为两个-1。

输出：

对于每组样例，输出可能能取得的最多的大脑数。