poj3128 Dinic算法

基本完全复制别人的，汗。。。发现这个模板不适合我这种初学者。。。

不过这样的实现感觉略有点难以理解，肯定还要用自己的方式实现一次。

邻接表实现的，效率挺高的。

然后本题关键还是构图，网上说得很多，我就不重复了。

 

//224K 0ms
#include <iostream>
using namespace std;

const int vNum = 403;
const int inf = 0x7fffffff;
int e_id;
int preEdge[vNum];
int level[vNum];
int que[vNum], out[vNum];

struct Edge
{
	int v, value, last;
} edge[vNum*vNum];

void addEdge(int from, int to, int val)
{
	edge[e_id].v = to;
	edge[e_id].value = val;
	edge[e_id].last = preEdge[from];
    preEdge[from] = e_id++;
}

int Dinic(int sta, int end, int size)
{
	int i, max = 0;
	
	while(true)
	{
		int head, tail, curr;
		
		memset(level, 0, sizeof(level));
		head = 0; tail = 0;
		que[head] = sta;
		level[sta] = 1;
		while(head <= tail)
		{
			curr = que[head++];
			
			for(i = preEdge[curr]; i != -1; i = edge[i].last)
				if(edge[i].value > 0 && !level[edge[i].v])
				{
					level[edge[i].v] = level[curr] + 1;
					que[++tail] = edge[i].v;
				}
		}
		
		if(level[end] == 0) break;
		
		for(i = 0; i < size; i++)
			out[i] = preEdge[i];
		
		int currNode = sta, q = -1;
		while(true)
		{
			if(q < 0)
			{
				for(i = out[sta]; i != -1; i = edge[i].last)
					if(edge[i].value > 0 && out[edge[i].v] != -1 && level[edge[i].v] == 2)
						break;
                if(i == -1) break;
				que[++q] = i;
				out[sta] = edge[i].last;
			}	
			currNode = edge[que[q]].v;
			if(currNode == end)
			{
				int delta = inf, id = -1;
				for(i = 0; i <= q; i++)
					if(edge[que[i]].value < delta)
					{
						delta = edge[que[i]].value;
						id = i;
					}
				for(i = 0; i <= q; i++)
				{
					edge[que[i]].value -= delta;
					edge[que[i]^1].value += delta;
				}
				max += delta;
				q = id-1;	
			}
			else
			{
				for(i = out[currNode]; i != -1; i = edge[i].last)
					if(edge[i].value > 0 && level[edge[i].v] == level[currNode] + 1)
						break;
					
				if(i == -1)
				{
					q--;
					out[currNode] = -1;
				}
				else
				{
					que[++q] = i;
					out[currNode] = edge[i].last;
				} 
					
			}
		}
	}
	return max;
}
int main()
{
	int N, F, D;
	int fN, dN;
	int f, d;
	//freopen("a.txt", "r", stdin);
	while( scanf("%d%d%d", &N, &F, &D) != EOF )
	{
		e_id = 0; 
		memset(preEdge, -1, sizeof(preEdge));
		int foodSta = 1;
		int cowSta1 = F+1;
		int cowSta2 = F+N+1;
		int drinkSta = F+2*N+1;
		int end = drinkSta+D+1;
		int i;
		
		for(i = foodSta; i < cowSta1; i++)
		{
			addEdge(0, i, 1);
			addEdge(i, 0, 0);
		}
		for(i = cowSta1; i < cowSta2; i++)
		{
			addEdge(i, cowSta2+i-cowSta1, 1);
			addEdge(cowSta2-cowSta1+i, i, 0);
		}
		for(i = drinkSta; i < end; i++)
		{
			addEdge(i, end, 1);
			addEdge(end, i, 0);
		}
		
		for(i = 0; i < N; i++)
		{
			scanf("%d%d", &fN, &dN);
			while(fN--)
			{
				scanf("%d", &f);
				addEdge(foodSta+f-1, cowSta1+i, 1);
				addEdge(cowSta1+i, foodSta+f-1, 0);
			}
			while(dN--)
			{
				scanf("%d", &d);
				addEdge(cowSta2+i, drinkSta+d-1, 1);
				addEdge(drinkSta+d-1, cowSta2+i, 0);
			}
		}
		printf("%d\n", Dinic(0, end, end+1));
	}
	return 0;
}