题目链接: http://poj.org/problem?id=3169
思路:差分约束
在队伍中的顺序必须和编号相同,所以对于任意I号奶牛,1<=I<N,在距离上应该满足:dis[I+1] - dis[I] >= 0
对于每个好感的描述(i,j,k),假设i<=j,体现到距离上的要求就是:
dis[j] - dis[I] <= k
对于每个反感的描述(i,j,k),假设i<=j,体现到距离上的要求就是:
dis[j] - dis[I] >= k
这种约束类似于求最短路,因为最短路也是一个约束条件,在判断的时候如果有负环那么就不存在排列方法
代码如下
/*
I am nothing but I must be everything.
*/
#include <map>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>
#include <cstdio>
#include <iomanip>
#include <cstring>
#include <utility>
#include <iostream>
#include <algorithm>
typedef long long ll;
using namespace std;
const ll mod = 1e9 + 7;
const ll maxn = 2005;
typedef pair<ll,ll> p;
ll dis[maxn],sum[maxn];
vector<p> a[maxn];
ll spfa(ll n)
{
memset(dis, 0x3f, (n + 1) * sizeof(dis[1]));
ll mark = dis[1];
bool flag[maxn] = {0};
queue<ll>q;
q.push(1);
flag[1] = 1;
sum[1]++;
dis[1] = 0;
while(!q.empty())
{
ll k = q.front();
q.pop();
flag[k] = 0;
for(int i = 0; i < a[k].size(); i ++)
{
ll v = a[k][i].first;
ll wei = a[k][i].second;
if(dis[v] > dis[k] + wei)
{
dis[v] = dis[k] + wei;
if(!flag[v])
{
q.push(v);
flag[v] = 1;
sum[v]++;
}
if(sum[v] > n)return 0;
}
}
}
if(dis[n] == mark)return -1;
return 1;
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0),cout.tie(0);
ll n,m,k;
cin >> n >> m >> k;
for(int i = 1; i < n; i ++)
{
a[i+1].push_back(make_pair(i,0));
}
for(int i = 1; i <= m; i ++)
{
ll x,y,z;
cin >> x >> y >> z;
if(x > y)
{
swap(x,y);
}
a[x].push_back(make_pair(y,z));
}
for(int i = 1; i <= k; i ++)
{
ll x,y,z;
cin >> x >> y >> z;
if(x > y)
{
swap(x,y);
}
a[y].push_back(make_pair(x,-z));
}
if(spfa(n) == 1)cout << dis[n] << endl;
else if(spfa(n) == -1)cout << -2 << endl;
else if(spfa(n) == 0)cout << -1 << endl;
return 0;
}