O - Layout POJ - 3169
思路: 限制条件 : 最大距离不超过w d[v] - d[u] <= w; 最小距离超过w d[v] - d[u] >= w;
移项得 d[v] <= d[u] + w; d[u] <= d[v] + (-w);
即加边为 add(u, v, w); add(v, u, -w)
用 spfa 跑最短路,如果结果为inf, 则距离无限大,如果出现负环,则结果不存在
AC代码
#include<iostream>
#include<cstring>
#include<cstdio>
#include<queue>
#include<algorithm>
using namespace std;
const int maxn = 1010;
const int inf = 1e6+100;
int N, ML, MD;
int num[maxn];
int head[maxn], cnt, dis[maxn];
bool vis[maxn];
struct edge {
int next, to, w;
}e[maxn*maxn];
void add(int u, int v, int w) {
e[++cnt].next = head[u];
e[cnt].to = v;
e[cnt].w = w;
head[u] = cnt;
}
bool spfa(int s) {
for(int i = 1; i <= N; i++) dis[i] = inf;
queue<int> Q;
Q.push(s); vis[s] = 1; dis[s] = 0;
while(Q.size()) {
int now = Q.front(); Q.pop(); vis[now] = 0;
for(int i = head[now]; i; i = e[i].next) {
int to = e[i].to;
if(dis[to] >= dis[now] + e[i].w) {
dis[to] = dis[now] + e[i].w;
if(vis[to]) continue;
vis[to] = 1;
Q.push(to);
if(++num[to] > N) return 0;
}
}
}
return 1;
}
int main() {
// freopen("test.in", "r", stdin);
scanf("%d%d%d", &N, &ML, &MD);
int u, v, w;
for(int i = 1; i <= ML; i++) {
scanf("%d%d%d", &u, &v, &w);
add(u, v, w);
}
for(int i = 1; i <= MD; i++) {
scanf("%d%d%d", &u, &v, &w);
add(v, u, -w);
}
if(spfa(1)) {
if(dis[N] == inf) printf("-2\n");
else printf("%d\n", dis[N]);
}
else { // 有负环
printf("-1\n");
}
return 0;
}