有M个猪圈,每个猪圈里初始时有若干头猪。一开始所有猪圈都是关闭的。依次来了N个顾客,每个顾客分别会打开指定的几个猪圈,从中买若干头猪。每个顾客分别都有他能够买的数量的上限。每个顾客走后,他打开的那些猪圈中的猪,都可以被任意地调换到其它开着的猪圈里,然后所有猪圈重新关上。问总共最多能卖出多少头猪。(1 <= N <= 100, 1 <= M <= 1000)
这道题是通过特殊的化简规律,把一个复杂网络流化简成了特别简单的形式!!
资料:https://wenku.baidu.com/view/0ad00abec77da26925c5b01c.html
这分资料特别棒,详细的解释了网络流的化简问题。
- #include <cstdio>
- #include <cstring>
- #include <iostream>
- #include <algorithm>
- #include <queue>
- #include <vector>
- using namespace std;
- const int maxn = 1000 + 50;
- const int INF = 1e9;
- int n, m;
- struct Edge{
- int from, to, cap, flow;
- };
- struct Dinic{
- int n, m, s, t;
- vector<Edge> edges;
- vector<int> G[maxn];
- bool vis[maxn];
- int d[maxn];
- int cur[maxn];
- void init(int n)
- {
- this->n = n;
- for(int i=0; i<=n; ++i) G[i].clear();
- edges.clear();
- }
- void AddEdge(int from, int to, int cap)
- {
- edges.push_back((Edge){
- from, to, cap, 0
- });
- edges.push_back((Edge){
- to, from, 0, 0
- });
- m = edges.size();
- G[from].push_back(m-2);
- G[to].push_back(m-1);
- }
- bool BFS(){
- memset(vis, 0, sizeof vis );
- queue<int> Q;
- Q.push(s);
- vis[s] = 1;
- d[s] = 0;
- while(!Q.empty()){
- int x = Q.front(); Q.pop();
- for(int i=0; i<G[x].size(); ++i){
- Edge& e = edges[G[x][i]];
- if(!vis[e.to] && e.cap > e.flow){
- vis[e.to] = 1;
- d[e.to] = d[x] + 1;
- Q.push(e.to);
- }
- }
- }
- return vis[t];
- }
- int DFS(int x, int a){
- if(x==t || a==0) return a;
- int flow = 0, f;
- for(int& i=cur[x]; i<G[x].size(); ++i){
- Edge& e = edges[G[x][i]];
- if(d[x]+1==d[e.to] && (f=DFS(e.to, min(a, e.cap-e.flow)))>0){
- e.flow += f;
- edges[G[x][i]^1].flow -= f;
- flow += f;
- a -= f;
- if(a==0) break;
- }
- }
- return flow;
- }
- int MaxFlow(int s, int t){
- this->s = s; this->t = t;
- int flow = 0;
- while(BFS()){
- memset(cur, 0, sizeof cur );
- flow += DFS(s, INF);
- }
- return flow;
- }
- };
- Dinic gao;
- int pig[maxn], pre[maxn];
- void fk()
- {
- int A, B, K;
- int s = 0, t = n + 1;
- gao.init(t+2);
- memset(pre, 0, sizeof pre );
- for(int i=1; i<=m; ++i){
- scanf("%d", &pig[i]);
- }
- for(int i=1; i<=n; ++i){
- scanf("%d", &A);
- for(int j=1; j<=A; ++j){
- scanf("%d", &K);
- if(!pre[K]){
- gao.AddEdge(s, i, pig[K]);
- }else {
- gao.AddEdge(pre[K], i, INF);
- }
- pre[K] = i;
- }
- scanf("%d", &B);
- gao.AddEdge(i, t, B);
- }
- int ans = gao.MaxFlow(s, t);
- printf("%d\n", ans);
- }
- int main()
- {
- // freopen("in.txt", "r",stdin);
- while(~scanf("%d%d", &m, &n)){
- fk();
- }
- return 0;
- }