10090. 「一本通 3.4 练习 2」布局 Layout

(Updated: )
oi
, ,

题意

有些奶牛是好基友，它们希望彼此之间的距离小于等于某个数。有些奶牛是情敌，它们希望彼此之间的距离大于等于某个数。

思路

如果两只奶牛是好基友，那么:
$$A-B\leq D$$
如果两只奶牛是情敌，那么:
$$A-B\ge D$$
即:
$$D\leq A-B$$
也就是:
$$B-A\leq -D$$
直接上代码：

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
#include<algorithm>
#include<bitset>
#include<complex>
#include<deque>
#include<exception>
#include<fstream>
#include<functional>
#include<iomanip>
#include<ios>
#include<iosfwd>
#include<iostream>
#include<istream>
#include<iterator>
#include<limits>
#include<list>
#include<locale>
#include<map>
#include<memory>
#include<new>
#include<numeric>
#include<ostream>
#include<queue>
#include<set>
#include<sstream>
#include<stack>
#include<stdexcept>
#include<streambuf>
#include<string>
#include<typeinfo>
#include<utility>
#include<valarray>
#include<vector>
#include<cctype>
#include<cerrno>
#include<cfloat>
#include<ciso646>
#include<climits>
#include<clocale>
#include<cmath>
#include<csetjmp>
#include<csignal>
#include<cstdarg>
#include<cstddef>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#define E 300010
#define eps 1e-10
#define ll long long
#pragma GCC optimize(2)
using namespace std;
inline ll read(){
    ll res=0,f=1;char ch=getchar();
    while(ch<'0'ch>'9'){if(ch=='-') f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9') res=res*10+ch-'0',ch=getchar();
    return res*f;
}
inline void write(ll x){
    if(x<0) putchar('-'),x=-x;
    if(x<10) putchar(x+'0');
    else{
        write(x/10);
        putchar(x%10+'0');
    }
}
//queue<ll> q;
//set<ll> s;
//priority_queue<ll> q1;
//priority_queue<ll,vector<ll>,greater<ll> > q2;
//list<ll> l;
//stack<ll> s;
ll n,k;
ll fir[E],nxt[E],son[E],w[E],tot,inf,ans;
inline void add(register ll x,register ll y,register ll z){
    ++tot;
    w[tot]=z;
    nxt[tot]=fir[x];
    fir[x]=tot;
    son[tot]=y;
}
ll dis[E],vis[E],tt[E];
deque<ll> q;
inline void spfa(int s){
    memset(dis,63,sizeof(dis));
    memset(tt,0,sizeof(tt));
    memset(vis,0,sizeof(vis));inf=dis[0];
    dis[s]=0;vis[s]=1;
    while(!q.empty()) q.pop_front();
    q.push_back(s);
    while(!q.empty()){
        register ll u=q.front();q.pop_front();
        vis[u]=0;
        for(register ll i=fir[u];i;i=nxt[i]){
            register ll to=son[i];
            if(dis[to]>dis[u]+w[i]){
                tt[to]++;
                dis[to]=dis[u]+w[i];
                if(tt[to]>n+1){
                    puts("-1");
                    exit(0);
                }
                if(!vis[to]){
                    vis[to]=1;
                    if(!q.empty()&&dis[to]<dis[q.front()]) q.push_front(to);
                    else q.push_back(to);
                }
            }
        }
    }
}
int k1,k2;
int main(){
    n=read();k1=read();k2=read();
    for(register ll i=1;i<=k1;i++){
        ll x=read(),y=read(),z=read();
        add(x,y,z);
    }
    for(register ll i=1;i<=k2;i++){
        ll x=read(),y=read(),z=read();
        add(y,x,-z);
    }
    spfa(1);
    ans=dis[n];
    for(int i=1;i<=n;i++) spfa(i);
    if(ans>=inf) puts("-2");
    else write(ans),putchar('\n');
    return 0;
}