关闭

LightOJ 1037

119人阅读 评论(0) 收藏 举报
分类:

诶 ~稍微说下为什么不写1035的原因~  因为题目挺裸  用什么办法都可以做出来,所以干脆就不写了xD,并不是因为偷懒什么的呢哼!

此外本来想把这货留到明天再写【万一明天卡题目了呢Q=Q】  但是也仅仅是想想而已。


1037 - Agent 47
Time Limit: 2 second(s) Memory Limit: 32 MB

Agent 47 is in a dangerous Mission "Black Monster Defeat - 15". It is a secret mission and so 47 has a limited supply of weapons. As a matter of fact he has only one weapon the old weak "KM .45 Tactical (USP)". The mission sounds simple - "he will encounter at most 15 Targets and he has to kill them all". The main difficulty is the weapon. After huge calculations, he found a way out. That is after defeating a target, he can use target's weapon to kill other targets. So there must be an order of killing the targets so that the total number of weapon shots is minimized. As a personal programmer of Agent 47 you have to calculate the least number of shots that need to be fired to kill all the targets.

182011-agent47_large

Agent 47

Now you are given a list indicating how much damage each weapon does to each target per shot, and you know how much health each target has. When a target's health is reduced to 0 or less, he is killed. 47 start off only with the KM .45 Tactical (USP), which does damage 1 per shot to any target. The list is represented as a2D matrix with the ith element containing N single digit numbers ('0'-'9'), denoting the damage done to targets 0, 1, 2, ..., N-1 by the weapon obtained from target i, and the health is represented as a series of N integers, with the ith element representing the amount of health that target has.

Given the list representing all the weapon damages, and the health each target has, you should find the least number of shots he needs to fire to kill all of the targets.

Input

Input starts with an integer T (≤ 40), denoting the number of test cases.

Each case begins with a blank line and an integer N (1 ≤ N ≤ 15). The next line contains N space separated integers between 1 and 106 denoting the health of the targets 0, 1, 2, ..., N-1. Each of the next N lines contains N digits. The jth digit of the ith line denotes the damage done to target j, if you use the weapon of target i in each shot.

Output

For each case of input you have to print the case number and the least number of shots that need to be fired to kill all of the targets.

Sample Input

Output for Sample Input

2

 

3

10 10 10

010

100

111

 

3

3 5 7

030

500

007

Case 1: 30

Case 2: 12

 

 


PROBLEM SETTER: MUHAMMAD RIFAYAT SAMEE
SPECIAL THANKS: JANE ALAM JAN

首先我可以吐槽一下我讨厌那个光头吗喂!  然后说明题意:

这题题意就是,你需要消灭N个怪兽,但是消灭怪兽的顺序可以由你自己决定,每个怪兽会掉落武器,这些武器每次攻击可能可以对其他怪兽造成不同程度的伤害。最开始一直有一把每次攻击使怪兽掉1滴血的武器。【然而这并没有什么卵用Q=Q】第i个怪兽掉落的武器对第j个怪兽可以造成的伤害范围是0--9 由一个矩阵给出。最后需要求你最少需要进行多少次攻击才可以消灭所有怪兽。


因为这题的数据范围真的是很小啊喂!这题可以作为状态dp的入门题吧233 f[i]中i表示目前消灭的怪兽情况,i的二进制上为1的为已经消灭的怪兽,反之为待消灭的怪兽。f[i]即是所需要的最少攻击次数。需要注意的是,使用默认武器时候的情况。


#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define STATU 40000
using namespace std;
int dp[STATU];
int hea[20];
char mat[20][20];
int dam[20][STATU];
void gao(int cas){
	int n;
	scanf("%d",&n);
	for (int i=0;i<n;i++)
		scanf("%d",&hea[i]);
	for (int i=0;i<n;i++)
		scanf("%s",mat[i]);
	for (int i=0;i<(1<<n);i++)
		dp[i]=-1;
	dp[0]=0;
	for (int i=0;i<(1<<n);i++)
		for (int j=0;j<n;j++)
			if ((i&(1<<j))==0){
				dp[i|(1<<j)]=(dp[i|(1<<j)]==-1)?(dp[i]+hea[j]):(min(dp[i|(1<<j)],dp[i]+hea[j]));;
				for (int k=0;k<n;k++)
					if ((i&(1<<k))!=0){
						int shot=0;
						if (mat[k][j]=='0')
							continue;
						else if (hea[j]%(mat[k][j]-'0')==0)
							shot=hea[j]/(mat[k][j]-'0');
						else
							shot=hea[j]/(mat[k][j]-'0')+1;
						dp[i|(1<<j)]=(dp[i|(1<<j)]==-1)?(dp[i]+shot):(min(dp[i|(1<<j)],dp[i]+shot));
					}
			}
	printf("Case %d: %d\n",cas,dp[(1<<n)-1]);
}
int main(){
	int t;
	scanf("%d",&t);
	for (int cas=1;cas<=t;cas++)
		gao(cas);
}


好吧XD 是时候去吃好吃的串串,然后躲在宿舍看小说了
 
0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:1709次
    • 积分:122
    • 等级:
    • 排名:千里之外
    • 原创:11篇
    • 转载:0篇
    • 译文:0篇
    • 评论:0条
    文章分类
    文章存档