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

POJ1149 PIGS【特殊建图,最大流】

看题解做的,看懂了怎么建图后,套上挑战icpc的最大流模版,就A了,上题解 题意:M个猪圈,N个顾客,每个顾客有一些的猪圈的钥匙,只能购买这些有钥匙的猪圈里的猪,而且要买一定数量的猪,每个猪圈有已知...
  • u011775691
  • u011775691
  • 2014年06月04日 10:36
  • 733

poj1149 - PIGS

想看更多的解题报告:http://blog.csdn.net/wangjian8006/article/details/7870410                                ...
  • wangjian8006
  • wangjian8006
  • 2012年09月01日 19:45
  • 2978

POJ1149 PIGS 题解

PKU 1149, PIGS,构造网络流模型时,要注意合并节点和边 ps: 本解题报告摘自  (点击上一行)        这道题目的大意是这样的: 有 M 个猪圈(M ≤ 1000),每...
  • shahdza
  • shahdza
  • 2011年09月28日 21:56
  • 2613

POJ 1149--PIGS 【最大流 && 处理重边 && 经典建模】

PIGS Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 18123   Accepted: 8246 ...
  • hpuhjh
  • hpuhjh
  • 2015年08月05日 15:27
  • 677

POJ 1149 PIGS 网络流

思路参考Edelweiss大神写的《网络流建模汇总》 感觉自己写得还是比较挫 //#pragma comment(linker, "/STACK:102400000,102400000") #in...
  • ACMmaxx
  • ACMmaxx
  • 2014年02月28日 14:31
  • 422

poj 1149 PIGS(最大流)

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

POJ 1149 PIGS(最大流)

题意:有m个猪圈,初始值为ai头,有n个人来买猪。第i个人他可能打开某些猪圈,并且他最多买num个,他买后,他打开的猪圈里的猪可以随意的移动到打开的猪圈,然后猪圈关闭,第i+1个人又来买。问这n个人最...
  • swust_lian
  • swust_lian
  • 2016年01月21日 19:29
  • 197

POJ 1149 PIGS 最大流

sap+gap优化 View Code #include #includestring.h> #include using namespace std; #define maxn 1...
  • c3568
  • c3568
  • 2013年08月29日 10:32
  • 574

POJ 1149 最大流 PIGS

//11166606 c00h00g 1149 Accepted 696K 47MS G++ 1819B 2013-01-09 12:03:48 //将顾客看成顶点,构造网络流 //废话不多说,参看大...
  • chen895281773
  • chen895281773
  • 2013年01月09日 12:00
  • 161

POJ 1149 PIGS ( 网络流 )

主要是建图有些小烦,若几个节点流量的来源或者去向完全相同,且流量为 INF,将它们合并成一个节点。 若从两点间有且仅有一条容量为 INF 的边,将两点合并成一个节点。 #include #i...
  • u011659057
  • u011659057
  • 2015年07月02日 01:08
  • 867
收藏助手
不良信息举报
您举报文章:1149 PIGS
举报原因:
原因补充:

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