UVa 658 It's not a Bug, it's a Feature!(最短路问题)

题目链接：http://acm.hust.edu.cn/vjudge/problem/22169

大体思路：按照刘汝佳的思路来的，把各个bug的状态（用一个二进制串来表示）当作结点，当前状态到下一状态当作边，然后套用dijkstra或SPFA算法即可。在寻找边时，直接枚举所有补丁，看看哪个能打上，把打上之后的状态求出来，然后不断更新新状态，当出现0时（即所有bug都消失时），即退出。

Dijkstra版

#include<cstdio>
#include<cstring>
#include<string>
#include<vector>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<queue>
#include<set>
#include<map>
#include<cctype>
using namespace std;
typedef long long ll;
const int maxn = 2e6 + 10;
const int INF = 1e9 + 10;
int vis[maxn];
int d[maxn];
int n,m;

struct Node {
   int d,u;
   Node(int d, int u) : d(d), u(u) {}
   bool operator < (const Node& rhs) const{
      return d > rhs.d;
   }
};

struct Patch
{
    string pre,after;
    int cost;
    bool operator < (const Patch& rhs) const {
       return cost < rhs.cost;
    }
}pat[105];

bool can_fix(int bug, int p)
{
    string s = pat[p].pre;
    for (int i = s.length()-1; i >= 0; i--) {
        if (s[i] == '0') continue;
        int x = (1<<i) & bug;
        if (s[i] == '+' && x == 0) return false;
        else if (s[i] == '-' && x >= 1) return false;
    }

    return true;
}

int fix_bug(int bug, int p)
{
    string s = pat[p].after;
    for (int i = s.length()-1; i >= 0; i--) {
        if (s[i] == '0') continue;
        if (s[i] == '-') {
           if (bug & (1<<i)) { //把第i位变为0
              bug ^= (1<<i);
           }
        }
        else if (s[i] == '+') {
           if (!(bug & (1<<i))) { //把第i位变为1
              int x = ~bug;
              x &= (1<<i);
              bug |= x;
           }
        }
    }

    return bug;
}

void dijkstra()
{
    priority_queue<Node> Q;
    while(!Q.empty()) Q.pop();
    d[(1<<n)-1] = 0;
    Q.push(Node(0, (1<<n)-1));
    while(!Q.empty()) {
        Node x = Q.top(); Q.pop();
        int u = x.u;
        if (vis[u]) continue;
        if (u == 0) return;
        vis[u] = 1;
        for (int i = 0; i < m; i++) {
            if (can_fix(u,i)) {
                int after = fix_bug(u,i);
                if (d[after] > d[u] + pat[i].cost) {
                    d[after] = d[u] + pat[i].cost;
                    Q.push(Node(d[after],after));
                }
            }
        }
    }
}

int main()
{
    int kase = 0;
    while (scanf("%d%d",&n,&m) && m) {
        memset(vis, 0, sizeof vis);
        for (int i = 0; i < (1<<n); i++) d[i] = INF;
        for (int i = 0; i < m; i++) {
            cin >> pat[i].cost >> pat[i].pre >> pat[i].after;
        }
        dijkstra();
        printf("Product %d\n",++kase);
        if (d[0] != INF) {
            printf("Fastest sequence takes %d seconds.\n\n",d[0]);
        }
        else
            printf("Bugs cannot be fixed.\n\n");
    }
}

SPFA版

#include<cstdio>
#include<cstring>
#include<string>
#include<vector>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<queue>
#include<set>
#include<map>
#include<cctype>
using namespace std;
typedef long long ll;
const int maxn = 2e6 + 10;
const int INF = 1e9 + 10;
int vis[maxn];
int cnt[maxn];
int d[maxn];
int n,m;

struct Node {
   int d,u;
   Node(int d, int u) : d(d), u(u) {}
   bool operator < (const Node& rhs) const{
      return d > rhs.d;
   }
};

struct Patch
{
    string pre,after;
    int cost;
    bool operator < (const Patch& rhs) const {
       return cost < rhs.cost;
    }
}pat[105];

bool can_fix(int bug, int p)
{
    string s = pat[p].pre;
    for (int i = s.length()-1; i >= 0; i--) {
        if (s[i] == '0') continue;
        int x = (1<<i) & bug;
        if (s[i] == '+' && x == 0) return false;
        else if (s[i] == '-' && x >= 1) return false;
    }

    return true;
}

int fix_bug(int bug, int p)
{
    string s = pat[p].after;
    for (int i = s.length()-1; i >= 0; i--) {
        if (s[i] == '0') continue;
        if (s[i] == '-') {
           if (bug & (1<<i)) { //把第i位变为0
              bug ^= (1<<i);
           }
        }
        else if (s[i] == '+') {
           if (!(bug & (1<<i))) { //把第i位变为1
              int x = ~bug;
              x &= (1<<i);
              bug |= x;
           }
        }
    }

    return bug;
}

void SPFA()
{
    queue<int> q;
    memset(vis, 0, sizeof vis);
    memset(cnt, 0, sizeof cnt);
    for (int i = 0; i < (1<<n); i++) d[i] = INF;
    d[(1<<n)-1] = 0;
    vis[(1<<n)-1] = 1;
    q.push((1<<n)-1);
    while(!q.empty()) {
        int u = q.front(); q.pop();
        vis[u] = 0;
        for (int i = 0; i < m; i++) {
            if (can_fix(u,i)) {
                int after = fix_bug(u,i);
                if (d[u] < INF && d[after] > d[u] + pat[i].cost) {
                    d[after] = d[u] + pat[i].cost;
                    if (!vis[after]) {
                        q.push(after);
                        vis[after] = 1;
                    }
                }
            }
        }
    }
}

int main()
{
    int kase = 0;
    while (scanf("%d%d",&n,&m) && m) {
        //memset(vis, 0, sizeof vis);
        for (int i = 0; i < (1<<n); i++) d[i] = INF;
        for (int i = 0; i < m; i++) {
            cin >> pat[i].cost >> pat[i].pre >> pat[i].after;
        }
        SPFA();
        printf("Product %d\n",++kase);
        if (d[0] != INF) {
            printf("Fastest sequence takes %d seconds.\n\n",d[0]);
        }
        else
            printf("Bugs cannot be fixed.\n\n");
    }
}