题目链接:http://poj.org/problem?id=1724
题意:
共1~N城市,从城市1出发到城市N,给出R条路,每条路有长度有花费,起始资金K,
求到达城市N的最短路程,不能达到则输出-1
剪枝,否则TLE.
// ROADS -- POJ 1724
#include<iostream>
#include<cstdio>
#include<cmath>
#include<queue>
#include<vector>
#include<string>
#include<cstring>
#include<stack>
#include<algorithm>
using namespace std;
typedef long long ll;
#define maxn 1000000
int n,m,x,y,ans=0;
struct Road
{
int d,l,t;
};
int dx[5]={0,0,1,-1};
vector < vector <Road> >CityMap(110);
int minlen = 1 << 30;
int K,N,R;
int tolen=0,tocost=0;
int minlk[110][10100];
int visited[110];
void dfs(int s)
{
if(s==N){
minlen = min(minlen,tolen);
return ;
}
for(int i=0;i<CityMap[s].size();i++){
int d = CityMap[s][i].d;
if(!visited[d]){
int cost = tocost + CityMap[s][i].t;
if(cost>K) continue ;//可行性剪枝(钱花超了)
// 基本最优剪枝+处处最优剪枝
//要走的路径长度已大于当前最优路径
// + 下一步不是最优
if(tolen+CityMap[s][i].l>=minlen||
tolen+CityMap[s][i].l>=minlk[d][cost])
continue;
tolen += CityMap[s][i].l;
tocost += CityMap[s][i].t;
minlk[d][cost]=tolen;
visited[d]=1;
dfs(d);
visited[d]=0;
tolen -= CityMap[s][i].l;
tocost -= CityMap[s][i].t;
}
}
}
int main()
{
memset(visited,0,sizeof(visited));
cin >> K >> N >> R;
for(int i=0;i<R;i++){
int s; Road r;
cin>>s>>r.d>>r.l>>r.t;
CityMap[s].push_back(r);
}
for(int i=0;i<110;i++)
for(int j=0;j<10100;j++)
minlk[i][j] = 1 << 30;
visited[1]=1;
dfs(1);
if(minlen<(1<<30))
cout << minlen << endl;
else
cout << "-1" << endl;
return 0;
}