板子题
1、建图
- 超级源点->所有外籍飞行员,权值为1
- 外籍飞行员->本土飞行员,权值为1
- 本土飞行员->超级汇点,权值为1
ACcode:Dinic的弧优化写法
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, n) for (int i = a; i <= n; i++)
#define per(i, a, n) for (int i = n; i >= a; i--)
#define lowbit(x) ((x) & -(x))
#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
#define mem(a, b) memset(a, b, sizeof(a))
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const double PI = acos(-1.0);
const int inf = 0x3f3f3f3f, N = 50010, M = 300010;
struct edge{
int v,w,next;
}e[M];
int head[N],d[N],now[N];
int n,m,tot,maxflow;
queue<int>q;
void add(int u,int v,int w){
e[++tot].v = v, e[tot].w = w, e[tot].next = head[u], head[u] = tot;
e[++tot].v = u, e[tot].w = 0, e[tot].next = head[v], head[v] = tot;
}
bool bfs(int s,int t){
mem(d,0);
while(q.size()) q.pop();
q.push(s);
d[s] = 1;
now[s] = head[s];
while(q.size()){
int u = q.front(); q.pop();
for(int i = head[u]; ~i; i = e[i].next){
int v = e[i].v, w = e[i].w;
if(d[v] == 0 && w){
q.push(v);
now[v] = head[v];
d[v] = d[u] + 1;
if(v == t) return 1;
}
}
}
return 0;
}
int dfs(int u,int t,int flow){
if(u == t) return flow;
int rest = flow, k, i;
for(i = now[u]; (~i) && rest ; i = e[i].next){
int v = e[i].v , w = e[i].w;
if(w && d[v] == d[u] + 1){
k = dfs(v,t,min(rest ,w));
if(!k) d[v] = 0;
e[i].w -= k;
e[i^1].w += k;
rest -= k;
}
}
now[u] = i;
return flow - rest;
}
int dinic(int s,int t){
int res = 0,flow = 0;
maxflow = 0;
while(bfs(s,t)){
while(flow = dfs(s,t,inf))
res += flow;
}
return res;
}
int main()
{
mem(head,-1);
tot = 1;
int m,n;
scanf("%d%d",&m,&n);
int u,v;
while(~scanf("%d%d",&u,&v)){
if(u == -1 && v == -1) break;
add(u,v,1);
}
rep(i,1,m) add(0,i,1);
rep(i,m+1,n) add(i,n+1,1);
int ans = dinic(0,n+1);
printf("%d\n",ans);
int cnt = 0;
rep(i,1,m){
for(int j = head[i]; ~j ; j = e[j].next){
if(e[j].w == 0 && e[j].v != n + 1 && e[j].v != 0){
++cnt;
printf("%d %d\n",i,e[j].v);
}
}
}
return 0;
}