题目描述
Farmer John dutifully checks on the cows every day. He traverses some of the M (1 <= M <= 50,000) trails conveniently numbered 1..M from pasture 1 all the way out to pasture N (a journey which is always possible for trail maps given in the test data). The N (1 <= N <= 10,000) pastures conveniently numbered 1..N on Farmer John's farm are currently connected by bidirectional dirt trails. Each trail i connects pastures P1_i and P2_i (1 <= P1_i <= N; 1 <= P2_i <= N) and requires T_i (1 <= T_i <= 1,000,000) units of time to traverse.
He wants to revamp some of the trails on his farm to save time on his long journey. Specifically, he will choose K (1 <= K <= 20) trails to turn into highways, which will effectively reduce the trail's traversal time to 0. Help FJ decide which trails to revamp to minimize the resulting time of getting from pasture 1 to N.
TIME LIMIT: 2 seconds
约翰一共有N)个牧场.由M条布满尘埃的小径连接.小径可 以双向通行.每天早上约翰从牧场1出发到牧场N去给奶牛检查身体.
通过每条小径都需要消耗一定的时间.约翰打算升级其中K条小径，使之成为高 速公路.在高速公路上的通行几乎是瞬间完成的，所以高速公路的通行时间为0.
请帮助约翰决定对哪些小径进行升级，使他每天早上到牧场W花的时间最少.输出这个最少 的时间.
输入输出格式
输入格式：-
Line 1: Three space-separated integers: N, M, and K
- Lines 2..M+1: Line i+1 describes trail i with three space-separated integers: P1_i, P2_i, and T_i
- Line 1: The length of the shortest path after revamping no more than K edges
输入输出样例
4 4 1 1 2 10 2 4 10 1 3 1 3 4 100
1
说明
K is 1; revamp trail 3->4 to take time 0 instead of 100. The new shortest path is 1->3->4, total traversal time now 1.
建立分层图。
f[u][t]表示在节点u时已经免费乘坐t次的最少花
费。照样跑最短路。
枚举与u相连的所有节点v,w(u,v)表示权值。
若t<k:
f[v][t+1]=min(f[v][t+1],f[u][t])
对于所有:
f[v][t]=min(f[v][t],f[u][t]+w(u,v))
不过这题数据大一些，要用优先队列优化SPFA
1 #include<iostream> 2 #include<cstdio> 3 #include<cstring> 4 #include<algorithm> 5 #include<queue> 6 using namespace std; 7 struct Node 8 { 9 int next,to,dis; 10 }edge[100001]; 11 struct XXX 12 { 13 int dis,x,k; 14 friend bool operator<(XXX a,XXX b) 15 {return a.dis>b.dis;} 16 }; 17 int num,head[100001]; 18 int dist[100001][21]; 19 int n,m,k,S,T; 20 int ans; 21 bool vis[100001][21]; 22 void add(int u,int v,int d) 23 { 24 num++; 25 edge[num].next=head[u]; 26 head[u]=num; 27 edge[num].to=v; 28 edge[num].dis=d; 29 } 30 void SPFA() 31 {int i; 32 priority_queue<XXX>Q; 33 Q.push((XXX){0,S,0}); 34 dist[S][0]=0; 35 while (Q.empty()==0) 36 { 37 XXX u=Q.top(); 38 Q.pop(); 39 for (i=head[u.x];i;i=edge[i].next) 40 {int v=edge[i].to; 41 if (dist[v][u.k]>dist[u.x][u.k]+edge[i].dis) 42 { 43 dist[v][u.k]=dist[u.x][u.k]+edge[i].dis; 44 Q.push((XXX){dist[v][u.k],v,u.k}); 45 } 46 if (u.k+1<=k&&dist[v][u.k+1]>dist[u.x][u.k]) 47 { 48 dist[v][u.k+1]=dist[u.x][u.k]; 49 Q.push((XXX){dist[v][u.k+1],v,u.k+1}); 50 } 51 } 52 } 53 } 54 int main() 55 {int i,u,v,c; 56 cin>>n>>m>>k; 57 memset(dist,127/2,sizeof(dist)); 58 S=1;T=n; 59 for (i=1;i<=m;i++) 60 { 61 scanf("%d%d%d",&u,&v,&c); 62 add(u,v,c); 63 add(v,u,c); 64 } 65 SPFA(); 66 cout<<dist[n][k]; 67 }