分析:不断更新最大值,找出一个正环,使f[s]>cur.
把每种货币看成一个顶点,构图,spfa.
#include <iostream>
#include <cstring>
#include <cstdio>
#define MAXN 3000
#define MAXM 3000
using namespace std;
struct Edge {
int to, next;
double rate, len;
} edge[MAXM * 2];
int en, head[MAXN];
inline void add_edge(int u, int v, double len, double rate) {
edge[en].to = v, edge[en].len = len, edge[en].rate=rate, edge[en].next = head[u], head[u] = en++;
}
int n,m,s;
int q[1000000];
bool vis[3000];
double f[3000];
double cur;
bool spfa()
{
int h,t,i;
memset(vis,false,sizeof(vis));
memset(f,0,sizeof(f));
h=1;t=1;q[1]=s;vis[s]=true;f[s]=cur;
while (h<=t)
{
i=q[h];vis[i]=false;
for (int j=head[i];j!=-1;j=edge[j].next)
{
int to=edge[j].to;
double rate=edge[j].rate, len=edge[j].len;
if (f[to]<((f[i]-len)*rate))
{
f[to]=(f[i]-len)*rate;
if (!vis[to])
{
t++;
q[t]=to;
vis[to]=true;
}
if (f[s]>cur) return true;//返回true
}
}
h++;
}
return false;
}
int main()
{
int u,v;
double ra1,ra2,le1,le2;
while (scanf("%d%d%d%lf",&n,&m,&s,&cur)!=EOF)
{
fill(head+1, head+n+1,-1);
en=0;
for (int i=1;i<=m;i++)
{
scanf("%d%d%lf%lf%lf%lf",&u,&v,&ra1,&le1,&ra2,&le2);
add_edge(u,v,le1,ra1);
add_edge(v,u,le2,ra2);
}
if (spfa()) printf("YES\n");
else printf("NO\n");
}
}