Full Tank? POJ-3635

 

写这个，，主要是看到了用vector来模拟邻接表，就http://www.cnblogs.com/yimao/archive/2012/06/26/2563262.html 的思路来了一遍

#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<string.h>
 
using namespace std;


#define mpair make_pair//好像只能用这个定义 
//typedef make_pair MKPII;//这个不能用 
typedef pair<int, int> PII;

const int Max = 10000+5;

vector<PII> map[Max];
int price[Max];
int n, m;

struct Node{
	int u, vol, cost;
	
	Node(){
	};
	Node(int a, int b, int c){
		u = a, vol = b, cost = c;
	}
	bool operator <(const Node &a) const{
		return cost > a.cost;	
	}
};
bool vis[Max][105];

void bfs(int VOL, int st, int ed){
    memset(vis, 0, sizeof(vis));
	
	priority_queue<Node> Q;//每次都会直接初始化 
    
    Q.push(Node( st, 0, 0 ) );
    
	while(!Q.empty() ){
        Node a= Q.top();
		Q.pop();
        
		int u= a.u, vol= a.vol, cost= a.cost;
        
		vis[u][vol]= 1;//标记 
        
		if(u==ed){
			printf("%d\n", cost);
		    return;
		 }
		  
        if(vol<VOL && !vis[u][vol+1]) //1.加一升油
            Q.push(Node(u, vol+1, cost+price[u]));

        for(int i=0; i<map[u].size(); ++i){//去下一个点 
            int v= map[u][i].first;
			int w= map[u][i].second;
			
            if(vol>=w && !vis[v][vol-w])
                Q.push(Node( v, vol-w, cost));
        }
    }
    printf("impossible\n");
 
    return;
}


int main()
{
	
	while(cin >> n >> m){
		int u, v, x, q;
		
		for(int i=0; i<n; i++) {

			scanf("%d", price+i);//			scanf("%d", &price[i]);

			map[i].clear();
		}
        while(m--){
            scanf("%d%d%d", &u, &v, &x);
            map[u].push_back(PII( v, x ) );
            map[v].push_back(PII( u, x ) );
        }

        cin>>q;
        
        while( q-- ){
            scanf("%d%d%d", &x, &u, &v);
            bfs(x, u, v);
            
        }
	}
	
	return 0;
 }