zoukankan      html  css  js  c++  java
  • SPFA

    Like everyone else, cows like to stand close to their friends when queuing for feed. FJ has N (2 <= N <= 1,000) cows numbered 1..N standing along a straight line waiting for feed. The cows are standing in the same order as they are numbered, and since they can be rather pushy, it is possible that two or more cows can line up at exactly the same location (that is, if we think of each cow as being located at some coordinate on a number line, then it is possible for two or more cows to share the same coordinate). 

    Some cows like each other and want to be within a certain distance of each other in line. Some really dislike each other and want to be separated by at least a certain distance. A list of ML (1 <= ML <= 10,000) constraints describes which cows like each other and the maximum distance by which they may be separated; a subsequent list of MD constraints (1 <= MD <= 10,000) tells which cows dislike each other and the minimum distance by which they must be separated. 

    Your job is to compute, if possible, the maximum possible distance between cow 1 and cow N that satisfies the distance constraints.

    Input

    Line 1: Three space-separated integers: N, ML, and MD. 

    Lines 2..ML+1: Each line contains three space-separated positive integers: A, B, and D, with 1 <= A < B <= N. Cows A and B must be at most D (1 <= D <= 1,000,000) apart.

    Lines ML+2..ML+MD+1: Each line contains three space-separated positive integers: A, B, and D, with 1 <= A < B <= N. Cows A and B must be at least D (1 <= D <= 1,000,000) apart.

    Output

    Line 1: A single integer. If no line-up is possible, output -1. If cows 1 and N can be arbitrarily far apart, output -2. Otherwise output the greatest possible distance between cows 1 and N.

    Sample Input

    4 2 1
    1 3 10
    2 4 20
    2 3 3

    Sample Output

    27

    Hint

    Explanation of the sample: 

    There are 4 cows. Cows #1 and #3 must be no more than 10 units apart, cows #2 and #4 must be no more than 20 units apart, and cows #2 and #3 dislike each other and must be no fewer than 3 units apart. 

    The best layout, in terms of coordinates on a number line, is to put cow #1 at 0, cow #2 at 7, cow #3 at 10, and cow #4 at 27.
    #include <stdio.h>
    #include <queue>
    using namespace std;
    const int INF=0x3f3f3f3f;
    const int N=1100;
    const int M=45000;
    struct Node
    {
        int v,next,w;
    }e[M];
    bool vis[N];
    int n,ma,mb,h[N],dis[N],did[N],cnt=1;
    void Add(int u,int v,int w)
    {
        e[cnt]=Node{v,h[u],w};
        h[u]=cnt++;
    }
    bool SPFA()
    {
        for(int i=1;i<=n;i++)
            dis[i]=INF,did[i]=0,vis[i]=0;
        dis[1]=0;
        queue<int>Q;
        Q.push(1);
        while(!Q.empty())
        {
            int u=Q.front();Q.pop();
            vis[u]=0;
            if(did[u]>=n)return 0;
            for(int i=h[u];i;i=e[i].next)
            {
                int v=e[i].v,w=e[i].w;
                if(dis[v]>dis[u]+w)
                {
                    dis[v]=dis[u]+w;
                    if(!vis[v])
                    {
                        vis[v]=1;
                        Q.push(v);
                        did[v]++;
                    }
                }
    
            }
        }
        return 1;
    }
    int main()
    {
        scanf("%d%d%d",&n,&ma,&mb);
        for(int i=1;i<=ma;i++)
        {
            int a,b,c;
            scanf("%d%d%d",&a,&b,&c);
            Add(a,b,c);
        }
        for(int i=1;i<=mb;i++)
        {
            int a,b,c;
            scanf("%d%d%d",&a,&b,&c);
            Add(b,a,-c);
        }
        if(!SPFA())printf("-1
    ");
        else printf("%d
    ",dis[n]==INF?-2:dis[n]);
        return 0;
    }
  • 相关阅读:
    csp2020游记
    agc006_f Blackout
    CF1368G Shifting Dominoes
    AtCoder Grand Contest 009 简要题解
    Codeforces Round #666 (Div. 1)
    CSP 2019 树的重心
    Luogu-P4859 已经没什么好害怕的了
    2020.9.17 校内测试
    CF379F New Year Tree
    图论(小结论)
  • 原文地址:https://www.cnblogs.com/BobHuang/p/7375051.html
Copyright © 2011-2022 走看看