Acwing笔记 存在负权边Bellman-Ford算法板子

acwing853

 样例输入

3 3 1

1 2 1

2 3 1

1 3 3

样例输入

3

#define _CRT_SECURE_NO_WARNINGS 1
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;

const int N = 510, M = 10010;

int n, m, k;
int dist[N], backup[N];

struct Edge 
{
	int a, b, w;
}edges[M];

int bellman_ford()
{
	memset(dist, 0x3f, sizeof dist);
	dist[1] = 0;

	for (int i = 0; i < k; i++)
	{
		memcpy(backup, dist, sizeof dist);	//防止串联
		for (int j = 0; j < m; j++)
		{
			int a = edges[j].a, b = edges[j].b, w = edges[j].w;
			dist[b] = min(dist[b], backup[a] + w);
		}
	}

	if (dist[n] > 0x3f3f3f3f / 2)return -1;	//防止小更新
	return dist[n];
}

int main()
{
	scanf("%d%d%d", &n, &m, &k);

	for (int i = 0; i < m; i++)
	{
		int a, b, w;
		scanf("%d%d%d", &a, &b, &w);
		edges[i] = { a,b,w };
	}

	int t = bellman_ford();

	if (t == -1)puts("impossible");
	else printf("%d\n", t);

	return 0;
}