2269324_wa.c

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

#include <stdio.h>
#include <string.h>
#define INF 30000
#define MaxV 110

int m, n, ans = 0;
int h[1001];
int map[110][110];

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

	f = r = -1;
	memset(pre,0,sizeof(pre));
	memset(visited,0,sizeof(visited));
	visited[0] = 1;queue[++f] = 0;pre[0] = -1;
	C = INF+1;
	while(f!=r)
	{
		++r;
		p = queue[r];
		for(i = 0; i <= m+1; 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;
}

void input()
{
	int i, j;
	int A, B, key;
	int Key[1010][110];

	scanf("%d%d",&m,&n);
	memset(map,0,sizeof(map));
	memset(Key,0,sizeof(Key));
	for(i = 1; i <= m; i++)
		scanf("%d",&h[i]);
	for(i = 1; i <= n; i++)
	{
		scanf("%d",&A);
		for(j = 0; j < A; j++)
		{
			scanf("%d",&key);
			Key[key][0]++;
			Key[key][Key[key][0]] = i;
		}
		scanf("%d",&B);
		map[i][n+1] += B;
	}
	for(i = 1; i <= m; i++)
		map[0][Key[i][1]] += h[i];
	for(i = 1; i <= m; i++)
	{
		for(j = 1; j < Key[i][0]; j++)
			map[Key[i][j]][Key[i][j+1]] = INF;
	}
	while(bfs());
	printf("%d\n",ans);
}

int main()
{
	input();
	return 1;
}