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
| #include <cstdio>
#include <vector>
#include <cstring>
#include <queue>
using namespace std;
const int MAXV = 2005;
const int INF = 1<<30;
struct Edge{ int to, cap, rev; };
std::vector<Edge> G[MAXV];
int level[MAXV];
int iter[MAXV];
void addedge(int from, int to, int cap) {
G[from].push_back(Edge{to, cap, G[to].size()});
G[to].push_back(Edge{from, 0, G[from].size()-1});
}
void bfs(int s) {
memset(level, -1, sizeof level);
std::queue<int> que;
level[s] = 0;
que.push(s);
while (!que.empty()) {
int v = que.front(); que.pop();
for (int i = 0; i < G[v].size(); ++i) {
Edge &e = G[v][i];
if (e.cap > 0 && level[e.to] < 0) {
level[e.to] = level[v] + 1;
que.push(e.to);
}
}
}
}
int dfs(int v, int t, int f) {
if (v == t) return f;
for (int &i = iter[v]; i < G[v].size(); ++i) {
Edge &e = G[v][i];
if (e.cap > 0 && level[v] < level[e.to]) {
int d = dfs(e.to, t, std::min(f, e.cap));
if (d > 0) {
e.cap -= d;
G[e.to][e.rev].cap += d;
return d;
}
}
}
return 0;
}
int maxflow(int s, int t) {
int flow = 0;
for (; ;) {
bfs(s);
if (level[t] < 0) return flow;
memset(iter, 0, sizeof iter);
int f;
while ((f = dfs(s, t, INF)) > 0) {
flow += f;
}
}
return flow;
}
int main()
{
int n,p,c,t;
while(~scanf("%d%d%d%d",&n,&p,&c,&t))
{
for(int i=0;i<=n+1;++i)
{
G[i].clear();
}
for(int i=0;i<t;++i)
{
int u,v,val;
scanf(" (%d,%d)%d",&u,&v,&val);
addedge(u,v,val);
}
for(int i=0;i<p;++i)
{
int u,val;
scanf(" (%d)%d",&u,&val);
addedge(n,u,val);
}
for(int i=0;i<c;++i)
{
int u,val;
scanf(" (%d)%d",&u,&val);
addedge(u,n+1,val);
}
int res=maxflow(n,n+1);
printf("%d\n",res);
}
return 0;
}
|