bzoj 1458（最小割）

传送门
题解
注意：网络流有时真的玄学，边集数组尽量开大一点，不然就RE
还有，代码别敲太快，不然输入打错一个字符就查了20分钟。。。俺的午觉又没了TAT。。。

#include<bits/stdc++.h>
using namespace std;
const int MAXN=202,INF=0x3f3f3f3f;
int n,m,k;
int s1[MAXN],s2[MAXN],f1[MAXN],f2[MAXN],a[MAXN][MAXN];
int head[MAXN<<1],edge=0,cur[MAXN<<1],dis[MAXN<<1],source,sink,sumv=0;
struct EDGE {
    int v,nxt,r;
}e[400004];
inline int read() {
    int x=0,f=1;char c=getchar();
    while (c<'0'||c>'9') {if (c=='-') f=-1;c=getchar();}
    while (c>='0'&&c<='9') x=x*10+c-'0',c=getchar();
    return x*f;
}
inline void adde(int u,int v,int r1,int r2) {
//  printf("%d %d %d\n",u,v,r1);
    e[edge].nxt=head[u],e[edge].v=v,e[edge].r=r1,head[u]=edge++;
    e[edge].nxt=head[v],e[edge].v=u,e[edge].r=r2,head[v]=edge++;
}
inline bool bfs() {
    queue<int> q;
    memset(dis,-1,sizeof(dis));
    dis[source]=0,q.push(source);
    while (!q.empty()) {
        int p=q.front();q.pop();
        for (int i=head[p];~i;i=e[i].nxt) {
            int v=e[i].v;
            if (e[i].r>0&&dis[v]==-1)
                dis[v]=dis[p]+1,q.push(v);
        }
    }
    return ~dis[sink];
}
int dfs(int p,int low) {
    int flow,cost=0;
    if (p==sink||low==0) return low;
    for (int &i=cur[p];~i;i=e[i].nxt) {
        int v=e[i].v;
        if (e[i].r>0&&dis[v]==dis[p]+1&&(flow=dfs(v,min(e[i].r,low)))) {
            e[i].r-=flow;
            e[i^1].r+=flow;
            cost+=flow;
            low-=flow;
            if (low==0) return cost;
        }
    }
    if (low>0) dis[p]=-1;
    return cost;
}
int min_cut() {
    int res=0;
    while (bfs()) {
        for (int i=source;i<=sink;++i) cur[i]=head[i];
        int a;
        while (a=dfs(source,INF)) res+=a;
    }
    return res;
}
int main() {
//  freopen("bzoj 1458.in","r",stdin);
    memset(head,-1,sizeof(head));
    memset(a,0,sizeof(a));
    memset(f1,0,sizeof(f1));
    memset(f2,0,sizeof(f2));
    n=read(),m=read(),k=read(),source=0,sink=n+m+1;
    for (int i=1;i<=n;++i) s1[i]=read();
    for (int i=1;i<=m;++i) s2[i]=read();
    for (int i=1;i<=k;++i) {
        int x=read(),y=read();
        a[x][y]=1;
    }
    for (int i=1;i<=n;++i)
        for (int j=1;j<=m;++j) {
            if (!a[i][j]) {
                adde(i,n+j,1,0);
                ++f1[i],++f2[j];
            }
        }
    for (int i=1;i<=n;++i) {
//      printf("%d %d\n",f1[i],s1[i]);
        if (f1[i]>=s1[i]) adde(source,i,f1[i]-s1[i],0),sumv+=f1[i];
        else {puts("JIONG!");return 0;}
    }
    for (int i=1;i<=m;++i) {
//      printf("%d %d\n",f2[i],s2[i]);
        if (f2[i]>=s2[i]) adde(i+n,sink,f2[i]-s2[i],0);
        else {puts("JIONG!");return 0;}
    }
    printf("%d\n",sumv-min_cut());
    return 0;
}