问题
分析
代码
#include<bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const int MXN = 105, MXE = 20010;
int mp[MXN][MXN], l[MXN], c[MXN];
int tot, m, n, k, head[MXN<<1], d[MXN<<1], cur[MXN<<1];
struct Edge{int to, nxt, w;}edge[MXE];
void addEdge(int u, int v, int w){
Edge &e = edge[++tot];
e.to = v, e.nxt = head[u], e.w = w, head[u] = tot;
}
void add(int u, int v, int w){
addEdge(u, v, w), addEdge(v, u, 0);
}
bool bfs(int s, int t){
int lst;
queue<int> q;
memset(d, 0, sizeof d);
q.push(s), d[s] = 1, cur[s] = head[s];
while(!q.empty()){
lst = q.front(), q.pop();
for(int i = head[lst]; ~i; i = edge[i].nxt){
if(edge[i].w && !d[edge[i].to]){
q.push(edge[i].to);
cur[edge[i].to] = head[edge[i].to];
d[edge[i].to] = d[lst]+1;
if(edge[i].to == t) return true;
}
}
}
return false;
}
int dfs(int s, int t, int lim){
if(s == t) return lim;
int rest = lim;
for(int flow, i = cur[s]; ~i && rest; i = edge[i].nxt, cur[s] = i){
if(edge[i].w && d[edge[i].to] == d[s]+1){
flow = dfs(edge[i].to, t, min(edge[i].w, rest));
if(!flow) d[edge[i].to] = 0;
edge[i].w -= flow, edge[i^1].w += flow, rest -= flow;
}
}
return lim - rest;
}
int dinic(){
int flow, maxflow = 0;
while(bfs(m+n+1, m+n+2)) while(flow = dfs(m+n+1, m+n+2, inf)) maxflow += flow;
return maxflow;
}
int main(){
while(scanf("%d%d%d", &m, &n, &k) == 3){
for(int i = 1; i <= m; ++i) scanf("%d", l+i), l[i] = n - l[i];
for(int i = 1; i <= n; ++i) scanf("%d", c+i), c[i] = m - c[i];
memset(mp, 0, sizeof mp);
for(int x, y, i = 1; i <= k; ++i) scanf("%d%d", &x, &y), --l[x], --c[y], mp[x][y] = 1;
int jiong = 0;
for(int i = 1; i <= m && !jiong; ++i) jiong = l[i] < 0 ? 1 : 0;
for(int i = 1; i <= n && !jiong; ++i) jiong = c[i] < 0 ? 1 : 0;
if(jiong) {printf("JIONG!\n"); continue;}
tot = 1, memset(head, -1, sizeof head);
for(int i = 1; i <= m; ++i) for(int j = 1; j <= n; ++j) if(!mp[i][j]) add(i,m+j,1);
for(int i = 1; i <= m; ++i) add(m+n+1, i, l[i]);
for(int i = 1; i <= n; ++i) add(m+i, m+n+2, c[i]);
printf("%d\n", m*n-k-dinic());
}
return 0;
}