POJ 1149 PIGS

Description

Mirko works on a pig farm that consists of M locked pig-houses and Mirko can't unlock any pighouse because he doesn't have the keys. Customers come to the farm one after another. Each of them has keys to some pig-houses and wants to buy a certain number of pigs. 
All data concerning customers planning to visit the farm on that particular day are available to Mirko early in the morning so that he can make a sales-plan in order to maximize the number of pigs sold. 
More precisely, the procedure is as following: the customer arrives, opens all pig-houses to which he has the key, Mirko sells a certain number of pigs from all the unlocked pig-houses to him, and, if Mirko wants, he can redistribute the remaining pigs across the unlocked pig-houses. 
An unlimited number of pigs can be placed in every pig-house. 
Write a program that will find the maximum number of pigs that he can sell on that day.

Input

The first line of input contains two integers M and N, 1 <= M <= 1000, 1 <= N <= 100, number of pighouses and number of customers. Pig houses are numbered from 1 to M and customers are numbered from 1 to N. 
The next line contains M integeres, for each pig-house initial number of pigs. The number of pigs in each pig-house is greater or equal to 0 and less or equal to 1000. 
The next N lines contains records about the customers in the following form ( record about the i-th customer is written in the (i+2)-th line): 
A K1 K2 ... KA B It means that this customer has key to the pig-houses marked with the numbers K1, K2, ..., KA (sorted nondecreasingly ) and that he wants to buy B pigs. Numbers A and B can be equal to 0.

Output

The first and only line of the output should contain the number of sold pigs.

Sample Input

3 3
3 1 10
2 1 2 2
2 1 3 3
1 2 6

Sample Output

7

Source

Croatia OI 2002 Final Exam - First day

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

最大流~

从源点向所有猪圈连边，容量为猪圈容量；从猪圈向第一个打开它的顾客连边，容量为正无穷（因为前面限制过了）；每个顾客向他后面与他打开的猪圈有交集的顾客连边，容量为正无穷；最后每个顾客向汇点连边，容量为要购买的猪的数量。

#include<cstdio>
#include<cstring>
#include<iostream>
#include<queue>
using namespace std;
#define inf 999999999

int n,m,x,y,fi[2000],ne[24000],w[24000],v[24000],cnt,dis[2000],a[1001][101],ans;
bool in[101][101],b[1001];

int read()
{
	int x=0;char ch=getchar();
	while(ch<'0' || ch>'9') ch=getchar();
	while(ch>='0' && ch<='9') {x=(x<<1)+(x<<3)+ch-'0';ch=getchar();}
	return x; 
}

void add(int u,int vv,int val)
{
	w[++cnt]=vv;ne[cnt]=fi[u];fi[u]=cnt;v[cnt]=val;
	w[++cnt]=u;ne[cnt]=fi[vv];fi[vv]=cnt;
}

bool bfs()
{
	memset(dis,-1,sizeof(dis));
	queue<int> q;q.push(0);dis[0]=0;
	while(!q.empty())
	{
		int k=q.front();q.pop();
		for(int i=fi[k];i;i=ne[i])
		  if(dis[w[i]]==-1 && v[i]>0)
		  {
		  	q.push(w[i]);dis[w[i]]=dis[k]+1;
		  }
	}
	if(dis[n+m+1]==-1) return 0;
	return 1;
}

int findd(int u,int vv)
{
	if(u==n+m+1) return vv;
	int kkz,tot=0;
	for(int i=fi[u];i;i=ne[i])
	  if(dis[w[i]]==dis[u]+1 && v[i]>0 && (kkz=findd(w[i],min(v[i],vv-tot))))
	  {
	  	v[i]-=kkz;v[i^1]+=kkz;tot+=kkz;
	  	if(tot==vv) return tot;
	  }
	if(!tot) dis[u]=-1;
	return tot;
}

int main()
{
	m=read();n=read();cnt=1;
	for(int i=1;i<=m;i++) x=read(),add(0,i,x);
	for(int i=1;i<=n;i++)
	{
		x=read();
		while(x--)
		{
			y=read(),a[y][++a[y][0]]=i;
			if(!b[y]) add(y,i+m,inf),b[y]=1;
		}
		x=read();add(i+m,n+m+1,x);
	}
	for(int i=1;i<=m;i++)
	  for(int j=1;j<a[i][0];j++)
	    for(int k=j+1;k<=a[i][0];k++) in[a[i][j]][a[i][k]]=in[a[i][k]][a[i][j]]=1;
	for(int i=1;i<n;i++)
	  for(int j=i+1;j<=n;j++) if(in[i][j]) add(i+m,j+m,inf);
	while(bfs()) ans+=findd(0,inf);
	printf("%d\n",ans);
	return 0;
}