light oj 1037 状压dp

#include <iostream>
#include <cstdlib>
#include <cstring>
#include <queue>
#include <cstdio>
#include <algorithm>
#include <map>
//#include <time.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define LL long long

using namespace std;
//using namespace __gnu_pbds;

int dp[1<<20];

int attack[20][20],health[20];

int n;

int check(int j,int i)
{
    int a = 1;
    a = max(a,attack[j][i]);
    return (health[i]/a) + (health[i]%a?1:0);
}

int dfs(int statu)
{
    if(dp[statu] != -1)
        return dp[statu];
    dp[statu] = 0x3f3f3f3f;
    if(statu == 0)
        return dp[statu] = 0;
    for(int i = 1; i <= n; i++)
    {
        if( ((statu>>(i-1))&1) == 0 )
            continue;
        dp[statu] = min(dp[statu],dfs( (statu^(1<<(i-1))))+health[i]/1);
        for(int j = 1; j <= n; j++)
        {
            if(i == j) continue;

            if( ((statu>>(j-1))&1) == 0)
            {
                dp[statu] = min(dp[statu],dfs( (statu^(1<<(i-1)) )) + check(j,i) );
            }
        }

    }

    return dp[statu];
}

void solve()
{
    memset(dp,-1,sizeof(dp));

    scanf("%d",&n);
    for(int i = 1; i <= n; i++)
        scanf("%d",&health[i]);
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= n; j++)
            scanf("%1d",&attack[i][j]);

    int ans =  dfs( (1<<n)-1);

    printf("%d\n",ans);
}


int main(void)
{
    int t,cnt = 0;
    scanf("%d",&t);
    while(t--)
    {
        printf("Case %d: ",++cnt);
        solve();
    }
    return 0;
}