Starship Troopers
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.
Input
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.
Output
For each test case, print on a single line the maximum sum of all the possibilities of containing brains for the taken rooms.
Sample Input
5 10
50 10
40 10
40 20
65 30
70 30
1 2
1 3
2 4
2 5
1 1
20 7
-1 -1
Sample Output
50
7
Author
XU, Chuan
Source
ZJCPC2004
Recommend
JGShining
답:
#include
int n,m;int path[101][101];//경로 int len[101], ls[101];//방이 연결된 다른 방 개수 int룸[101][2];//방 --0은 벌레 수를 나타낸다.1 대표 가능성 int ass[101][101];//i방에 j병사를 배치할 가능성
bool vist[101];//i번째 방이 inttmp[101]에 접근 처리되었는지 여부;//i번째 병사를 배치하면 얻을 수 있는 가능성
void DP(int now) {int i, j, k, t;if(ls[now]=1) {vist[now]=true;t=room[now][0]/20;if(room[now][0]% 20)t++;for(j=m-t;j>=0;j--) ass[now][j+t]=ass[now][j]+room[now][1];for(t-;t>=0;t--)ass[now][t]=0;//다시 0 for(i=0;i<) len[now];i++) {intnext = path[now][i];if(vist[next]) continue; ls[next] --; ass[now][0] = ass[next][0] = 0; for (j=0;j<=m;j++) tmp[j] = max(ass[now][j],ass[next][j]); for (j=0;j<=m;j++) { for (k=0;k<=m;k++) { if (j+k > m) break; tmp[j+k] = max(tmp[j+k],ass[now][j]+ass[next][k]); } } for (j=0;j<=m;j++) ass[next][j] = tmp[j]; if (ls[next] == 1) DP(next); } }}
int solve() { int i; if (m == 0) return 0; memset(ass,0,sizeof(ass)); memset(vist,0,sizeof(vist)); memcpy(ls,len,sizeof(len));
for (i = 1; i <= n;++i) DP(i); int ret = 0; for (i=1;i<=m;i++) ret = max(ret,ass[0][i]); return ret;}
int main() { int i; while (scanf("%d %d",&n,&m)==2) { if (n==-1 && m==-1) break; for (i=1;i<=n;i++) scanf("%d %d",&room[i][0],&room[i][1]); for (i=0;i<=n;i++) len[i] = 0; for (i=0;i
참조:
http://hi.baidu.com/%D3%FB%BB%B6%D0%A1%CF%B7/blog/item/b06b7d98dfd5df046f068c56.html
이 내용에 흥미가 있습니까?
현재 기사가 여러분의 문제를 해결하지 못하는 경우 AI 엔진은 머신러닝 분석(스마트 모델이 방금 만들어져 부정확한 경우가 있을 수 있음)을 통해 가장 유사한 기사를 추천합니다:
application ---- enter and save the file codeInput file name and content - input_content.html Receive content and save file and content - input_content01.jsp...
텍스트를 자유롭게 공유하거나 복사할 수 있습니다.하지만 이 문서의 URL은 참조 URL로 남겨 두십시오.
CC BY-SA 2.5, CC BY-SA 3.0 및 CC BY-SA 4.0에 따라 라이센스가 부여됩니다.