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[<<];

 int attack[][],health[];

 int n;

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

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

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

     }

     return dp[statu];
 }

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

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

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

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

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