hdu 2819(二分匹配)

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>[
using namespace std;
#define MAXN 111
int n,x;
int map[MAXN][MAXN];
bool mark[MAXN];
int row[MAXN];
int ly[MAXN];

bool dfs(int u){
for(int i=1;i<=n;i++){
if(map[u][i]&&!mark[i]){
mark[i]=true;
if(ly[i]==-1||dfs(ly[i])){
ly[i]=u;
return true;
}
}
}
return false;
}

bool MaxMatch(){
memset(ly,-1,sizeof(ly));
for(int i=1;i<=n;i++){
memset(mark,false,sizeof(mark));
if(!dfs(i))return false;
}
return true;
}

int main(){
//   freopen("1.txt","r",stdin);
while(~scanf("%d",&n)){
memset(map,0,sizeof(map));
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
scanf("%d",&x);
map[j][i]=x;
}
}
if(!MaxMatch()){ puts("-1");continue; }
for(int i=1;i<=n;i++){
for(int j=i;j<=n;j++){
if(ly[j]==i){ row[i]=j;swap(ly[j],ly[i]);break; }
}
}
printf("%d\n",n);
for(int i=1;i<=n;i++)
printf("R %d %d\n",i,row[i]);
}
return 0;
}