UVA 658 It's not a Bug, it's a Feature!

#include<bits/stdc++.h>
using namespace std;
const int M=110,N=1050000;
int a1[M],a2[M],b1[M],b2[M],f1[N],f2[N],mp[N],tim[M];
string s1,s2;
int main(){
	int i,j,h,t,n,m,ans,kase=0;
	while(scanf("%d%d",&n,&m)&&n&&m){
		memset(mp,0,sizeof(mp));
		for(i=1;i<=m;i++){
			cin>>tim[i]>>s1>>s2;
			a1[i]=0;a2[i]=0;b1[i]=0;b2[i]=0;
			for(j=n-1;j>=0;j--){
				if(s1[j]!='0')a1[i]+=(1<<j);
				if(s1[j]=='+')a2[i]+=(1<<j);
				if(s2[j]=='+')b1[i]+=(1<<j);
				if(s2[j]!='-')b2[i]+=(1<<j);
			}
		}
		h=0;
		t=1;
		f1[1]=(1<<n)-1;
		f2[1]=0;
		ans=1e9;
		printf("Product %d\n",++kase);
		do{
			h++;
			for(i=1;i<=m;i++)
				if((f1[h]&a1[i])==a2[i]){
					f1[++t]=((f1[h]|b1[i])&b2[i]);
					f2[t]=f2[h]+tim[i];
					if(mp[f1[t]]!=0&&mp[f1[t]]<f2[t]){
						t--;
						continue;
					}
					mp[f1[t]]=f2[t];
					if(f1[t]==0)ans=min(ans,f2[t]);
				}
		}while(h<t);
		if(ans==1e9)printf("Bugs cannot be fixed.\n");
		else printf("Fastest sequence takes %d seconds.\n",ans);
		printf("\n");
	}
	return 0;
}