题意
每个英雄能够杀死自己集合内的一个怪物,现在有 k k k 瓶药水,每瓶药水只能作用于一个英雄身上,使该英雄多杀一个怪物,同时每个英雄最多只能使用一瓶药水,求能够杀死的最多怪物数量。
考虑当没有 k k k 瓶药水时,建图即为超级源点 s s s 向所有英雄连容量为 1 1 1 的边,所有英雄向其集合内的怪物连容量为 1 1 1 的边,所有怪物向超级汇点 t t t 连容量为 1 1 1 的边。
由于每瓶药水仅能作用于一个英雄,且一个英雄也只能使用一瓶药水,可以从超级源点 s s s 再引出一条向限制源点 s 2 s2 s2 连容量为 k k k 的边,同时限制源点向所有英雄连容量为 1 1 1 的边。
#include <bits/stdc++.h>
#define itn int
#define int long long
#define endl "\n"
#define PII pair<int, int>
using namespace std;
const int N = 1e5 + 10;
const int M = 1e6 + 10;
const itn inf = 0x3f3f3f3f;
// const int mod = 1e9 + 7;
const int mod = 998244353;
struct Edge {
int from, to, cap, flow;
Edge(int f, int t, int c, int fl) {
from = f;
to = t;
cap = c;
flow = fl;
}
};
struct Dinic {
int n, m, s, t; //结点数,边数(包括反向弧),源点编号和汇点编号
vector<Edge> edges; //边表。edge[e]和edge[e^1]互为反向弧
vector<int> G[N]; //邻接表,G[i][j]表示节点i和第j条边在e数组中的序号
bool vis[N]; // BFS使用
int d[N]; //从起点到i的距离
int cur[N]; //当前弧下标
void clear_all(int n) {
for (int i = 0; i < n; i++)
G[i].clear();
edges.clear();
}
void clear_flow() {
int len = edges.size();
for (int i = 0; i < len; i++)
edges[i].flow = 0;
}
void add_edge(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);
d[s] = 0;
vis[s] = 1;
while (!q.empty()) {
int x = q.front();
q.pop();
int len = G[x].size();
for (int i = 0; i < len; 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, len = G[x].size();
for (int& i = cur[x]; i < len; 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;
}
int mincut() { // call this after maxflow
int ans = 0;
int len = edges.size();
for (int i = 0; i < len; i++) {
Edge& e = edges[i];
if (vis[e.from] && !vis[e.to] && e.cap > 0)
ans++;
}
return ans;
}
void reduce() {
int len = edges.size();
for (int i = 0; i < len; i++)
edges[i].cap -= edges[i].flow;
}
} dinic;
void solve() {
int n, m, k;
cin >> n >> m >> k;
int s1 = n + m + 1, s2 = n + m + 2, t = n + m + 3;
dinic.add_edge(s1, s2, k);
for (int i = 1; i <= n; i++) {
int x, op;
cin >> x;
while (x--) {
cin >> op;
dinic.add_edge(i, op + n, 1);
}
}
for (int i = 1; i <= n; i++) {
dinic.add_edge(s1, i, 1);
dinic.add_edge(s2, i, 1);
}
for (int i = 1; i <= m; i++) {
dinic.add_edge(i + n, t, 1);
}
int ans = dinic.maxflow(s1, t);
cout << ans << endl;
}
signed main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cout << fixed << setprecision(12);
// init();
int T = 1;
// cin >> T;
while (T--) {
solve();
}
return 0;
}