题意:
一架飞机要起飞需要一名外籍飞行员和一名英国飞行员配合,英国飞行员u可以和外籍飞行员v配合,求最多能有多少架飞机起飞
题解:
显然是二分图最大匹配
#include<iostream>
#include<sstream>
#include<string>
#include<queue>
#include<map>
#include<unordered_map>
#include<set>
#include<vector>
#include<stack>
#include <utility>
#include<list>
#include<bitset>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<iomanip>
#include<time.h>
#include<random>
using namespace std;
#include<ext/pb_ds/priority_queue.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
using namespace __gnu_pbds;
#include<ext/rope>
using namespace __gnu_cxx;
#define int long long
#define PI acos(-1.0)
#define eps 1e-9
#define lowbit(a) ((a)&-(a))
const int mod = 1e9+7;
int qpow(int a,int b){
int ans=1;
while(b){
if(b&1)ans=(ans*a)%mod;
a=(a*a)%mod;
b>>=1;
}
return ans;
}
const int INF = 0x3f3f3f3f;
const int N = 1e6+10;
int n,m;
struct edge{
int to,next;
}e[N];
int head[N],k;
int linker[N],vis[N];
void add(int u,int v){
e[++k].to=v;
e[k].next=head[u];
head[u]=k;
}
bool find(int u){
for(int i=head[u];i;i=e[i].next){
int v=e[i].to;
if(!vis[v]){
vis[v]=1;
if(!linker[v]||find(linker[v])){
linker[v]=u; linker[u]=v;
return 1;
}
}
}
return 0;
}
int solve(){
int ans=0;
for(int i=1;i<=n;i++){
memset(vis,0,sizeof vis);
if(!linker[i]&&find(i))ans++;
}
return ans;
}
signed main(){
std::ios::sync_with_stdio(false);
cin.tie(0),cout.tie(0);
cin>>n>>m;
m-=n;
int u,v;
while(cin>>u>>v){
if(u==-1&&v==-1)break;
add(u,v); add(v,u);
}
int ans=solve();
cout<<ans<<endl;
for(int i=1;i<=n;i++){
if(linker[i])cout<<i<<" "<<linker[i]<<endl;
}
}