http://poj.org/problem?id=3169
n m1 m2 (n头牛,前m1行输入表示a,b两头牛的距离最远不超过c,后m2行表示a,b两头牛的距离不小于c)
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
#define M 1005
#define INF 0xfffffff
using namespace std;
int n,m1,m2;
int head[M],tot;
int que[M*M],d[M];
int time[M];
bool inq[M];
struct node
{
int to,v,next;
}edge[M*M];
void add(int a,int b,int c)
{
edge[tot].to=b; edge[tot].v=c;
edge[tot].next=head[a]; head[a]=tot++;
}
bool SPFA()
{
int i,p;
int l=0,r=0;
for(i=1;i<=n;i++)
{
inq[i]=false;
d[i]=INF;
time[i]=0;
}
d[1]=0;
time[1]=1;
que[r++]=1;
inq[1]=true;
while(l<r)
{
p=que[l];
l=(l+1)%M;
inq[p]=false;
for(i=head[p];i!=-1;i=edge[i].next)
{
int u=edge[i].to;
if(d[u]>d[p]+edge[i].v)
{
d[u]=d[p]+edge[i].v;
if(!inq[u])
{
inq[u]=true;
que[r]=u;
r=(r+1)%M;
time[u]++;
if(time[u]>=n) return false;
}
}
}
}
return true;
}
int main()
{
int i;
while(scanf("%d%d%d",&n,&m1,&m2)!=EOF)
{
tot=0;
for(i=1;i<=n;i++)
head[i]=-1;
while(m1--)
{
int a,b,c;
if(a>b) swap(a,b);
scanf("%d%d%d",&a,&b,&c);
add(a,b,c);
}
while(m2--)
{
int a,b,c;
if(a>b) swap(a,b);
scanf("%d%d%d",&a,&b,&c);
add(b,a,-c);
}
if(SPFA())
{
if(d[n]==INF)
printf("-2\n");
else printf("%d\n",d[n]);
}
else printf("-1\n");
}
return 0;
}