P1938 [USACO09NOV]Job Hunt S（最长路+判断负环）

P1938 [USACO09NOV]Job Hunt Shttps://www.luogu.com.cn/problem/P1938

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <cmath>
#include <map>
#include <cstdlib>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 1000010;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)
#define lowbit(x) ((x)&(-x))


int head[MAXN];
int ver[MAXN];
int cost[MAXN];
int nxt[MAXN];
int cnt;
bool vis[MAXN];
int d[MAXN];
int rec[MAXN];
inline void add(int x, int y, int c) {
	ver[++cnt] = y;
	cost[cnt] = c;
	nxt[cnt] = head[x];
	head[x] = cnt;
}

int D, P, C, F, S;

inline void spfa(int s) {
	queue<int> que;
	que.push(s);
	d[s] = 0;
	rec[s]++;
	vis[1] = true;
	while (!que.empty()) {
		int x = que.front();
		que.pop();
		vis[x] = false;
		//rec[x]++;
		for (int i = head[x]; i; i = nxt[i]) {
			int y = ver[i], c = cost[i];
			//printf("%d %d %d\n", x, y, c);
			if (d[y] > d[x] + c) {
				rec[y]=rec[x]+1;
				if(rec[y]>C){
					printf("-1");
					return ;
				}
				d[y] = d[x] + c;
				if (!vis[y]) {
					que.push(y);
					vis[y]=true;
				}
			}
		}
	}
	int mxx = 0;
	for (int i = 1; i <= C; i++) {
		mxx = max(mxx, -d[i]);
	}
	printf("%d", mxx + D);
}


int main() {
	memset(d, INF, sizeof(d));
	int x, y, c;
	scanf("%d %d %d %d %d", &D, &P, &C, &F, &S);
	for (int i = 1; i <= P; i++) {
		scanf("%d %d", &x, &y);
		add(x, y, -D);
	}
	for (int i = 1; i <= F; i++) {
		scanf("%d %d %d", &x, &y, &c);
		add(x, y, c - D);
	}
	spfa(S);
	return 0;
}