2763: [JLOI2011]飞行路线
Time Limit: 10 Sec Memory Limit: 128 MBSubmit: 1325 Solved: 512
[ Submit][ Status][ Discuss]
Description
Alice和Bob现在要乘飞机旅行,他们选择了一家相对便宜的航空公司。该航空公司一共在n个城市设有业务,设这些城市分别标记为0到n-1,一共有m种航线,每种航线连接两个城市,并且航线有一定的价格。Alice和Bob现在要从一个城市沿着航线到达另一个城市,途中可以进行转机。航空公司对他们这次旅行也推出优惠,他们可以免费在最多k种航线上搭乘飞机。那么Alice和Bob这次出行最少花费多少?
Input
数据的第一行有三个整数,n,m,k,分别表示城市数,航线数和免费乘坐次数。
第二行有两个整数,s,t,分别表示他们出行的起点城市编号和终点城市编号。(0<=s,t<n)
接下来有m行,每行三个整数,a,b,c,表示存在一种航线,能从城市a到达城市b,或从城市b到达城市a,价格为c。(0<=a,b<n,a与b不相等,0<=c<=1000)
Output
只有一行,包含一个整数,为最少花费。
Sample Input
5 6 1
0 4
0 1 5
1 2 5
2 3 5
3 4 5
2 3 3
0 2 100
0 4
0 1 5
1 2 5
2 3 5
3 4 5
2 3 3
0 2 100
Sample Output
8
HINT
对于30%的数据,2<=n<=50,1<=m<=300,k=0;
对于50%的数据,2<=n<=600,1<=m<=6000,0<=k<=1;
对于100%的数据,2<=n<=10000,1<=m<=50000,0<=k<=10.
我们用dis[i][j]表示走到i节点时免费j次取到的最小花费,之后加上堆优化,要不然T到死去活来~
CODE
# include <cstdio>
# include <cstring>
# include <algorithm>
# include <queue>
using namespace std;
const int MAXM(50050);
const int MAXN(10010);
const int MAXK(20);
inline int Max(int a,int b) {
return a > b ? a : b;
}
inline int Min(int a,int b) {
return a < b ? a : b;
}
int n,m,k,tot,st,en,ans = 0x7fffffff;
int h[MAXN];
int dis[MAXN][MAXK];
bool vis[MAXN][MAXK];
struct Edge {
int v,w,next,u;
} e[MAXM << 1];
struct flight {
int ver,step,dis;
bool friend operator < (flight a,flight b) {
return a.dis > b.dis;
}
};
void add(int u,int v,int w) {
e[++tot].u = u;
e[tot].v = v;
e[tot].w = w;
e[tot].next = h[u];
h[u] = tot;
}
void work1() {
int diss[MAXN];
memset(diss,0x3f,sizeof(diss));
bool viss[MAXN] = {0};
queue <int> q;
q.push(st);
diss[st] = 0;
viss[st] = 1;
while(!q.empty()) {
int u = q.front();
q.pop();
viss[u] = 0;
for(int i = h[u]; i; i = e[i].next) {
int v = e[i].v;
if(diss[v] > diss[u] + e[i].w) {
diss[v] = diss[u] + e[i].w;
if(!viss[v]) {
viss[v] = 1;
q.push(v);
}
}
}
}
printf("%d",diss[en]);
}
void work2() {
memset(dis,0x3f,sizeof(dis));
priority_queue <flight> q;
flight last,now;
last.ver = st;
last.step = 0;
last.dis = 0;
dis[last.ver][last.step] = 0;
q.push(last);
vis[last.ver][last.step] = 1;
while(!q.empty()) {
now = q.top();
q.pop();
vis[now.ver][now.step] = 0;
for(int i = h[now.ver];i;i = e[i].next) {
int v = e[i].v;
if(now.step + 1 <= k) {
if(dis[v][now.step + 1] > dis[now.ver][now.step]) {
dis[v][now.step + 1] = dis[now.ver][now.step];
if(!vis[v][now.step + 1]) {
vis[v][now.step + 1] = 1;
q.push((flight){v,now.step + 1,dis[v][now.step + 1]});
}
}
}
if(dis[v][now.step] > dis[now.ver][now.step] + e[i].w) {
dis[v][now.step] = dis[now.ver][now.step] + e[i].w;
if(!vis[v][now.step]) {
vis[v][now.step] = 1;
q.push((flight){v,now.step,dis[v][now.step]});
}
}
}
}
for(int i = 0; i <= k; ++i) ans = Min(dis[en][i],ans);
printf("%d",ans);
}
void init() {
int i,u,v,w;
scanf("%d%d%d%d%d",&n,&m,&k,&st,&en);
st++;
en++;
for(i = 1; i <= m; ++i) {
scanf("%d%d%d",&u,&v,&w);
u++;
v++;
add(u,v,w);
add(v,u,w);
}
if(k == 0) work1();
else work2();
}
int main() {
init();
}