/*
顾客的先后顺序影响销售
把顾客也看成源点和汇点以外的点
1 源点和每个猪圈的第一个顾客连边,边权为此猪圈猪的数目
存在多个猪圈的第一个顾客相同时,只需把边权相加即可
2 对于顾客i,紧邻他前面有x打开过同一个房间,连一条边权无限的边(可以根据j的需求调度猪)
3 每个顾客和汇点连边,边权为该顾客的需求
*/
#include <cstdio>
#include <iostream>
#include<queue>
#include<set>
#include<ctime>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#include<cstring>
using namespace std;
const int maxn=1009;
const int inf=1<<30;
int num[maxn];//num[i],第i个猪圈中猪是数量
int up[maxn];//up[i]第i个顾客的当前顾客
//为dinic求最大流模版
struct edge
{
int v, next;
int val;
} net[ 500100 ];
int n,m;
int level[maxn], Qu[maxn], out[maxn],next[maxn];
class Dinic {
public:
int end;
Dinic() {
end = 0;
memset( next, -1, sizeof(next) );
}
inline void insert( int x, int y, int c) {
net[end].v = y, net[end].val = c,
net[end].next = next[x],
next[x] = end ++;
net[end].v = x, net[end].val = 0,
net[end].next = next[y],
next[y] = end ++;
}
bool BFS( int S, int E ) {
memset( level, -1, sizeof(level) );
int low = 0, high = 1;
Qu[0] = S, level[S] = 0;
for( ; low < high; ) {
int x = Qu[low];
for( int i = next[x]; i != -1; i = net[i].next ) {
if( net[i].val == 0 ) continue;
int y = net[i].v;
if( level[y] == -1 ) {
level[y] = level[x] + 1;
Qu[ high ++] = y;
}
}
low ++;
}
return level[E] != -1;
}
int MaxFlow( int S, int E ){
int maxflow = 0;
for( ; BFS(S, E) ; ) {
memcpy( out, next, sizeof(out) );
int now = -1;
for( ;; ) {
if( now < 0 ) {
int cur = out[S];
for(; cur != -1 ; cur = net[cur].next )
if( net[cur].val && out[net[cur].v] != -1 && level[net[cur].v] == 1 )
break;
if( cur >= 0 ) Qu[ ++now ] = cur, out[S] = net[cur].next;
else break;
}
int u = net[ Qu[now] ].v;
if( u == E ) {
int flow = inf;
int index = -1;
for( int i = 0; i <= now; i ++ ) {
if( flow > net[ Qu[i] ].val )
flow = net[ Qu[i] ].val, index = i;
}
maxflow += flow;
for( int i = 0; i <= now; i ++ )
net[Qu[i]].val -= flow, net[Qu[i]^1].val += flow;
for( int i = 0; i <= now; i ++ ) {
if( net[ Qu[i] ].val == 0 ) {
now = index - 1;
break;
}
}
}
else{
int cur = out[u];
for(; cur != -1; cur = net[cur].next )
if (net[cur].val && out[net[cur].v] != -1 && level[u] + 1 == level[net[cur].v])
break;
if( cur != -1 )
Qu[++ now] = cur, out[u] = net[cur].next;
else out[u] = -1, now --;
}
}
}
return maxflow;
}
};
int main()
{
int keynum,key;
int s,t,need;
while(scanf("%d%d",&m,&n)!=EOF)
{
memset(up,0,sizeof(up));
Dinic my;
s=0;
t=n+1;
for(int i=1;i<=m;i++)
{
scanf("%d",&num[i]);
}
for(int i=1;i<=n;i++)
{
scanf("%d",&keynum);
for(int j=0;j<keynum;j++)
{
scanf("%d",&key);
if(up[key]==0)//第key个猪圈的第一个顾客
{
my.insert(s,i,num[key]);
up[key]=i;
}
else
{
my.insert(up[key],i,inf);//第key个猪圈的上一个顾客和当前顾客连边
up[key]=i;
}
}
scanf("%d",&need);
my.insert(i,t,need);//每个顾客个汇点连边,边权为需求
}
printf("%d\n",my.MaxFlow(s,t));
}
}
m
poj 1149 PIGS 最大流建图
最新推荐文章于 2019-08-10 21:41:18 发布