点这里 |
---|
题意: 给定一个带权混合图,有n个点,m条权值为正的无向边,w条权值为负的有项边。判断是否存在负圈。
题解: 唯一要注意的就是既有无向边,也有有向边;以及有向边的权值是负的(输入的是正数,但代表的是负数)。剩下的几乎不用改模板,可直接参考SPFA算法。
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
const int N = 505;
const int inf = 0x3f3f3f3f;
int F, n, m, k;
int u, v, w, cnt;
int dis[N];
int head[N];
struct edge{ int to, w, next;} e[6000];
void addedge(int u, int v, int w){ e[cnt].to = v, e[cnt].w = w, e[cnt].next = head[u]; head[u] = cnt++;}
void doubleadd(int u, int v, int w){ addedge(u, v, w); addedge(v, u, w);}
void spfa(){
int neg[N] = {0}, inq[N] = {0};
for(int i = 1; i <= n; i++) dis[i] = inf;
inq[1] = neg[1] = 1, dis[1] = 0;
queue<int> q;
q.push(1);
while(!q.empty()){
int u = q.front(); q.pop();
inq[u] = 0;
for(int i = head[u]; ~i; i = e[i].next){
int v = e[i].to, w = e[i].w;
if(dis[v] > dis[u] + w){
dis[v] = dis[u] + w;
if(!inq[v]){
inq[v] = 1;
q.push(v);
neg[v]++;
if(neg[v] > n){ printf("YES\n");return;}
}
}
}
}
printf("NO\n");
}
int main(){
scanf("%d", &F);
while(F--){
scanf("%d%d%d", &n, &m, &k);
for(int i = 0; i < N; i++) head[i] = e[i].next = -1; cnt = 0;
while(m--){
scanf("%d%d%d", &u, &v, &w);
doubleadd(u, v, w);
}
while(k--){
scanf("%d%d%d", &u, &v, &w);
addedge(u, v, -w);
}
spfa();
}
return 0;
}