1860 判断正环,res[src]=v,其他初始为0;
3259 判断负环,res[src]=0,其他初始为INF=0x1f1f1f;
代码: 1860
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
const int INF=0x1f1f1f;
struct Str
{
int u;
int v;
double ruv;
double cuv;
};
int len;
int n,m,s;
double v;
Str edge[500];
double res[500];
bool bellman(int n,int m,int src)
{
for(int i=1;i<=n;i++)
res[i]=0;
res[src]=v;
for(int i=1;i<=n;i++)
{
for(int j=0;j<m;j++)
{
res[edge[j].v]=max(res[edge[j].v],(res[edge[j].u]-edge[j].cuv)*edge[j].ruv);
}
}
for(int i=1;i<=n;i++)
{
for(int j=0;j<m;j++)
{
if(res[edge[j].v]<(res[edge[j].u]-edge[j].cuv)*edge[j].ruv)
return 1;
}
}
return 0;
}
int main()
{
while(scanf("%d%d%d%lf",&n,&m,&s,&v)!=EOF)
{
len=0;
int u,v;
double rab,cab,rba,cba;
for(int i=0; i<m; i++)
{
scanf("%d%d%lf%lf%lf%lf",&u,&v,&rab,&cab,&rba,&cba);
edge[len].u=u;
edge[len].v=v;
edge[len].ruv=rab;
edge[len++].cuv=cab;
edge[len].u=v;
edge[len].v=u;
edge[len].ruv=rba;
edge[len++].cuv=cba;
}
if(bellman(n,len,s))
printf("YES\n");
else
printf("NO\n");
}
return 0;
}
3259 代码:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
const int INF=0x1f1f1f;
struct Str
{
int u,v,t;
};
int n,m,w;
Str edge[6000];
int res[1000];
bool bellman(int n,int m,int src)
{
memset(res,INF,sizeof(res));
res[src]=0;
for(int i=1; i<=n; i++)
{
for(int j=0; j<m; j++)
{
res[edge[j].v]=min(res[edge[j].v],res[edge[j].u]+edge[j].t);
}
}
for(int i=1; i<=n; i++)
{
for(int j=0; j<m; j++)
{
if(res[edge[j].v]>(res[edge[j].u]+edge[j].t))
return 1;
}
}
return 0;
}
int main()
{
int t;
while(scanf("%d",&t)!=EOF)
{
while(t--)
{
scanf("%d%d%d",&n,&m,&w);
int s,e,t;
for(int i=0; i<m; i++)
{
scanf("%d%d%d",&s,&e,&t);
edge[i].u=s;
edge[i].v=e;
edge[i].t=t;
edge[i+m].u=e;
edge[i+m].v=s;
edge[i+m].t=t;
}
for(int i=0; i<w; i++)
{
scanf("%d%d%d",&s,&e,&t);
edge[i+2*m].u=s;
edge[i+2*m].v=e;
edge[i+2*m].t=-t;
}
if(bellman(n,2*m+w,1))
printf("YES\n");
else
printf("NO\n");
}
}
return 0;
}