poj 3411 Paid Roads

题目：http://poj.org/problem?id=3411

#include<stdio.h>
#include<iostream>
#include<string.h>
#include<string>
#include<algorithm>
#include<queue>
using namespace std;

#define rep(i,s,t) for(int i=s;i<t;i++)
#define INF (~0U>>3)

int a[11],b[11],c[11],p[11],r[11];
int n,m,all;
int dp[1<<10][10];
bool vis[1<<10][10];

struct node{
	int st,end;
};

inline void spfa(){
	node vn,vw;
	vn.st=1,vn.end=0;
	dp[1][0]=0;
	queue<node>q;q.push(vn);
	memset(vis,0,sizeof(vis));
	vis[vn.st][vn.end]=1;
	while(!q.empty()){
		vn=q.front();
		q.pop();
		vis[vn.st][vn.end]=0;
		rep(i,0,m){
			if(a[i]==vn.end){
				//if(vn.st&(1<<b[i])) continue;
				int nxt=(vn.st|(1<<b[i]));
				int val=dp[vn.st][vn.end]+r[i];
				if(vn.st&(1<<c[i])){
					val=min(val,dp[vn.st][vn.end]+p[i]);
				}
				if(dp[nxt][b[i]]>val){
					dp[nxt][b[i]]=val;
					if(!vis[nxt][b[i]]){
						vis[nxt][b[i]]=1;
						vw.st=nxt,vw.end=b[i];
						q.push(vw);
					}
				}
			}
		}
	}	
}

int main(){
	while(~scanf("%d%d",&n,&m)){
		rep(i,0,m){
			scanf("%d%d%d%d%d",&a[i],&b[i],&c[i],&p[i],&r[i]);
			a[i]--,b[i]--,c[i]--;
		}
		all=(1<<n);
		rep(i,0,all) rep(j,0,n) dp[i][j]=INF;
		spfa();
		/*rep(i,0,all){
			rep(j,0,n){
				printf("%d ",dp[i][j]);
			}
			printf("\n");
		}*/
		int ans=INF;
		rep(i,0,all) if(i&(1<<0) && (i&(1<<(n-1)))) ans=min(ans,dp[i][n-1]);
		if(ans==INF) puts("impossible");
		else printf("%d\n",ans);
	}
	return 0;
}