E - Swap(匈牙利)

Given an N*N matrix with each entry equal to 0 or 1. You can swap any two rows or any two columns. Can you find a way to make all the diagonal entries equal to 1?
Input
There are several test cases in the input. The first line of each test case is an integer N (1 <= N <= 100). Then N lines follow, each contains N numbers (0 or 1), separating by space, indicating the N*N matrix.
Output
For each test case, the first line contain the number of swaps M. Then M lines follow, whose format is “R a b” or “C a b”, indicating swapping the row a and row b, or swapping the column a and column b. (1 <= a, b <= N). Any correct answer will be accepted, but M should be more than 1000.

If it is impossible to make all the diagonal entries equal to 1, output only one one containing “-1”.
Sample Input

2
0 1
1 0
2
1 0
1 0

Sample Output

1
R 1 2
-1

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
using namespace std;
int n;
int ma[121][121];
bool v[121];
int match[121];
int sx[12112], sy[12112];
bool bfs(int x)
{
   for(int i=1;i<=n;i++)
   {
     if(ma[x][i]==1&&v[i]==false)
     {
       v[i] = true;
       if(match[i]==-1||bfs(match[i]))
       {
          match[i] = x;
          return true;
       }
     }
   }
   return false;
}
int XYL()
{
   memset(match, -1, sizeof(match));
   int res = 0;
   for(int i=1;i<=n;i++)
   {
       memset(v, false, sizeof(v));
       if(bfs(i))
       res++;
   }
   return res;
}
int main()
{
  while(~scanf("%d", &n))
  {
     int top = 0;
     for(int i=1;i<=n;i++)
     {
        for(int j=1;j<=n;j++)
        {
          scanf("%d", &ma[i][j]);
        }
     }
     if(n>XYL())
     printf("-1\n");
     else
     {
        //交换
        int i, j;
        for(i=1;i<=n;i++)
        {
          for(j=i;j<=n;j++)
          {
            if(match[j]==i)
            break;
          }
           if(j!=i)
            {
               sx[top] = i;
               sy[top++] = j;
               int temp;
               temp = match[i];
               match[i] = match[j];
               match[j] = temp;
            }
        }
        printf("%d\n", top);
        for(int i=0;i<top;i++)
        printf("C %d %d\n", sx[i], sy[i]);
     }
  }
  return 0;
}