题意
传送门 UVa 10779 Collectors Problem
题解
除源汇点外,对于人与物品分别建立 n , m n,m n,m 个节点。 C [ i ] [ j ] C[i][j] C[i][j] 代表人 i i i 持有物品 j j j 的数量。Bob 若持有物品 j j j,则 s → j s\rightarrow j s→j 连一条容量为 C [ 0 ] [ j ] C[0][j] C[0][j] 的边;所有种类物品向 t t t 连一条容量为 1 1 1 的边。除了 Bob 以外的人 i i i,若 C [ i ] [ j ] = 0 C[i][j]=0 C[i][j]=0,则 i → j i\rightarrow j i→j 连一条容量为 1 1 1 的边,若 C [ i ] [ j ] > 1 C[i][j]>1 C[i][j]>1,则 i → j i\rightarrow j i→j 连一条容量为 C [ i ] [ j ] − 1 C[i][j]-1 C[i][j]−1 的边。
此时任一员会间单位流量,代表了一个交换方案,或不交换。Dinic 跑最大流即可。
#include <bits/stdc++.h>
using namespace std;
constexpr int MAXN = 15, MAXM = 30;
constexpr int MAXV = 55, INF = 0x3f3f3f3f;
int T, N, M, V;
int C[MAXN][MAXM];
struct edge
{
int to, cap, rev;
};
vector<edge> G[MAXV];
int iter[MAXV], level[MAXV];
void add_edge(int from, int to, int cap)
{
G[from].push_back({to, cap, (int)G[to].size()});
G[to].push_back({from, 0, (int)G[from].size() - 1});
}
void bfs(int s)
{
for (int v = 0; v < V; ++v)
level[v] = -1;
queue<int> q;
level[s] = 0;
q.push(s);
while (q.size())
{
int v = q.front();
q.pop();
for (auto &e : G[v])
if (e.cap > 0 && level[e.to] == -1)
level[e.to] = level[v] + 1, q.push(e.to);
}
}
int dfs(int v, int t, int f)
{
if (v == t)
return f;
for (int &i = iter[v]; i < G[v].size(); ++i)
{
auto &e = G[v][i];
if (e.cap > 0 && level[e.to] > level[v])
{
int d = dfs(e.to, t, min(f, e.cap));
if (d > 0)
{
e.cap -= d;
G[e.to][e.rev].cap += d;
return d;
}
}
}
return 0;
}
int max_flow(int s, int t)
{
int flow = 0;
for (;;)
{
bfs(s);
if (level[t] == -1)
return flow;
for (int v = 0; v < V; ++v)
iter[v] = 0;
int f;
while ((f = dfs(s, t, INF)) > 0)
flow += f;
}
}
int main()
{
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> T;
for (int tt = 1; tt <= T; ++tt)
{
cin >> N >> M;
memset(C, 0, sizeof(C));
for (int i = 0; i < N; ++i)
{
int k;
cin >> k;
for (int j = 0; j < k; ++j)
{
int t;
cin >> t;
++C[i][t - 1];
}
}
int s = N + M, t = s + 1;
V = t + 1;
for (int v = 0; v < V; ++v)
G[v].clear();
for (int j = 0; j < M; ++j)
if (C[0][j] > 0)
add_edge(s, N+j, C[0][j]);
for (int i = 0; i < M; ++i)
add_edge(N + i, t, 1);
for (int i = 1; i < N; ++i)
for (int j = 0; j < M; ++j)
{
if (C[i][j] == 0)
add_edge(N + j, i, 1);
else if (C[i][j] > 1)
add_edge(i, N + j, C[i][j] - 1);
}
cout << "Case #" << tt << ": " << max_flow(s, t) << '\n';
}
return 0;
}