# LightOJ 1037

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.

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.

# 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

#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);
}


#### lightoj 1037 Agent 47

2013-08-24 16:18:59

#### lightoj 1037 - Agent 47

2016-09-06 19:06:06

#### #1037 : 数字三角形

2016-04-03 15:12:54

#### 杭电1037——Keep on Truckin'（简单题）

2015-11-08 16:40:45

#### Lightoj 1037 数位DP

2013-10-19 10:31:21

#### LightOJ 1037 Agent 47

2015-11-26 14:05:53

#### 动态规划 POJ 1037 A decorative fence

2011-11-04 15:58:44

#### 【BZOJ1037】【ZJOI2008】生日聚会Party 递推

2015-10-21 12:52:37

#### Pb调出帮助时提示“运行宏时出现问题。(1037)”

2016-12-06 14:22:07

#### 1037. 在霍格沃茨找零钱（20）

2015-03-14 19:51:32