[题]最小花费 —— YbtOJ-高效进阶2021-「图论」第3章 最短路径-E

这道题……开多一维来记录使用过的免费次数就好啦！
最小花费

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
const int N = 1e5 + 10, M = 2e5 + 10;
typedef long long ll;

struct E{ ll d; int to, cnt;};//到当前节点(的最小花费),且以及用了cnt次的花费是多少 

int  n, m, k, s, T;
ll dist[N][11], sum;
bool st[N][11];//不太确定要不要？从原点开始往外发散,小的边会优先被遍历, 

int ne[M], h[N], e[M], idx; ll w[M];
void add(int a, int b, ll c){ e[idx] = b, ne[idx] = h[a], w[idx] = c, h[a] = idx ++; }

bool operator > (E a, E b) { return a.d > b.d; }

void djs(int s){
    dist[s][0] = 0;
    priority_queue < E, vector<E>, greater<E> > q;
    q.push({0, s, 0}); 
    while(q.size()){
        E t = q.top(); q.pop();
        int ver = t.to, cnt = t.cnt; ll d = t.d;
        if(st[ver][cnt]) continue; 
		st[ver][cnt] = 1;//根据优先级,应该可以确定先到的是最小 
		//尝试进行更新,被更新的入队(有可能会更新其它点). 
        for(int i = h[ver]; i != -1; i = ne[i]){
            int j = e[i];
            if(dist[j][cnt + 1] > d && cnt < k) {//用k 
                dist[j][cnt + 1] = d;
                q.push({d, j, cnt + 1});
            }
            if(dist[j][cnt] > d + w[i]) {//不用k 
            	dist[j][cnt] = d + w[i];
            	q.push({dist[j][cnt], j, cnt});
            }
        }
    }
}

int main(){
    memset(h, -1, sizeof h);
    memset(dist , 0x3f, sizeof dist);
    scanf("%d%d%d%d%d", &n, &m, &k, &s, &T); 
    for(int i = 1; i <= m; i ++){
        int a, b; ll c;
        scanf("%d%d%lld", &a, &b, &c);
        add(a, b, c); add(b, a, c);//双向的 
    }
    djs(s);
    ll minn = 0x3f3f3f3f3f3f3f3f;
	for(int i = 0; i <= k; i ++) 
		minn = min(minn, dist[T][i]);
	printf("%d", minn);
    return 0;
}