【HDU4292】【1的限制建图】

Food

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 4105    Accepted Submission(s): 1365

Problem Description

　　You, a part-time dining service worker in your college’s dining hall, are now confused with a new problem: serve as many people as possible.
　　The issue comes up as people in your college are more and more difficult to serve with meal: They eat only some certain kinds of food and drink, and with requirement unsatisfied, go away directly.
　　You have prepared F (1 <= F <= 200) kinds of food and D (1 <= D <= 200) kinds of drink. Each kind of food or drink has certain amount, that is, how many people could this food or drink serve. Besides, You know there’re N (1 <= N <= 200) people and you too can tell people’s personal preference for food and drink.
　　Back to your goal: to serve as many people as possible. So you must decide a plan where some people are served while requirements of the rest of them are unmet. You should notice that, when one’s requirement is unmet, he/she would just go away, refusing any service.

 

Input

　　There are several test cases.
　　For each test case, the first line contains three numbers: N,F,D, denoting the number of people, food, and drink.
　　The second line contains F integers, the ith number of which denotes amount of representative food.
　　The third line contains D integers, the ith number of which denotes amount of representative drink.
　　Following is N line, each consisting of a string of length F. e jth character in the ith one of these lines denotes whether people i would accept food j. “Y” for yes and “N” for no.
　　Following is N line, each consisting of a string of length D. e jth character in the ith one of these lines denotes whether people i would accept drink j. “Y” for yes and “N” for no.
　　Please process until EOF (End Of File).

 

Output

　　For each test case, please print a single line with one integer, the maximum number of people to be satisfied.

 

Sample Input

  
  

   
   4 3 3
1 1 1
1 1 1
YYN
NYY
YNY
YNY
YNY
YYN
YYN
NNY
  
  

 

Sample Output

  
  

   
   3
  
  

 

Source

2012 ACM/ICPC Asia Regional Chengdu Online

 

Recommend

liuyiding

 

int n,F,D;
Max_Flow<int> MF;
char str[220];
const int food = 1;
const int person1 = 201;
const int person2 = 401;
const int drink = 601;
int myend = 810;
int main()
{
    while(scanf("%d%d%d",&n,&F,&D) != EOF)
	{
		MF.Init(myend+1,0,myend);
		for(int i=1;i<=F;i++)
		{
			int num;
			scanf("%d",&num);
			MF.Add_edge(0,i,num);
		}
		for(int i=0;i<D;i++)
		{
			int num;
			scanf("%d",&num);
			MF.Add_edge(drink+i,myend,num);
		}
		
		for(int i=0;i<n;i++)
		{
			scanf("%s",str);
			int len = strlen(str);
			for(int j=0;j<len;j++)
			{
				if(str[j] == 'Y')
				{
					MF.Add_edge(food+j,person1+i,1);
				}
			}
		}
		for(int i=0;i<n;i++)
		{
			scanf("%s",str);
			int len = strlen(str);
			for(int j=0;j<len;j++)
			{
				if(str[j] == 'Y')
				{
					MF.Add_edge(person2+i,drink+j,1);
				}

			}
			MF.Add_edge(person1+i,person2+i,1);
		}

		printf("%d\n",MF.Dinic());
	}
    return 0;
}