分析
看了半天才看出来,其实就是虫洞建个单向负边,其他的双向正边,然后判断是否有负环即可
code
#include<bits/stdc++.h>
using namespace std;
#define loop(i,start,end) for(register int i=start;i<=end;++i)
#define clean(arry,num); memset(arry,num,sizeof(arry));
const int maxn=500+10;
const int maxm=3000+10;
int n,m,w;
int T;
int cnt=0;
struct node
{
int e;int w;int nxt;
}e[maxm<<1];
int head[maxn];
int vis[maxn];
int dis[maxn];
inline int read()
{
int ans=0;bool neg=false;char r=getchar();
while(r>'9'||r<'0'){if(r=='-')neg=true;r=getchar();}
while(r>='0'&&r<='9'){ans=ans*10+r-'0';r=getchar();}
return (neg)?-ans:ans;
}
inline void addl(int u,int v,int w)
{
e[cnt].e=v;
e[cnt].w=w;
e[cnt].nxt=head[u];
head[u]=cnt;
++cnt;
}
inline void spfa()
{
clean(vis,0);
clean(dis,0x3f);
queue<int>q;
q.push(1);
vis[1]++;
dis[1]=0;
while(q.empty()==false)
{
int f=q.front();q.pop();
for(int i=head[f];i!=-1;i=e[i].nxt)
{
int v=e[i].e;
if(dis[v]>dis[f]+e[i].w)
{
dis[v]=dis[f]+e[i].w;
q.push(v);
vis[v]++;
if(vis[v]>n)
{
printf("YES\n");
return;
}
}
}
}
printf("NO\n");
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("datain.txt","r",stdin);
#endif
T=read();
while(T--)
{
cnt=0;
clean(head,-1);
n=read(),m=read(),w=read();
loop(i,1,m)
{
int s,e,t;
s=read(),e=read(),t=read();
addl(s,e,t);
addl(e,s,t);
}
loop(i,1,w)
{
int s,e,t;
s=read(),e=read(),t=read();
addl(s,e,-t);
}
spfa();
}
return 0;
}