有边数限制的最短路bellman_ford算法

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 510,M = 1e4+10;
int n,m,k;
int dist[N];
int back[N];
struct Edge{
    int a,b,c;
    
}e[M];
void bellman_ford()
{
    memset(dist,0x3f,sizeof dist);
    dist[1] = 0;
    for  (int i=0;i<k;i++)
    {
        memcpy(back,dist,sizeof dist);
        for (int j=0;j<m;j++)
        {
         auto t = e[j];
         dist[t.b] = min(dist[t.b],back[t.a]+t.c);
        }
    }
}
int main()
{
    scanf("%d%d%d", &n, &m,&k);
    for (int i=0;i<m;i++)
    {
        int a,b,c;
        scanf("%d%d%d", &a, &b,&c);
        e[i] = {a,b,c};
    }
    bellman_ford();
    
     if (dist[n] > 0x3f3f3f3f / 2) puts("impossible");
    else printf("%d\n", dist[n]);
    
    return 0;
}