题目:
W 教授正在为国家航天中心计划一系列的太空飞行。每次太空飞行可进行一系列商业性实验而获取利润。现已确定了一个可供选择的实验集合E={E1,E2,…,Em},和进行这些实验需要使用的全部仪器的集合I={I1,I2,…In}。实验Ej需要用到的仪器是I的子集RjÍI。配置仪器Ik的费用为ck美元。实验Ej的赞助商已同意为该实验结果支付pj美元。W教授的任务是找出一个有效算法,确定在一次太空飞行中要进行哪些实验并因此而配置哪些仪器才能使太空飞行的净收益最大。这里净收益是指进行实验所获得的全部收入与配置仪器的全部费用的差额。
对于给定的实验和仪器配置情况,编程找出净收益最大的试验计划。
分析:
这是一道最大权闭合图模板题,关于最大权闭合图,可参见:https://www.cnblogs.com/TreeDream/p/5929429.html 和 http://www.cnblogs.com/wuyiqi/archive/2012/03/12/2391960.html
跑完最大流后,S点能到的点,就是要找的最大权闭合图。也就是dep不为-1的点。
代码:
#include <bits/stdc++.h>
using namespace std;
#define ms(a,b) memset(a,b,sizeof(a))
#define lson rt*2,l,(l+r)/2
#define rson rt*2+1,(l+r)/2+1,r
typedef unsigned long long ull;
typedef long long ll;
const int MAXN = 205;
const int MAXM = 60005;
const double EPS = 1e-8;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
struct Edge {
int to, next, cap, flow;
} edge[MAXM];
int tot, head[MAXN];
int Q[MAXN], cur[MAXN], dep[MAXN];
int n, m, S, T, N;
void init() {
tot = 2;
memset(head, -1, sizeof head);
}
void addedge(int u, int v, int w, int rw = 0) {
edge[tot].to = v; edge[tot].cap = w; edge[tot].flow = 0;
edge[tot].next = head[u]; head[u] = tot++;
edge[tot].to = u; edge[tot].cap = rw; edge[tot].flow = 0;
edge[tot].next = head[v]; head[v] = tot++;
}
bool bfs(int s, int t, int n) {
int Front = 0, tail = 0;
memset(dep, -1, sizeof(dep[0]) * (n + 1));
dep[s] = 0;
Q[tail++] = s;
while (Front < tail) {
int u = Q[Front++];
for (int i = head[u]; i != -1; i = edge[i].next) {
int v = edge[i].to;
if (edge[i].cap > edge[i].flow && dep[v] == -1) {
dep[v] = dep[u] + 1;
if (v == t) return true;
Q[tail++] = v;
}
}
}
return false;
}
int dfs(int u, int f) {
if (u == T) return f;
int used = 0, rflow = 0;
for (int i = cur[u]; i != -1; i = edge[i].next) {
cur[u] = i;
int v = edge[i].to, w = edge[i].cap - edge[i].flow;
if (w > 0 && dep[v] == dep[u] + 1) {
if ((rflow = dfs(v, min(w, f - used)))) {
used += rflow;
edge[i].flow += rflow;
edge[i ^ 1].flow -= rflow;
if (used == f) break;
}
}
}
if (!used) dep[u] = -1;
return used;
}
int dinic(int s, int t, int n) {
int maxflow = 0;
while (bfs(s, t, n)) {
for (int i = 0; i <= n; i++) cur[i] = head[i];
maxflow += dfs(s, INF);
}
return maxflow;
}
int main() {
ios::sync_with_stdio(false);
// freopen("1.txt","r",stdin);
cin >> m >> n;
init();
S = n + m + 1, T = n + m + 2, N = n + m + 2;
int sum = 0;
for (int i = 1; i <= m; i++) {
int x; cin >> x;
sum += x;
addedge(S, i, x);
char tools[10000];
ms(tools, 0);
cin.getline(tools, 10000);
int ulen = 0, tool;
while (sscanf(tools + ulen, "%d", &tool) == 1) {
addedge(i, m + tool, INF);
if (tool == 0) {
ulen++;
} else {
while (tool) {
tool /= 10;
ulen++;
}
}
}
ulen++;
}
for (int i = 1; i <= n; i++) {
int x; cin >> x;
addedge(m + i, T, x);
}
int ans = sum - dinic(S, T, N);
// set<int> tl; tl.clear();
// for(int i=head[S];i!=-1;i=edge[i].next){
// if(edge[i].cap > edge[i].flow){
// int v = edge[i].to;
// cout << v << " ";
// for(int j=head[v];j!=-1;j=edge[j].next){
// if(edge[j].to <= m+n){
// tl.insert(edge[j].to-m);
// }
// }
// }
// }
// cout << endl;
// for(auto x: tl){
// cout << x << " ";
// }
for(int i=1;i<=m;i++){
if(dep[i]!=-1){
cout << i << " " ;
}
}
cout << endl;
for(int i=m+1;i<=m+n;i++){
if(dep[i]!=-1){
cout << i-m << " ";
}
}
cout << endl << ans << endl;
return 0;
}