题目链接:https://www.luogu.org/problem/P3410
裸的最大权闭合子图:
要获得每个人的钱有个必要条件:带齐这个人要求的人。每个人和他要求的人连一条有向边构成图,会发现最优解保留的点是一个最大权闭合子图。每个人和原点S建一条边容量为得到的钱,每个下属和T建一条边容量为要付的钱,原图的边保留,容量为无穷,跑最大流,用所有得到的钱减去最大流得到答案
#include<bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
const int maxm = 6e5 + 10;
const int inf = 0x3f3f3f3f;
struct ss{
int u,v,w,nxt;
}edg[maxm];
int head[maxn],cnt,d[maxn],n,m,a[maxn];
void init() {
cnt = 0;
memset(head,-1,sizeof head);
}
void add(int u,int v,int w) {
edg[cnt].u = u;
edg[cnt].v = v;
edg[cnt].w = w;
edg[cnt].nxt = head[u];
head[u] = cnt++;
}
bool bfs(int s,int t) {
queue<int> q;
memset(d,0,sizeof d);
q.push(s);d[s] = 1;
while(!q.empty()) {
int top = q.front();
q.pop();
for(int i = head[top]; i + 1; i = edg[i].nxt) {
int v = edg[i].v,w = edg[i].w;
if(w && !d[v]) {
d[v] = d[top] + 1;
q.push(v);
}
}
}
return d[t] > 0;
}
int dfs(int s,int t,int inflow) {
if(s == t || !inflow) return inflow;
int flow = 0;
for(int i = head[s]; i + 1; i = edg[i].nxt) {
int v = edg[i].v,w = edg[i].w;
if(w && d[v] == d[s] + 1) {
int x = dfs(v,t,min(w,inflow));
inflow -= x;flow += x;
edg[i].w -= x;edg[i ^ 1].w += x;
if(!inflow) break;
}
}
if(flow == 0) d[s] = -2;
return flow;
}
int dinic(int s,int t) {
int ans = 0;
while(bfs(s,t)) ans += dfs(s,t,inf);
return ans;
}
int main() {
init();
scanf("%d%d",&m,&n);
int s = 0,t = n + m + 1;
int x,sum = 0;
for(int i = 1; i <= m; i++) {
scanf("%d",&x);
while(scanf("%d",&a[i]) && a[i]) {
add(i + n,a[i],inf);
add(a[i],i + n,0);
}
add(s,i + n,x);
add(i + n,s,0);
sum += x;
}
for(int i = 1; i <= n; i++) {
scanf("%d",&a[i]);
add(i,t,a[i]);
add(t,i,0);
}
sum -= dinic(s,t);
printf("%d\n",sum);
return 0;
}