# bzoj1579&luogu2939 [USACO09FEB]改造路Revamping Trails

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

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.

#include<cstdio>
#include<queue>
#include<vector>
#define N 11000
#define M 55000
using namespace std;
#define pa pair<int,pair<int,int> >
#define inf 1LL<<60;
int x=0;char ch=getchar();
while (ch<'0'||ch>'9') ch=getchar();
while (ch<='9'&&ch>='0'){x=x*10+ch-'0';ch=getchar();}
return x;
}
struct node{
int y,z,next;
}data[M<<1];
priority_queue<pa,vector<pa>,greater<pa> >q;
long long f[N][22];
int h[N],n,m,k,num;
bool flag[N][22];
inline long long min(long long x,long long y){
return x<y?x:y;
}
void dijkstra(){
for (int i=1;i<=n;++i)
for (int j=0;j<=k;++j) f[i][j]=inf;
q.push(make_pair(0,make_pair(1,0)));f[1][0]=0;
while (!q.empty()){
int x=q.top().second.first,level=q.top().second.second;q.pop();
if(flag[x][level])continue;else flag[x][level]=true;
for (int i=h[x];i;i=data[i].next){
int y=data[i].y,z=data[i].z;
if (f[x][level]+z<f[y][level]){
f[y][level]=f[x][level]+z;
q.push(make_pair(f[y][level],make_pair(y,level)));
}
if (level+1<=k&&f[x][level]<f[y][level+1]){
f[y][level+1]=f[x][level];
q.push(make_pair(f[y][level+1],make_pair(y,level+1)));
}
}
}
}
int main(){
freopen("2939.in","r",stdin);
}