#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#include <iostream>
#include <vector>
using namespace std;
const int maxn = 1E4 + 5;
int r, c, n, x, y;
struct BPM
{
int n, m;
vector<int>G[maxn];
int left[maxn], right[maxn];
bool T[maxn], S[maxn];
BPM(int n, int m): n(n), m(m)
{
for (int i = 0; i < maxn; i++) G[i].clear();
}
void AddEdge(int u, int v)
{
G[u].push_back(v);
}
bool match(int u)
{
S[u] = true;
for (int i = 0; i < G[u].size(); i++)
{
int v = G[u][i];
if (!T[v])
{
T[v] = true;
if (left[v] == -1 || match(left[v]))
{
left[v] = u;
right[u] = v;
return true;
}
}
}
return false;
}
int solve()
{
memset(left, -1, sizeof(left));
memset(right, -1, sizeof(right));
int ans = 0;
for (int i = 0; i < n; i++)
{
memset(S, 0, sizeof(S));
memset(T, 0, sizeof(T));
if (match(i)) ans++;
}
return ans;
}
int MinCover(vector<int>&X, vector<int>&Y)
{
int ans = solve();
memset(S, 0, sizeof(S));
memset(T, 0, sizeof(T));
for (int i = 0; i < n; i++)
if (right[i] == -1) match(i);
for (int i = 0; i < n; i++)
if (!S[i]) X.push_back(i);
for (int i = 0; i < n; i++)
if (T[i]) Y.push_back(i);
return ans;
}
};
int main(int argc, char const *argv[])
{
while (~scanf("%d%d%d", &r, &c, &n) && r + c + n)
{
BPM ans(r, c);
while (n--)
{
scanf("%d%d", &x, &y);
ans.AddEdge(--x, --y);
}
vector<int>X, Y;
printf("%d", ans.MinCover(X, Y));
for (int i = 0; i < X.size(); i++)
printf(" r%d", X[i] + 1);
for (int i = 0; i < Y.size(); i++)
printf(" c%d", Y[i] + 1);
printf("\n");
}
return 0;
}
二分图的最小顶点覆盖数等于最大匹配数。
有一个矩阵中放置的一写东西,然后你有一门炮,每次能横向或纵向开一炮,是这一行所有的东西摧毁。问你最少花多少炮弹摧毁所有的东西?输出一组解构建二分图,两遍结点是行和列。若(x,y)存在东西则建边。这样问题就转化为最小点覆盖=最大匹配。
这题和POJ 3041 形似,白书上有详细解释。