2366176_wa.cpp

北大大牛代码 1240道题的原代码 超级权威

#include <stdio.h>
#include <string.h>

int ans;
int n, F, D, m;
int map[310][310];

int bfs()
{
	int i, mark = 0;
	int f, r, p;
	int pre[310], visited[310];
	int queue[310];
	int C, F[310];

	f = r = -1;
	memset(pre,0,sizeof(pre));
	memset(visited,0,sizeof(visited));
	visited[0] = 1;queue[++f] = 0;pre[0] = -1;
	C = 21000000;
	while(f!=r)
	{
		++r;
		p = queue[r];
		for(i = 0; i < m; i++)
			if(map[p][i]&&!visited[i])
			{
				visited[i] = 1;
				queue[++f] = i;
				pre[i] = p;
				F[i] = map[p][i];
				if(i==m-1)
				{	
					mark = 1;
					goto m1;
				}
			}
	}
	m1:;
	if(mark)
	{
		p = m-1;
		while(pre[p]!=-1)
		{
			if(F[p]<C)
				C = F[p];
			p = pre[p];
		}
		p = m-1;
		while(pre[p]!=-1)
		{
			map[pre[p]][p] -= C;
			map[p][pre[p]] += C;
			p = pre[p];
		}
		ans += C;
	}
	return mark;
}

int main()
{
	int i, j, t;
	int fi, di;

	scanf("%d%d%d",&n,&F,&D);
	memset(map,0,sizeof(map));
	for(i = 1; i <= D; i++)
		map[0][i] = 1000000;
	for(i = D+n+1; i <= D+n+F; i++)
		map[i][D+n+F+1] = 1000000;
	for(i = 0; i < n; i++)
	{
		scanf("%d%d",&fi,&di);
		for(j = 0; j < fi; j++)
		{
			scanf("%d",&t);
			map[D+i+1][t+D+n] = 1;
		}
		for(j = 0; j < di; j++)
		{
			scanf("%d",&t);
			map[t][D+i+1] = 1;
		}
	}
	ans = 0;m = D+F+n+2;
	while(bfs());
	printf("%d\n",ans);
	return 1;
}