网络流二十四题之软件补丁问题

这道题其实是一个状态压缩+最短路。将状态建图，按照题目要求进行转移，怕一个spfa就行：

#include <bits/stdc++.h>
#define ll long long
using namespace std;
#define maxm 110
#define maxn 1100000
#define INF 0xffffff

int w[maxm],b1[maxm],b2[maxm],f1[maxm],f2[maxm];

int dis[maxn];
bool vis[maxn];
queue<int> q;
int st,en,n,m;
void spfa()
{
    while(!q.empty()) q.pop();
    memset(dis,0x7f,sizeof(dis));
    memset(vis,0,sizeof(vis));
    q.push(st);
    dis[st] = 0;
    vis[st] = 1;
    while(!q.empty())
    {
        int x = q.front();
        for(int i = 1;i<=m;i++)
        {
            if((x & b1[i]) == b1[i] && (x & b2[i]) == 0)
            {
                int y = x - (x & f1[i]);
                y |= f2[i];
                if(dis[y] > dis[x] + w[i])
                {
                    dis[y] = dis[x] + w[i];
                    if(!vis[y])
                    {
                        q.push(y);
                        vis[y] = 1;
                    }

                }
            }
        }
        q.pop();
        vis[x] = 0;
    }
}
int main()
{
    char s[30];
    scanf("%d%d",&n,&m);
    for(int i = 1;i<=m;i++)
    {
        scanf("%d",&w[i]);
        scanf("%s",s);
        b1[i] = b2[i] = f1[i] = f2[i] = 0;
        for(int j = 0;j<n;j++)
        {
            if(s[j] == '+') b1[i] += (1 << j);
            else if(s[j] == '-') b2[i] += ( 1<< j);
        }
        scanf("%s",s);
        for(int j = 0;j<n;j++)
        {
            if(s[j] == '-') f1[i] +=(1 << j);
            else if(s[j] == '+') f2[i] += (1<< j);
        }
    }
    st  = (1<<n)-1;
    en = 0;
    spfa();
    if(dis[en] >= INF-1000000) printf("0\n");
    else printf("%d\n",dis[en]);
    return 0;
}