题目:http://poj.org/problem?id=3169
题意:n个奶牛一列,两头奶牛之间的距离>=0。然后又ml对奶牛满足
距离<=w,md对奶牛满足距离>=w,求1到n的最大距离
无法找到满足的情况,输出-1
最大距离为INF,输出-2
思路:d[v]-w>=d[u],加入到差分约束,<=w建u,v的正边,>=w建负边,求最短路
代码:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
#include<bitset>
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const int N = 10005;
struct edge
{
int to,nxt,d;
edge(int t = 0,int n = 0,int d = 0):to(t),nxt(n),d(d){}
}E[N*5];
int n,ml,md,flag;
int head[N*5],d[N],cnt[N],tot;
bitset< N<<1 > vis;
void init()
{
memset(head,-1,sizeof(head));
memset(cnt,0,sizeof(cnt));
tot = 0;
flag = 0;
}
void add_edge(int s,int t,int d)
{
E[tot] = edge(t,head[s],d);
head[s] = tot++;
}
void SPFA(int s)
{
memset(d,0x3f,sizeof(d));
vis.reset();
d[s] = 0;
queue<int> q;
q.push(s);
vis[s] = 1;
++cnt[s];
while(!q.empty())
{
int u = q.front();
q.pop();
vis[u] = 0;
for(int i = head[u];~i;i = E[i].nxt)
{
int v = E[i].to;
if(d[v] > d[u]+E[i].d)
{
d[v] = d[u]+E[i].d;
if(!vis[v])
{
vis[v] = 1;
q.push(v);
}
if(++cnt[v] > n)//Óиº»·
{
flag = 1;
return;
}
}
}
}
}
int main()
{
while(~scanf("%d%d%d",&n,&ml,&md))
{
init();
int s = 1,t = n;
int u,v,w;
for(int i = 1;i <= ml;i++)
{
scanf("%d%d%d",&u,&v,&w);
if(u > v) swap(u,v);
add_edge(u,v,w);
}
for(int i = 1;i <= md;i++)
{
scanf("%d%d%d",&u,&v,&w);
if(u < v) swap(u,v);
add_edge(u,v,-w);
}
SPFA(s);
if(flag)
printf("-1\n");
else if(d[t] == INF)
printf("-2\n");
else
printf("%d\n",d[t]);
}
}