差分约束。
有
uu−vv≥ww
,即
vv≤uu−ww
,我们便联想到松弛操作(松弛操作是在满足小于的情况交换,力求达到大于等于),从uu向vv建一条值为-ww的边。
#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
struct Edge{
int too, nxt, val;
}edge[30005];
int n, m, hea[10005], cnt, tt, uu, vv, ww, dis[10005];
bool vis[10005];
void add_edge(int fro, int too, int val){
edge[++cnt].nxt = hea[fro];
edge[cnt].too = too;
edge[cnt].val = val;
hea[fro] = cnt;
}
bool ser(int u){
vis[u] = true;
for(int i=hea[u]; i; i=edge[i].nxt){
int t=edge[i].too;
if(dis[t]>dis[u]+edge[i].val){
dis[t] = dis[u] + edge[i].val;
if(vis[t]) return false;
else if(!ser(t)) return false;
}
}
vis[u] = false;
return true;
}
int main(){
cin>>n>>m;
for(int i=1; i<=m; i++){
scanf("%d", &tt);
if(tt==1){
scanf("%d %d %d", &uu, &vv, &ww);
add_edge(uu, vv, -ww);
}
if(tt==2){
scanf("%d %d %d", &uu, &vv, &ww);
add_edge(vv, uu, ww);
}
if(tt==3){
scanf("%d %d", &uu, &vv);
add_edge(uu, vv, 0);
add_edge(vv, uu, 0);
}
}
for(int i=1; i<=n; i++)
add_edge(0, i, 0);
memset(dis, 0x3f, sizeof(dis));
dis[0] = 0;
if(ser(0)) printf("Yes");
else printf("No");
return 0;
}