POJ 3169 Layout 差分约束

最新推荐文章于 2020-02-07 22:32:37 发布

芋智波佐助

最新推荐文章于 2020-02-07 22:32:37 发布

阅读量268

点赞数

分类专栏：查分约束

本文链接：https://blog.csdn.net/u011686226/article/details/51938967

版权

查分约束专栏收录该内容

4 篇文章 0 订阅

订阅专栏

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn = 1010;
const int maxm = 100010;
int al[maxn], bl[maxn], dl[maxn];
int ad[maxn], bd[maxn], dd[maxn];
int d[maxn];
int main()
{
	int n, m1, m2;
	scanf("%d %d %d", &n, &m1, &m2);
	for(int i = 1; i <= m1; i++)
	{
        scanf("%d %d %d", &al[i], &bl[i], &dl[i]);
	}
	for(int i = 1; i <= m2; i++)
	{
        scanf("%d %d %d", &ad[i], &bd[i], &dd[i]);
	}
    for(int i = 1; i <= n; i++)
        d[i] = 999999999;
    d[1] = 0;
    for(int i = 0; i < n; i++)
    {
        for(int j = 1; j < n; j++)
        {
            if(d[j+1] < 999999999)
            {
                d[j] = min(d[j], d[j+1]);
            }
        }
        for(int j = 1; j <= m1; j++)
        {
            if(d[al[j]] < 999999999)
            {
                d[bl[j]] = min(d[bl[j]], d[al[j]]+dl[j]);
            }
        }
        for(int j = 1; j <= m2; j++)
        {
            if(d[bd[j]] < 999999999)
            {
                d[ad[j]] = min(d[ad[j]], d[bd[j]]-dd[j]);
            }
        }
    }
    int ans = d[n];
    if(d[1] < 0)
    {
        ans = -1;
    }
    else if(ans == 999999999)
    {
        ans = -2;
    }
    printf("%d\n", ans);
	return 0;
}