BZOJ2768 JLOI2012冠军调查（最小割）

　　容易想到网络流。将每个人拆成0和1两个点。若某人值为0的话则让源连向0，否则让1连向汇，流量为1。相互认识的人之间01各自连边。跑最小割即可。

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<algorithm>
using namespace std;
int read()
{
    int x=,f=;char c=getchar();
    while (c<''||c>'') {if (c=='-') f=-;c=getchar();}
    while (c>=''&&c<='') x=(x<<)+(x<<)+(c^),c=getchar();
    return x*f;
}
#define N 310
#define S 0
#define T 601
int n,m,p[N<<],t=-,ans=;
int d[N<<],cur[N<<],q[N<<];
struct data{int to,nxt,cap,flow;
}edge[N*N<<];
int trans(int x,int y){return (x<<)-y;}
void addedge(int x,int y)
{
    t++;edge[t].to=y,edge[t].nxt=p[x],edge[t].cap=,edge[t].flow=,p[x]=t;
    t++;edge[t].to=x,edge[t].nxt=p[y],edge[t].cap=,edge[t].flow=,p[y]=t;
}
bool bfs()
{
    memset(d,,sizeof(d));d[S]=;
    int head=,tail=;q[]=S;
    do
    {
        int x=q[++head];
        for (int i=p[x];~i;i=edge[i].nxt)
        if (d[edge[i].to]==-&&edge[i].flow<edge[i].cap)
        {
            d[edge[i].to]=d[x]+;
            q[++tail]=edge[i].to;
        }
    }while (head<tail);
    return ~d[T];
}
int work(int k,int f)
{
    if (k==T) return f;
    int used=;
    for (int i=cur[k];~i;i=edge[i].nxt)
    if (d[k]+==d[edge[i].to])
    {
        int w=work(edge[i].to,min(f-used,edge[i].cap-edge[i].flow));
        edge[i].flow+=w,edge[i^].flow-=w;
        if (edge[i].flow<edge[i].cap) cur[k]=i;
        used+=w;if (used==f) return f;
    }
    if (used==) d[k]=-;
    return used;
}
void dinic()
{
    while (bfs())
    {
        memcpy(cur,p,sizeof(p));
        ans+=work(S,N*N);
    }
}
int main()
{
#ifndef ONLINE_JUDGE
    freopen("bzoj2768.in","r",stdin);
    freopen("bzoj2768.out","w",stdout);
    const char LL[]="%I64d\n";
#else
    const char LL[]="%lld\n";
#endif
    n=read(),m=read();
    memset(p,,sizeof(p));
    for (int i=;i<=n;i++)
    {
        int x=read();
        if (x) addedge(trans(i,),T);
        else addedge(S,trans(i,));
    }
    for (int i=;i<=m;i++)
    {
        int x=read(),y=read();
        addedge(trans(x,),trans(y,));
        addedge(trans(y,),trans(x,));
    }
    dinic();
    cout<<ans;
    return ;
}