原题链接:poj3281
此题的难点在于建图,可以按照 源点——食物——牛——牛——汇点 建图,这里对牛 拆点操作,是为了保证牛的点容量为1,如果不拆,
那么相当于牛的点容量为无穷
建好图后,可以根据各种最大流yy出来:
新手代码:慎入:
#include<iostream>
#include<cstdio>
#include<vector>
#include<cstring>
#define N 25000
#define MAX 0x7f7f7f7f
using namespace std;
struct node
{
int to;
int v;
int next;
}edge[N];
int n,f,d;
int head[500];
int p;
void addedge(int a,int b,int v)
{
edge[p].to=b;
edge[p].v=v;
edge[p].next=-1;
p++;
if(head[a]==-1)
{
head[a]=p-1;
return;
}
int p1=head[a];
while(edge[p1].next!=-1)
p1=edge[p1].next;
edge[p1].next=p-1;
}
void buildmap()
{
for(int i=1;i<=f;i++)
{
addedge(0,i,1);
addedge(i,0,0);
}
// cout<<"sdff"<<endl;
for(int i=1;i<=d;i++)
{
addedge(f+n+n+i,f+n+n+d+1,1);
addedge(f+n+n+d+1,f+n+n+i,0);
}
for(int i=1;i<=n;i++)
{
addedge(f+i,f+n+i,1);
addedge(f+n+i,f+i,0);
}
int fnum,dnum,a;
for(int i=1;i<=n;i++)
{
scanf("%d%d",&fnum,&dnum);
for(int j=0;j<fnum;j++)
{
scanf("%d",&a);
addedge(a,f+i,1);
addedge(f+i,a,0);
}
for(int j=0;j<dnum;j++)
{
scanf("%d",&a);
addedge(f+n+i,f+n+n+a,1);
addedge(f+n+n+a,f+n+i,0);
}
}
}
int level[500];
int que[500];
bool vis[500];
bool makelevel(int s,int t)
{
memset(level,0,sizeof(level));
memset(vis,false,sizeof(vis));
level[s]=1;
int front=0,rear=0;
que[rear++]=s;
vis[s]=true;
while(front<rear)
{
int tt=que[front++];
if(tt==t)return true;
for(int p1=head[tt];p1!=-1;p1=edge[p1].next)
if(!vis[edge[p1].to]&&edge[p1].v>0)
{
que[rear++]=edge[p1].to;
vis[edge[p1].to]=true;
level[edge[p1].to]=level[tt]+1;
}
}
return false;
}
int dfs(int s,int MAX_F,int tt)
{
if(s==tt)return MAX_F;
int ret=0,f;
for(int i=head[s];i!=-1;i=edge[i].next)
{
if(edge[i].v>0&&level[edge[i].to]==level[s]+1)
{
f=dfs(edge[i].to,min(MAX_F-ret,edge[i].v),tt);
edge[i].v-=f;
edge[i^1].v+=f;
ret+=f;
if(ret==MAX_F) return ret;
}
}
return ret;
}
int dinic(int s,int t)
{
int ans=0;
while(makelevel(s,t))ans+=dfs(s,MAX,t);
return ans;
}
int main()
{
//freopen("in.txt","r",stdin);
scanf("%d%d%d",&n,&f,&d);
p=0;
memset(head,-1,sizeof(head));
buildmap();
printf("%d\n",dinic(0,f+n+n+d+1));
}