题意:一个人要从1点到N点,有m条边可以走,走每条边要花一些钱,这个人只有k的钱,问花的钱不多于K且能到N的最短路。
spfa解决最短路,不过dist数组要加一维,dist【i】【j】表示从1走到了i花了j钱的最短路。
感觉这时候就是个bfs
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
int n,k;
struct node
{
int to;
int next;
int w;
int l;
node(){}
node(int a,int b,int c,int d):to(a),next(b),w(c),l(d){}
}edge[10005];
typedef pair<int,int> P;
int head[105],vis[105][10005];
int tot;
int dist[105][10005];
void spfa()
{
memset(vis,0,sizeof(vis));
memset(dist,0x3f3f3f3f,sizeof(dist));
dist[1][0] = 0; vis[1][0] = 1;
queue<P>q; q.push(make_pair(1,0));
while(!q.empty())
{
P fr = q.front(); q.pop(); vis[fr.first][fr.second] = 0;
for(int i=head[fr.first];i!=-1;i=edge[i].next)
{
int v = edge[i].to;
if(fr.second+edge[i].w<=k&&dist[v][fr.second+edge[i].w]>dist[fr.first][fr.second]+edge[i].l)
{
dist[v][fr.second+edge[i].w] = dist[fr.first][fr.second]+edge[i].l;
if(!vis[v][fr.second+edge[i].w]) { q.push(make_pair(v,fr.second+edge[i].w)); vis[v][fr.second+edge[i].w] = 1;}
}
}
}
int ans = 0x3f3f3f3f;
for(int i=0;i<=k;i++)
ans = min(ans,dist[n][i]);
if(ans!=0x3f3f3f3f) printf("%d\n",ans);
else printf("-1\n");
}
int main()
{
int m,u,v,w,l; tot = 0;
scanf("%d%d%d",&k,&n,&m);
memset(head,-1,sizeof(head));
for(int i=0;i<m;i++)
{
scanf("%d%d%d%d",&u,&v,&l,&w);
edge[tot] = node(v,head[u],w,l);
head[u] = tot++;
}
spfa();
return 0;
}