题目链接:http://www.lydsy.com/JudgeOnline/problem.php?id=2763
题目大意:给你一张无向图,可以免费走k条路,求起点到终点的最短路
bzoj少见的水题(你写题解的不都是水题吗= =)
dist[i][j]代表起点到i,免费走j条路的最短路,跑Dijkstra或者SPFA即可
(不得不说SPFA不加优化真的好慢= =)
#include <iostream>
#include <cstdio>
#include <queue>
#define INF 214748367
using namespace std;
struct Link
{
int s,t,c,next;
}l[200000];
struct poi
{
int x,y;
};
int dist[20000][20];
int g[20000];
queue<poi> Q;
int n,m,k;
int spfa(int s,int t)
{
for(int i = 0;i < n;i ++)
for(int j = 0;j <= k;j ++)
dist[i][j] = INF;
dist[s][0] = 0;
Q.push((poi){s,0});
while(!Q.empty())
{
int x = Q.front().x;
int y = Q.front().y;
int w = g[x];
while(w)
{
if(dist[l[w].t][y] > dist[x][y] + l[w].c)
{
dist[l[w].t][y] = dist[x][y] + l[w].c;
Q.push((poi){l[w].t,y});
}
if(y < k && dist[l[w].t][y+1] > dist[x][y])
{
dist[l[w].t][y+1] = dist[x][y];
Q.push((poi){l[w].t,y+1});
}
w = l[w].next;
}
Q.pop();
}
int ans = INF;
for(int i = 0;i <= k;i ++)
ans = min(ans,dist[t][i]);
return ans;
}
void Add_Link(int s,int t,int c,int x)
{
l[x].s = s;
l[x].t = t;
l[x].c = c;
l[x].next = g[s];
g[s] = x;
return ;
}
int main()
{
int s,t,x,y,z;
scanf("%d%d%d%d%d",&n,&m,&k,&s,&t);
for(int i = 1;i <= m;i ++)
{
scanf("%d%d%d",&x,&y,&z);
Add_Link(x,y,z,i);
Add_Link(y,x,z,i+m);
}
cout << spfa(s,t);
return 0;
}