题目链接
我们先来了解一下闭合图。一个节点和其所能到达的所有节点构成一个闭合图。而如果我们把所有要求都用一条有向边和其所需的人链接起来。那么我们要求的就是闭合图的最大权值。
看大佬题解
下面事ac代码:
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <map>
#include <queue>
#define ll long long
using namespace std;
const int N = 1e6+5;
const int inf = 0x3f3f3f3f;
int he[N], ne[N], ver[N], e[N];
int l[100005];
int tot = 1;
void add(int x, int y, int w)
{
ver[++tot] = y;
ne[tot] = he[x];
e[tot] = w;
he[x] = tot;
ver[++tot] = x;
ne[tot] = he[y];
e[tot] = 0;
he[y] = tot;
}
bool bfs(int s, int en)
{
memset(l, 0, sizeof(l));
queue<int> q;
q.push(s);
l[s] = 1;
while(q.size())
{
int u = q.front();
q.pop();
if (u == en) return 1;
for (int i = he[u]; i; i = ne[i])
{
int y = ver[i];
if (!l[y] && e[i])
{
l[y] = l[u] + 1;
q.push(y);
}
}
}
return 0;
}
int dfs(int u, int MaxFlow, int en)
{
if (u == en) return MaxFlow;
int uflow = 0;
for (int i = he[u]; i; i = ne[i])
{
int y = ver[i];
if (l[y] == l[u]+1 && e[i])
{
int flow = min(e[i], MaxFlow - uflow);
flow = dfs(y, flow, en);
e[i] -= flow;
e[i^1] += flow;
uflow += flow;
if (uflow == MaxFlow)
break;
}
}
if (uflow == 0)
l[u] = 0;
return uflow;
}
int Dinic(int s, int t)
{
int MaxF = 0;
while(bfs(s, t))
MaxF += dfs(s, inf, t);
return MaxF;
}
int main()
{
int n, m;
int ans = 0;
scanf("%d%d", &m, &n);
int s = 0, t = m + n + 1;
for (int i = 1; i <= m; i++)
{
int w;
scanf("%d", &w);
ans += w;
add(s, i, w);
int x;
scanf("%d", &x);
while(x)
{
add(i, m + x, inf);
scanf("%d", &x);
}
}
for (int i = 1; i <= n; i++)
{
int w;
scanf("%d", &w);
add(m+i, t, w);
}
int mx = Dinic(s, t);
printf("%d\n", ans-mx);
}