1149 PIGS

原创 2007年10月15日 08:36:00
PIGS
Time Limit: 1000MS   Memory Limit: 10000K
Total Submissions: 2084   Accepted: 867

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 arives, 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

 

Sample Output

 

Source
Croatia OI 2002 Final Exam - First day

**********************************************************************************************

**********************************************************************************************

Source Code
#include<stdio.h>
#include<memory.h>
#include<math.h>
#include<stdlib.h>
 
const int SIZE = 1010;
const int max = 10000000;
struct Point{
        int c,f;
}net[SIZE][SIZE];
int pre[SIZE],s,t,n;
int queue[SIZE],head,tail;
 
bool bfs()
{
        int i;
        head = tail = 0;
        memset(pre,0,sizeof(pre));
        queue[tail++] = s;
        pre[s] = s;
        while(tail != head){
               int temp = queue[head++];
               for(i = 1; i <= n+2; i++)
                       if(pre[i] == 0 && (net[temp][i].c>net[temp][i].f && 
net[temp][i].f>=0 || net[i][temp].c>=net[i][temp].f && net[i][temp].f>0)){
                               if(net[temp][i].f < net[temp][i].c)
                                      pre[i] = temp;
                               if(net[i][temp].f > 0)
                                      pre[i] = -temp;
                               if(i == t){
                                      return true;
                               }
                               else
                                       queue[tail++] = i;
                       }
        }
        return false;
}
int maxflow()
{
        int flow = 0,i;
        while(bfs()){
               int dx = 0x7FFFFFFF;
               int temp;
               for(i = t; i != s; i = abs(pre[i])){
                       if(pre[i] >= 0)
                               temp = net[pre[i]][i].c-net[pre[i]][i].f;
                       else
                               temp = net[i][-pre[i]].f;
                       if(dx > temp)
                               dx = temp;
               }
               for(i = t; i != s; i= abs(pre[i])){
                       if(pre[i] >= 0)
                               net[pre[i]][i].f += dx;
            else
                               net[i][-pre[i]].f -= dx;
               }
               flow += dx;
        }
        return flow;
}
 
int num[1010],f[1010];
int main()
{
        int m,i,j,temp;
        scanf("%d %d",&m,&n);
        for(i = 1; i <= m; i++){
               scanf("%d",&num[i]);
               f[i] = 0;
        }
        int x;
        for(j = 2; j <= n+1; j++){
               scanf("%d",&temp);
               for(int k = 0; k < temp; k++){
                       scanf("%d",&x);
                       if(f[x] == 0){
                               net[1][j].c += num[x];
                               f[x] = j;
                       }
                       else
                               net[f[x]][j].c = max;
               }
               scanf("%d",&temp);
               net[j][n+2].c = temp;
        }
        s = 1; t = n+2;
        int out = maxflow();
        printf("%d/n",out);
        return 0;
}

 

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

Poj 1149 PIGS【最大流Dinic+建图】

PIGS Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 19900   Accepted...
  • mengxiang000000
  • mengxiang000000
  • 2016年07月28日 19:56
  • 225

POJ 1149 PIGS(最大流)

PIGS Time Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%I64d & %I64u Submit Status ...
  • Bamb00D
  • Bamb00D
  • 2015年08月03日 20:26
  • 161

POJ 1149 PIGS(最大流)

POJ 1149 PIGS(最大流)
  • u012860063
  • u012860063
  • 2015年07月19日 20:00
  • 739

poj 1149 PIGS(最大流)

题目链接:http://poj.org/problem?id=1149 网络流的建图经典题,难点全在建图上面! 题目大意: 有M个猪圈,每个猪圈里初始时有若干头猪。一开始所有猪圈都是关闭的。...
  • cha1_cool
  • cha1_cool
  • 2013年07月22日 11:00
  • 245

POJ 1149 PIGS(最大流)

POJ 1149 PIGS 题目链接 题意:有n个猪圈,m个顾客,猪圈中一开始有一些猪,顾客轮流来(注意是有先后顺序的),然后每个顾客会开启一些猪圈,在开启的猪圈中最多买b只猪,之后可以任...
  • u011217342
  • u011217342
  • 2014年11月05日 22:38
  • 593

poj 1149 PIGS(最大流)

哎····,英语好难过,刚开始题读不懂,后来读懂了没思路!哎···,最大流········ +            +                   +                +   ...
  • u011518888
  • u011518888
  • 2013年08月06日 19:05
  • 608

poj 1149 PIGS(最大流)

Language: Default PIGS Time Limit: 1000MS   Memory Limit: 10000K Total Submissio...
  • u011699990
  • u011699990
  • 2014年12月13日 02:14
  • 827

poj 1149 PIGS(最大流)

PIGS Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 19617   Accepted...
  • acm_cxq
  • acm_cxq
  • 2016年06月02日 16:42
  • 651

【最大流(EK)】poj 1149 PIGS

http://poj.org/problem?id=1149 题意:有M个猪圈、N个顾客,每个顾客有A把钥匙;只能在有钥匙的猪圈购买最多B只猪,顾客购买过后,可以对打开的猪圈内的猪重新分配;求最多可以...
  • yduqytd
  • yduqytd
  • 2014年02月17日 00:44
  • 367

poj 1149 PIGS 【网络最大流】

PIGS Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 16630   Accepted...
  • letterwuyu
  • letterwuyu
  • 2014年10月28日 14:20
  • 306
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:1149 PIGS
举报原因:
原因补充:

(最多只允许输入30个字)