uva11419 SAM I AM

The world is in great danger!! Mental’s forces have returned to Earth
to eradicate humankind. Our last hope to stop this great evil is Sam
\Serious” Stone . Equipped with various powerful weapons, Serious
Sam starts his mission to destroy the forces of evil. After ghting
two days and three nights, Sam is now in front of the temple KOPTOS
where Mental’s general Ugh Zan III is waiting for him. But this time,
he has a serious problem. He is in shortage of ammo and a lot of
enemies crawling inside the temple waiting for him. After rounding the
temple Sam nds that the temple is in rectangle shape and he has the
locations of all enemies in the temple. All of a sudden he realizes
that he can kill the enemies without entering the temple using the
great cannon ball which spits out a gigantic ball bigger than him
killing anything it runs into and keeps on rolling until it nally
explodes. But the cannonball can only shoot horizontally or vertically
and all the enemies along the path of that cannon ball will be killed.
Now he wants to save as many cannon balls as possible for ghting with
Mental. So, he wants to know the minimum number of cannon balls and
the positions from which he can shoot the cannonballs to eliminate all
enemies from outside that temple. Input The input le contains several
test cases. Here, the temple is de ned as a R C grid. The rst line
of each test case contains 3 integers: R (0 < R< 1001), C (0 < C< 1001)
representing the grid of temple ( R means number of row and C means
number of column of the grid) and the number of enemies N (0 < N<
1000001) inside the temple. After that there are N lines each of which
contains 2 integers representing the position of the enemies in that
temple. Each test case is followed by a new line (except the last
one). Input is terminated when R
= C
= N
= 0. Output For each test case there will be one line output. First print the minimum number ( m ) of cannonballs needed to wipe out the
enemies followed by a single space and then m positions from which he
can shoot those cannonballs. For shooting horizontally print r '
followed by the row number and for vertical shooting print c ’
followed by the column number. If there is more than one solution any
one will do.

二分图最小覆盖+方案输出。
把行和列分别看成二分图的两部，敌人看成是边。那么每个敌人都被打到就是图的覆盖。

#include<cstdio>
#include<cstring>
#include<vector>
using namespace std;
vector<int> to[2010];
int fa[2010],r,c,n;
bool vis[2010],mark[2010];
void init()
{
    int i,j,k,x,y,z;
    for (i=1;i<=2005;i++)
      to[i].clear();
    for (i=1;i<=n;i++)
    {
        scanf("%d%d",&x,&y);
        to[x].push_back(y+r);
        to[y+r].push_back(x);
    }
}
bool dfs(int x)
{
    int i,j,k,p,q;
    mark[x]=1;
    for (i=0;i<to[x].size();i++)
    {
        p=to[x][i];
        if (!vis[p])
        {
            vis[p]=mark[p]=1;
            if (!fa[p]||dfs(fa[p]))
            {
                fa[p]=x;
                fa[x]=p;
                return 1;
            }
        }
    }
    return 0;
}
void solve()
{
    int i,j,k,ans=0;
    memset(fa,0,sizeof(fa));
    for (i=1;i<=r;i++)
    {
        memset(vis,0,sizeof(vis));
        if (dfs(i)) ans++;
    }
    printf("%d",ans);
}
void find()
{
    int i,j,k,p,q,x,y,z;
    memset(mark,0,sizeof(mark));
    for (i=1;i<=r;i++)
      if (!fa[i])
      {
        memset(vis,0,sizeof(vis));
        dfs(i);
      }
    for (i=1;i<=r;i++)
      if (!mark[i])
        printf(" r%d",i);
    for (i=1;i<=c;i++)
      if (mark[i+r])
        printf(" c%d",i);
    printf("\n");
}
int main()
{
    while (scanf("%d%d%d",&r,&c,&n)&&r&&c&&n)
    {
        init();
        solve();
        find();
    }
}