POJ 1149 PIGS 解题报告

 可以将每个顾客能打开的猪圈合并为一个，如果其中一个已经被合并过，则加一条由此猪圈 到 之前拥有这个猪圈钥匙的顾客的猪圈，容量为无穷。这样我们就可以得到一个带s,t,和 N个中间节点的流量图。然后求最大流即可。

#include <vector> #include <iostream> #include <string.h> using namespace std; const int M(1100),N(110),INF(0x7fffffff); bool v[M]; vector<int> pile[M]; int net[N][N],st[N],path[N],flow[N],pighouse[M]; int bfs(int s,int t) { int top,end,now; top = end = 0; st[end++] = s; memset(path,-1,sizeof(path)); path[s] = s; while(top < end) { now = st[top++]; if(now == t) return flow[now]; for(int i = 0; i <= t; i++) if(path[i] == -1 && net[now][i]) { flow[i] = min(flow[now],net[now][i]); path[i] = now; st[end++] = i; } } return -1; } int Edmonds_karp(int s,int t) { int sum(0),now,tmp; while(true) { tmp = bfs(s,t); if(tmp == -1) break; sum += tmp; now = t; while(now != s) { net[path[now]][now] -= tmp; net[now][path[now]] += tmp; now = path[now]; } } return sum; } bool init(int &m,int &n,int &des) { int many,buy; if(!(cin >> m >> n)) return false; memset(v,false,sizeof(v)); memset(net,0,sizeof(net)); flow[0] = INF; des = n + 1; for(int i = 1; i <= m; i++) cin >> pighouse[i]; for(int i = 1; i <= n; i++) { cin >> many; for(int j = 0; j < many; j++) { cin >> buy; if(v[buy]) { for(int k = 0; k < pile[buy].size();k++) net[i][pile[buy][k]] = INF; pile[buy].push_back(i); } else { v[buy] = true; pile[buy].push_back(i); net[i][des] += pighouse[buy]; } } cin >> net[0][i]; } return true; } int main() { int m,n,des; while(init(m,n,des)) cout << Edmonds_karp(0,des) << endl; return 0; }