[网络流24题]飞行员配对方案问题——最大二分图匹配

题目大意：

裸的最大二分图匹配。

思路:

同上

/*===========================================
 * Author : ylsoi
 * Problem : luogu2756
 * Algorithm : Graph Matching or Max Flow
 * Time : 2018.6.19
 * ========================================*/
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<climits>
using namespace std;
void File(){
    freopen("luogu2756.in","r",stdin);
    freopen("luogu2756.out","w",stdout);
}
template<typename T>bool chkmax(T &_,T __){return _<__ ? (_=__,1) : 0;}
template<typename T>bool chkmin(T &_,T __){return _>__ ? (_=__,1) : 0;}
#define REP(i,a,b) for(register int i=a;i<=b;++i)
#define DREP(i,a,b) for(register int i=a;i>=b;--i)
#define MREP(i,x) for(register int i=beg[x];i;i=E[i].last)
#define mem(a) memset(a,0,sizeof(a))
#define ll long long
#define inf INT_MAX
const int maxn=100+10;
int n,m,ans,beg[maxn],cnte,be[maxn];
bool vis[maxn];
struct edge{int to,last;}E[maxn*maxn];
void add(int u,int v){
    ++cnte;
    E[cnte].to=v;
    E[cnte].last=beg[u];
    beg[u]=cnte;
}
void init(){
    scanf("%d%d",&n,&m);
    while(1){
        int u,v;
        scanf("%d%d",&u,&v);
        if(u==-1 && v==-1)break;
        add(u,v);
    }
}
bool dfs(int u){
    MREP(i,u){
        int v=E[i].to;
        if(vis[v])continue;
        vis[v]=1;
        if(!be[v] || dfs(be[v])){
            be[v]=u;
            return true;
        }
    }
    return false;
}
int main(){
    File();
    init();
    REP(i,1,n){
        mem(vis);
        ans+=dfs(i);
    }
    printf("%d\n",ans);
    REP(i,1,m)if(be[i])
        printf("%d %d\n",be[i],i);
    return 0;
}