题意:给定两种飞行员,两种飞行员之间某些飞行员可以相互配合,求最多有多少对飞行员相互配合,并输出方案。
二分图最大匹配问题,将两种飞行员视为二分图中的两个集合,如果飞行员Ai与飞行员Bj可以配合,则连一条从Ai到Bj的边。
用最大流做的话,Ai->Bj的流量为1,同时建立超级源S与超级汇T,S向A集合中的每个飞行员连边,B集合中的每个飞行员向T连边,流量均为1。
然后跑一边最大流就可以了。
输出方案:在残量网络中,如果存在一条边k,连接i与j飞行员,且流满(剩余流量=0),那么该边的配对即为方案中的配对。
code:
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <queue>
#include <map>
#include <vector>
using namespace std;
#define rep(i, l, r) for (int i = l; i <= r; i++)
#define REP(i, l, r) for (int i = l; i >= r; i--)
#define X first
#define Y second
#define P puts("OK");
#define INF 19971228
#define MAXN 1010
int n, N = -1, first[MAXN], next[MAXN], sa, sb, S, T, dis[MAXN], m;
struct tlist {int x, y, f;} a[MAXN];
queue<int> q;
inline int min(int a, int b) {return a<b ? a : b;}
inline int max(int a, int b) {return a>b ? a : b;}
inline void swap(int &a, int &b) {int t = a; a = b; b = t;}
void setIO() {
freopen("data.in", "r", stdin);
freopen("data.out", "w", stdout);
}
inline void add(int x, int y, int f) {
a[++N].x = x, a[N].y = y, a[N].f = f, next[N] = first[x], first[x] = N;
a[++N].x = y, a[N].y = x, a[N].f = 0, next[N] = first[y], first[y] = N;
}
inline bool bfs() {
while (!q.empty()) q.pop();
memset(dis, -1, sizeof(dis));
dis[S] = 0;
q.push(S);
while (!q.empty()) {
int x = q.front();
q.pop();
for (int i = first[x]; ~i; i = next[i])
if (a[i].f && (dis[a[i].y] == -1)) {
dis[a[i].y] = dis[a[i].x] + 1;
q.push(a[i].y);
}
}
return ~dis[T];
}
inline int find(int x, int low) {
if (x == T) return low;
int temp, sum = 0;
for (int i = first[x]; ~i && (low-sum > 0); i = next[i])
if ((a[i].f) && (dis[a[i].y] == dis[a[i].x] + 1) && (temp = find(a[i].y, min(low-sum, a[i].f)))) {
a[i].f -= temp;
a[i^1].f += temp;
sum += temp;
}
return sum;
}
inline int dinic(int begin, int end) {
S = begin, T = end;
int ans = 0, temp;
while (bfs())
while (temp = find(S, 0x7fffffff))
ans += temp;
return ans;
}
int main() {
setIO();
memset(first, -1, sizeof(first));
memset(next, -1, sizeof(next));
cin >> sa >> sb;
n = sa + sb;
int tx, ty;
while (scanf("%d%d", &tx, &ty)) {
if (!~tx) break;
add(tx, sa + ty, 1);
}
rep(i, 1, sa) add(0, i, 1);
rep(i, 1, sb) add(sa+i, n+1, 1);
int out = dinic(0, n+1);
if (!out) {
puts("No Solution!");
return 0;
}
else cout << out << endl;
rep(i, 0, N)
if ((min(a[i].x, a[i].y)) && (max(a[i].x, a[i].y) != (n+1)) && (a[i].x < a[i].y) && (!a[i].f))
printf("%d %d\n", a[i].x, a[i].y - sa);
return 0;
}