题意就是:给出m个猪圈,每个猪圈都有一定数量的猪,然后有n个顾客来买猪,他们每个都有一个最大的买猪数目。每次他们会按照顺序打开某些猪圈买猪,然后离开,此时卖家就在打开的猪圈里面重新分配猪,没有打开的猪圈不参与,然后全部猪圈都会关闭,一直循环。
经典的网络流题目。每个猪圈剩下多少猪是由第一个进入这个猪圈买猪的人决定的,所以每个猪圈和第一个进入这个猪圈的买家连一条流量为无穷的边。后进来的买家则只能从第一个进入这个猪圈的买家连接一条流量为无穷的边到自己。然后超级源点和每个猪圈连接一条流量为猪圈里面猪的数目的边,每个买家连接一条流量为自己最大买猪数量的边到超级汇点。此时发现猪圈到买家这一层的边都是无穷,所以省去,直接把猪圈的流量连到买家上。
代码如下:
#include<iostream>
#include<cstring>
#include<cstdio>
#include<queue>
const int maxn = 1000 + 5;
const int maxm = 2e5 + 5;
const int INF = 0x3f3f3f3f;
using namespace std;
typedef pair<int, int> pii;
inline int read()
{
int x=0,t=1,c;
while(!isdigit(c=getchar()))if(c=='-')t=-1;
while(isdigit(c))x=x*10+c-'0',c=getchar();
return x*t;
}
int head[maxn],cur[maxn],nx[maxm<<1],to[maxm<<1],flow[maxm<<1],ppp=0;
int n, m;
struct Dinic
{
int dis[maxn];
int s, t;
long long ans;
void init() {
memset(head, -1, sizeof(head));
ppp = 0;
}
void AddEdge(int u, int v, int c)
{
to[ppp]=v;flow[ppp]=c;nx[ppp]=head[u];head[u]=ppp++;swap(u,v);
to[ppp]=v;flow[ppp]=0;nx[ppp]=head[u];head[u]=ppp++;
}
bool BFS()
{
memset(dis, -1, sizeof(dis));
dis[s] = 1;
queue<int> Q;
Q.push(s);
while(!Q.empty())
{
int x = Q.front();
Q.pop();
for(int i = head[x]; ~i; i = nx[i])
{
if(flow[i] && dis[to[i]] == -1)
{
dis[to[i]] = dis[x] + 1;
Q.push(to[i]);
}
}
}
return dis[t] != -1;
}
int DFS(int x, int maxflow)
{
if(x == t || !maxflow){
ans += maxflow;
return maxflow;
}
int ret = 0, f;
for(int &i = cur[x]; ~i; i = nx[i])
{
if(dis[to[i]] == dis[x] + 1 && (f = DFS(to[i], min(maxflow, flow[i]))))
{
ret += f;
flow[i] -= f;
flow[i^1] += f;
maxflow -= f;
if(!maxflow)
break;
}
}
return ret;
}
long long solve(int source, int tank)
{
s = source;
t = tank;
ans = 0;
while(BFS())
{
memcpy(cur, head, sizeof(cur));
DFS(s, INF);
}
return ans;
}
}dinic;
int pig[maxn];
int par[maxn];
int main()
{
#ifndef ONLINE_JUDGE
freopen("poj_in.txt", "r", stdin);
#endif
m = read(), n = read();
int s = n, t = s + 1;
memset(head, -1, sizeof(head));
ppp = 0;
memset(par, -1, sizeof(par));
for(int i = 0; i < m; i++)
pig[i] = read();
for(int i = 0; i < n; i++) {
int k = read();
for(int j = 0, tmp; j < k; j++) {
tmp = read() - 1;
if(pig[tmp]) {
dinic.AddEdge(s, i, pig[tmp]);
pig[tmp] = 0;
par[tmp] = i;
} else if(par[tmp] != -1){
dinic.AddEdge(par[tmp], i, INF);
}
}
int tmp = read();
dinic.AddEdge(i, t, tmp);
}
printf("%lld\n",dinic.solve(s,t));
return 0;
}