二分图多重匹配问题,建图方式如下:
①超级源点S往所有X集合的点建边,边权为点权
②所有Y集合的点往超级汇点T建边,边权为点权
③二分图中原有的边依旧存在,边权为1(如果该边能使用多次,那么边权为使用次数)
求得最大流就是最大匹配的值,从X集合往Y集合的所有满流边就是方案安排。
本题中如果最大流等于总人数证明有解。
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
const int INF = 0x3f3f3f3f;
struct Edge
{
int from, to, cap, flow; //起点,终点,容量,流量
Edge(int u, int v, int c, int f) : from(u), to(v), cap(c), flow(f) {}
};
struct Dinic
{
int n, m, s, t; //结点数,边数(包括反向弧),源点s,汇点t
vector<Edge> edges; //边表。edges[e]和edges[e^1]互为反向弧
vector<int> G[MAXN]; //邻接表,G[i][j]表示结点i的第j条边在edges数组中的序号
int d[MAXN]; //从起点到i的距离(层数差)
int cur[MAXN]; //当前弧下标
bool vis[MAXN]; //BFS分层使用
void init(int n)
{
this->n = n;
edges.clear();
for (int i = 0; i <= n; i++) G[i].clear();
}
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;
d[s] = 0;
vis[s] = true;
Q.push(s);
while (!Q.empty())
{
int x = Q.front(); Q.pop();
for (int i = 0; i < G[x].size(); i++)
{
Edge& e = edges[G[x][i]];
if (!vis[e.to] && e.cap > e.flow)
{
vis[e.to] = true;
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;
for (int& i = cur[x]; i < G[x].size(); 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 max_flow(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;
}
}solve;
int n, m;
int main()
{
scanf("%d%d", &m, &n);
solve.init(m+n+2);
int s = 0, t = m+n+1;
int sum = 0;
for (int i = 1; i <= m; i++)
{
int x; scanf("%d", &x);
solve.add_edge(s, i, x);
sum += x;
}
for (int i = 1; i <= n; i++)
{
int x; scanf("%d", &x);
solve.add_edge(i+m, t, x);
}
for (int i = 1; i <= m; i++)
{
for (int j = 1; j <= n; j++)
{
solve.add_edge(i, j+m, 1);
}
}
int ans = solve.max_flow(s, t);
if (ans != sum) { printf("0\n"); return 0; }
printf("1\n");
for (int i = 1; i <= m; i++)
{
for (int j = 0; j < solve.G[i].size(); j++)
{
Edge& e = solve.edges[solve.G[i][j]];
if (e.flow == 1) printf("%d ", e.to-m);
}
printf("\n");
}
return 0;
}
/*
4 5
4 5 3 5
3 5 2 6 4
*/