uva658 - It's not a Bug, it's a Feature! 状态压缩+隐式图搜索+优先队列的dijkstra
| It's not a Bug, it's a Feature! |
It is a curious fact that consumers buying a new software product generally donot expect the software to be bug-free. Can you imagine buying a car whose steering wheel only turns to the right? Or a CD-player that plays only CDs with country music on them? Probably not. But for software systems it seems to be acceptable if they do not perform as they should do. In fact, many software companies have adopted the habit of sending out patches to fix bugs every few weeks after a new product is released (and even charging money for the patches).
Tinyware Inc. is one of those companies. After releasing a new word processing software this summer, they have been producing patches ever since. Only this weekend they have realized a big problem with the patches they released. While all patches fix some bugs, they often rely on other bugs to be present to be installed. This happens because to fix one bug, the patches exploit the special behavior of the program due to another bug.
More formally, the situation looks like this. Tinyware has found a total of n bugs in their software. And they have releasedm patches
. To apply patchpi to the software, the bugs
have to be present in the software, and the bugs
must be absent (of course
holds). The patch then fixes the bugs
(if they have been present) and introduces the new bugs
(where, again,
).
Tinyware's problem is a simple one. Given the original version of their software, which contains all the bugs inB, it is possible to apply a sequence of patches to the software which results in a bug- free version of the software? And if so, assuming that every patch takes a certain time to apply, how long does the fastest sequence take?
Input
The input contains several product descriptions. Each description starts with a line containing two integers n and m, the number of bugs and patches, respectively. These values satisfyThe first of these strings describes the bugs that have to be present or absent before the patch can be applied. Thei-th position of that string is a ``+'' if bug bi has to be present, a ``-'' if bugbi has to be absent, and a `` 0'' if it doesn't matter whether the bug is present or not.
The second string describes which bugs are fixed and introduced by the patch. Thei-th position of that string is a ``+'' if bug bi is introduced by the patch, a ``-'' if bugbi is removed by the patch (if it was present), and a ``0'' if bugbi is not affected by the patch (if it was present before, it still is, if it wasn't, is still isn't).
The input is terminated by a description starting with n = m = 0. This test case should not be processed.
Output
For each product description first output the number of the product. Then output whether there is a sequence of patches that removes all bugs from a product that has all n bugs. Note that in such a sequence a patch may be used multiple times. If there is such a sequence, output the time taken by the fastest sequence in the format shown in the sample output. If there is no such sequence, output `` Bugs cannot be fixed.''.Print a blank line after each test case.
Sample Input
3 3 1 000 00- 1 00- 0-+ 2 0-- -++ 4 1 7 0-0+ ---- 0 0
Sample Output
Product 1 Fastest sequence takes 8 seconds. Product 2 Bugs cannot be fixed.
首先。。这个题肯定不是我自己想出来的。。太高端了，光题目意思就看了好久。参考了别人的思路。
有N个bug和M个补丁，接下来M行给出这个补丁需要的时间，第一个字符串a是这个补丁只能在这种状态下才能使用，a[i]=='+'就是第i个漏洞必须存在，a[i]=='-'是第i个漏洞不能存在，a[i]==‘0’不要求。第二个串b，b[i]=='+'是使用这个补丁后第i个bug产生，b[i]=='-'是使用这个补丁后第i个bug被修复，b[i]=='0'还保持原来的状态不变。问最少需要多少时间修复所有的漏洞。
主要思想是把每种状态用2进制表示，建图，起点为11111（n个，也就是2^n-1），用dijkstra算出终点状态（0）的最短路。。这题还必须要用优先队列的dijkstra，要不会超时。。。
建图的时候dfs每种补丁能修复的所有状态，把这个能修复的状态和修复后的状态建立连接。因为要用优先队列的dijkstra，就要用到pair，定义结构体有y和t。定义的vector为结构体的类型的数组。
优先队列的dijkstra方法：定义pii的优先队列priority_queue<pii,vector<pii>,greater<pii> >q; 先把起点和0加到优先队列里。当队列非空，每次取出d值最小的（如果不定义优先队列的比较函数，pair时默认先比较第一维），然后删除，也就是pii cur=q.top()，q.pop()。这时x=cur.second就是要加入的点了，如果x没有访问过，把x标记访问，再把跟x连接的点（有v[x].size()个）都更新重新加入队列（就算一个点被加入多次也没事，先取出的也是d值最小的那个）。最后d[0]就是答案。
优先队列的dijkstra算法复杂度是O（MlogN），因为会把每条边算一遍，并且优先队列操作复杂度是O(logN)。
#include<cstring>
#include<cstdio>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<queue>
#include<map>
#include<vector>
#define INF 0x3f3f3f3f
#define pii pair<int,int>
using namespace std;
int N,M,T,P;
int vis[1200000],d[1200000];
char a[25],b[25];
struct st{
int y,t;
};
vector<st> v[1200000];
void add(int fa,int son){
st cur;
cur.y=son;
cur.t=T;
v[fa].push_back(cur);
}
void DFS(int cur,int *s){
if(cur>=N){
int fa=0,son=0,k;
for(int i=0;i<N;i++){
if(b[i]=='0') k=s[i];
if(b[i]=='+') k=1;
if(b[i]=='-') k=0;
son=(son<<1)+k;
fa=(fa<<1)+s[i];
}
add(fa,son);
return;
}
if(a[cur]=='0'){
s[cur]=0;
DFS(cur+1,s);
s[cur]=1;
DFS(cur+1,s);
}
if(a[cur]=='+'){
s[cur]=1;
DFS(cur+1,s);
}
if(a[cur]=='-'){
s[cur]=0;
DFS(cur+1,s);
}
}
void dijkstra(){
priority_queue<pii,vector<pii>,greater<pii> >q;
memset(vis,0,sizeof(vis));
memset(d,INF,sizeof(d));
d[P-1]=0;
q.push(make_pair(d[P-1],P-1));
while(!q.empty()){
pii cur=q.top();
q.pop();
int x=cur.second;
if(vis[x]) continue;
vis[x]=1;
int L=v[x].size();
for(int i=0;i<L;i++){
int y=v[x][i].y;
if(d[x]+v[x][i].t<d[y]){
d[y]=d[x]+v[x][i].t;
q.push(make_pair(d[y],y));
}
}
}
if(d[0]==INF) printf("Bugs cannot be fixed.\n\n");
else printf("Fastest sequence takes %d seconds.\n\n",d[0]);
}
int main(){
freopen("in.txt","r",stdin);
int cas=0;
while(scanf("%d%d",&N,&M),N||M){
P=1<<N;
for(int i=0;i<P;i++) v[i].clear();
while(M--){
scanf("%d%s%s",&T,a,b);
int c[25];
memset(c,0,sizeof(c));
DFS(0,c);
}
printf("Product %d\n",++cas);
dijkstra();
}
return 0;
}