pku 1724 ROADS(搜索，记录状态)

用DFS,BFS始终过不了，一直TLE，后来不得已上了priority_queue。

方法有点类似dijkstra，节点比较的时候先比dist，dist相同的时候选择money小的。这种方法有一个好处是可以在priority_queue.top.position==end的时候直接结束，纯BFS,DFS则需要等到队列为空才能确定最后的答案。

用一个数组dist_s[i][j]=k记录状态，表示当达到第i个城市并消耗j元的时候，最短路径为k。记录状态的目的是剪枝，当往下搜索时碰到i,j相等，k却更大的路径，就可以忽略掉而不加到优先队列中。

#include <iostream> #include <queue> using namespace std; const int max_city=102; const int max_road=10002; struct Node { int position,dist,money; void Add(int a,int b,int c); }; bool operator>(const Node& a,const Node& b) { if(a.dist==b.dist) return a.money>b.money; else return a.dist>b.dist; } priority_queue<Node,vector<Node>,greater<vector<Node>::value_type>> info; int min_dist=INT_MAX; int K,N,R; struct { int source,dest,lenght,cost; int next; }edge[max_road]; int p[max_city]; void Node::Add(int a,int b,int c) { position=a,dist=b,money=c; } int dist_s[max_city][10005]; void exDijkstra(int start,int end) { memset(dist_s,-1,sizeof(dist_s)); Node now,temp; now.dist=0; now.money=0; now.position=1; info.push(now); dist_s[1][0]=0; while(!info.empty()) { now=info.top(); info.pop(); if(now.position==end) { min_dist=now.dist; return; } int t=p[now.position]; while(t!=-1) { temp.dist=now.dist+edge[t].lenght; temp.money=now.money+edge[t].cost; temp.position=edge[t].dest; if(temp.money<=K) { if(temp.dist<dist_s[edge[t].dest][temp.money]||dist_s[edge[t].dest][temp.money]==-1) { dist_s[edge[t].dest][temp.money]=temp.dist; info.push(temp); } } t=edge[t].next; } } } int main() { scanf("%d%d%d",&K,&N,&R); memset(p,-1,sizeof(p)); for(int i=0;i<R;i++) { scanf("%d%d%d%d",&edge[i].source,&edge[i].dest,&edge[i].lenght,&edge[i].cost); edge[i].next=p[edge[i].source]; p[edge[i].source]=i; } exDijkstra(1,N); if(min_dist!=INT_MAX) printf("%d/n",min_dist); else printf("-1/n"); return 0; }