Magical Girl Haze

https://nanti.jisuanke.com/t/A1958 

总结：分层图最短路；

#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

/*----------------------------------------------------------
const int BufferSize = 1 << 16;
char buffer[BufferSize], *head, *tail;
inline char Getchar() {
    if (head == tail) {
        int l = fread(buffer, 1, BufferSize, stdin);
        tail = (head = buffer) + l;
    }
    return *head++;
 }
inline ll read() {
    ll x = 0, f = 1;char c = Getchar();
    for (;!isdigit(c);c = Getchar()) if (c == '-') f = -1;
    for (;isdigit(c);c = Getchar()) x = x * 10 + c - '0';
    return x * f;
 }
//----------------------------------------------------------
*/

const int maxn=3e6+9;
const int mod=1e9+7;

ll d[maxn];
bool vis[maxn];
int head[maxn];
int tot;
int n,m,k;
struct E
{
    int to,cost,nex;
}edge[maxn*2];
struct node
{
    int to,cost;
    node(){}
    node(int _to,int _cost)
    {
        to=_to;
        cost=_cost;
    }
    bool operator < (const node &b) const
    {
        return cost>b.cost;
    }
};

void addedge(int u,int v,int w)
{
    edge[tot].to=v;
    edge[tot].cost=w;
    edge[tot].nex=head[u];
    head[u]=tot++;
}
void init()
{
    mem(head,-1);
    tot=0;
}
void dj(int s)
{
    priority_queue<node>q;
    mem(d,INF);
    mem(vis,0);

    d[s]=0;

    q.push(node(s,0));
    while(!q.empty())
    {
        node tmp=q.top();
        q.pop();
        int u=tmp.to;
        int cost=tmp.cost;
        if(vis[u]) continue;
        vis[u]=1;

        for(int i=head[u];i!=-1;i=edge[i].nex)
        {
            int v=edge[i].to;
            int w=edge[i].cost;
            if(d[v]>d[u]+w)
            {
                d[v]=d[u]+w;
                q.push(node(v,d[v]));
            }

        }
    }
}
int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);

    int T;
    sfi(T);
    while(T--)
    {
        init();
        scanf("%d%d%d",&n,&m,&k);
        for(int i=0;i<m;i++)
        {
            int u,v,w;
            scanf("%d%d%d",&u,&v,&w);
            for(int j=0;j<=k;j++)
            {
                addedge(u+j*n,v+j*n,w);
                if(j!=k) addedge(u+j*n,v+(j+1)*n,0);
            }
        }
        dj(1);
        ll ans=INF;
        for(int i=0;i<=k;i++) ans=min(ans,d[n+i*n]);
        printf("%lld\n",ans);
    }

    return 0;
}