lightoj 1037 - Agent 47

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.

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 a 2D matrix with the i^th 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 i^th 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 10⁶ denoting the health of the targets 0, 1, 2, ..., N-1. Each of the next N lines contains N digits. The j^th digit of the i^th 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

 

这题的大意是让你杀死n个敌人，每个敌人有一定的血量，你初始带的武器每一发子弹只能打敌人1滴血，但是你杀死敌人后可以获取他的武器，下面一个n*n的矩阵代表敌人的武器能对每一个敌人造成多少伤害，第i行第j列的数a[i][j]表示第i个武器可以打第j个敌人a[i][j]滴血。

问你最少打多少下，才能杀死所有敌人。

这是一个很神奇的状压DP（我感觉。。。）（还有话说lightoj怎么这么多状压DP），需要预处理出在第i个状态下杀死第j个敌人用的子弹数。

然后就是线性的DP了。

#include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define inf 1e9
using namespace std;

int solve(int a,int b)
{
    if(b == 0)
        return inf;
    if(a % b == 0)
        return a/b;
    else
        return a/b+1;
}
int a[20][20],b[20];
int dp[1<<15];
int c[1<<15][20];

int main(void)
{
    int T,n,i,j,k;
    scanf("%d",&T);
    int cas = 1;
    while(T--)
    {
        scanf("%d",&n);
        for(i=0;i<n;i++)
            scanf("%d",&b[i]);
        for(i=0;i<n;i++)
        {
            char s[20];
            scanf("%s",s);
            for(j=0;s[j]!='\0';j++)
                a[i][j] = s[j] - '0';
        }
        for(i=0;i<(1<<n);i++)
            for(j=0;j<n;j++)
                c[i][j] = b[j];
        for(i=0;i<(1<<n);i++)
        {
            for(j=0;j<n;j++)
                if(i&(1<<j))
                {
                    int s = i - (1<<j);
                    for(k=0;k<n;k++)
                    {
                        if(s&(1<<k))
                            c[s][j] = min(c[s][j],solve(b[j],a[k][j]));
                    }
                }
        }
        for(i=1;i<(1<<n);i++)
        {
            dp[i] = inf;
            for(j=0;j<n;j++)
            {
                if(i&(1<<j))
                {
                    int s = i - (1<<j);
                    dp[i] = min(dp[i],dp[s] + c[s][j]);
                }
            }
        }
        printf("Case %d: %d\n", cas++, dp[(1<<n)-1]);
    }
}