84pts求条WA on #6 #14

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

int n, ml, md;

vector<pair<int, int> > e[10001];
int dis[10001], cnt[10001];
bool vis[10001];
queue<int> q;

signed main() {
	cin >> n >> ml >> md;
	while (ml--) {
		int a, b, d;
		cin >> a >> b >> d;
		//p_b - p_a <= d
		e[a].push_back({b, d});
	}
	while (md--) {
		int a, b, d;
		cin >> a >> b >> d;
		e[b].push_back({a, -d});
	}
	for (int i = 2; i <= n; i++) {
		e[i + 1].push_back({i, 0});
	}
	for (int i = 1; i <= n; i++) {
		e[0].push_back({i, 0});
	}
	memset(dis, 0x3f, sizeof (dis));
	bool f = true;
	q.push(0);
	dis[0] = 0;
	vis[0] = true;
	while (f && !q.empty()) {
		int u = q.front();
		q.pop();
		vis[u] = false;
		for (auto [v, w] : e[u]) {
			if (dis[v] > dis[u] + w) {
				dis[v] = dis[u] + w;
				if (++cnt[v] > n) {
					cout << -1;
					f = false;
					break;
				}
				if (!vis[v]) {
					q.push(v);
					vis[v] = true;
				}
			}
		}
	}
	if (f) {
		if (dis[n] == 0x3f3f3f3f) {
			cout << "-2";
		} else {
			while (!q.empty()) {
				q.pop();
			}
			memset(vis, false, sizeof (vis));
			memset(dis, 0x3f, sizeof (dis));
			memset(cnt, 0, sizeof (cnt));
			q.push(1);
			dis[1] = 0;
			vis[1] = true;
			bool f2 = true;
			while (f2 && !q.empty()) {
				int u = q.front();
				q.pop();
				vis[u] = false;
				for (auto [v, w] : e[u]) {
					if (dis[v] > dis[u] + w) {
						dis[v] = dis[u] + w;
						if (++cnt[v] > n) {
							cout << -1;
							f2 = false;
							break;
						}
						if (!vis[v]) {
							q.push(v);
							vis[v] = true;
						}
					}
				}
			}
			if (f2) {
				cout << dis[n];
			}
		}
	}
	return 0;
}