4145: [AMPPZ2014]The Prices 状压DP

裸状压DP，令$f_{i,j}$表示前$i$个商店物品购买状态为$j$的最小值，每次在每个商店里跑背包。

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int n,m,d[105],c[105][17];
int f[105][1<<16];
inline int read()
{
    int a=0,f=1; char c=getchar();
    while (c<'0'||c>'9') {if (c=='-') f=-1; c=getchar();}
    while (c>='0'&&c<='9') {a=a*10+c-'0'; c=getchar();}
    return a*f;
}
int main()
{
    n=read(); m=read();
    for (int i=1;i<=n;i++) 
    {
        d[i]=read();
        for (int j=1;j<=m;j++) c[i][j]=read();
    }
    memset(f,127/3,sizeof(f));
    f[0][0]=0;
    for (int i=1;i<=n;i++)
    {
        for (int j=0;j<(1<<m);j++) f[i][j]=f[i-1][j]+d[i];
        for (int k=1;k<=m;k++)
            for (int j=0;j<(1<<m);j++)
                if (((1<<(k-1))&j)==0)
                    f[i][j|(1<<(k-1))]=min(f[i][j|(1<<(k-1))],f[i][j]+c[i][k]);
        for (int j=0;j<(1<<m);j++) f[i][j]=min(f[i][j],f[i-1][j]);
    }
    printf("%d\n",f[n][(1<<m)-1]);
    return 0;
}