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
| #include <cstdio>
#include <queue>
#include <cstring>
using namespace std;
const int N = 1e5 + 10, M = 6e5 + 10, inf = 2147483647;
int n, m, tot, sum, d[N], cur[N];
int idx = -1, hd[N], nxt[M], edg[M], wt[M];
bool bfs()
{
memset(d, -1, sizeof d);
d[1] = 0;
cur[1] = hd[1];
queue<int> q;
q.push(1);
while (!q.empty())
{
int t = q.front();
q.pop();
for (int i = hd[t]; ~i; i = nxt[i])
if (d[edg[i]] == -1 && wt[i])
{
d[edg[i]] = d[t] + 1;
cur[edg[i]] = hd[edg[i]];
if (edg[i] == n)
return true;
q.push(edg[i]);
}
}
return false;
}
int exploit(int x, int limit)
{
if (x == n)
return limit;
int res = 0;
for (int i = cur[x]; ~i && res < limit; i = nxt[i])
{
cur[x] = i;
if (d[edg[i]] == d[x] + 1 && wt[i])
{
int t = exploit(edg[i], min(limit - res, wt[i]));
if (!t)
d[edg[i]] = -1;
wt[i] -= t;
wt[i ^ 1] += t;
res += t;
}
}
return res;
}
int dinic()
{
int res = 0, flow;
while (bfs())
while (flow = exploit(1, inf))
res += flow;
return res;
}
void add(int a, int b, int c)
{
nxt[++idx] = hd[a];
hd[a] = idx;
edg[idx] = b;
wt[idx] = c;
}
int main()
{
scanf("%d%d", &n, &m);
tot = n;
memset(hd, -1, sizeof hd);
for (int i = 2, a; i < n; i++)
{
scanf("%d", &a);
add(1, i, a);
add(i, 1, 0);
sum += a;
}
for (int i = 2, a; i < n; i++)
{
scanf("%d", &a);
add(i, n, a);
add(n, i, 0);
sum += a;
}
for (int x, y, a, b, c; m; m--)
{
scanf("%d%d%d%d%d", &x, &y, &a, &b, &c);
if (x > y)
swap(x, y);
if (x == 1 && y == n)
{
sum -= c;
continue;
}
if (x == 1)
{
sum += a;
add(1, y, a + c);
add(y, 1, 0);
continue;
}
if (y == n)
{
sum += b;
add(x, n, b + c);
add(n, x, 0);
continue;
}
sum += a + b + c;
add(1, ++tot, a + c);
add(tot, 1, 0);
add(tot, x, inf);
add(x, tot, 0);
add(tot, y, inf);
add(y, tot, 0);
add(++tot, n, b + c);
add(n, tot, 0);
add(x, tot, inf);
add(tot, x, 0);
add(y, tot, inf);
add(tot, y, 0);
}
printf("%d", sum - dinic());
return 0;
}
|