“ Ctrl AC!一起 AC!”
链式前向星似乎比vector邻接表好用 qwq
题目:P3385 【模板】负环
思路:SPFA模板,然后用链式前向星邻接表
代码:
#include<iostream>
#include<queue>
#include<cstring>
using namespace std;
const int MAXN = 2010;
const int MAXM = 3010;
const int INF = 0x3f3f3f3f;
int n, m;
int en = -1, eh[MAXN];
struct edge {
int u, v, w, next;
}e[MAXM<<1];
void add(int u, int v, int w) {
e[++en] = { u,v,w,eh[u] } ; eh[u] = en;
}
void input() {
cin >> n >> m;
en = -1;
memset(eh, -1, sizeof(eh));
while (m--) {
int u, v, w; cin >> u >> v >> w;
add(u, v, w);
if (w >= 0) add(v, u, w);
}
}
int dis[MAXN], cnt[MAXN];
bool vis[MAXN];
void spfa() {
fill(dis + 1, dis + n + 1, INF);
memset(cnt, 0, sizeof(cnt));
memset(vis, 0, sizeof(vis));
queue<int> q;
dis[1] = 0; vis[1] = 1; q.push(1);
while (!q.empty()) {
int u = q.front(); vis[u] = 0; q.pop();
for (int i = eh[u]; i != -1;i=e[i].next) {
int v = e[i].v, w = e[i].w;
if (dis[u] + w < dis[v]) {
dis[v] = dis[u] + w;
if (!vis[v]) {
cnt[v]++;
if (cnt[v] >= n) {
cout << "YES" << endl; return;
}
vis[v] = 1;
q.push(v);
}
}
}
}
cout << "NO" << endl;
}
int main() {
int t; cin >> t;
while (t--) {
input();
spfa();
}
return 0;
}
感谢阅读!!!
“ Ctrl AC!一起 AC!”