二分图最大匹配板子——匈牙利算法

匈牙利算法

匈牙利算法又称增广路算法。

仅记录板子

#include<bits/stdc++.h>
#define ios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long 
#define pii pair<int,int>

using namespace std;

const int N = 510, M = 100*N;

int n, m, s;
int e[M], ne[M], h[N], idx;
int vim[N], match[N];

void add(int a, int b){
	e[++idx] = b;
	ne[idx] = h[a];
	h[a] = idx;
} 
bool dfs(int x){
	for(int i = h[x]; ~i; i = ne[i]){
		int j = e[i];
		if(vim[j])continue;
		vim[j] = 1;
		if(!match[j] || dfs(match[j])){
			match[j] = x;
			return true;
		}
	}
	return false;
}
int main(){
	ios;
	memset(h, -1, sizeof h);
	cin >> n >> m >> s;
	for(int i = 0;i < s;i ++){
		int u, v;
		cin >> u >> v;
		add (u, v);
	}
	int ans = 0;
	for(int i = 1;i <= n;i++){
		memset(vim, 0, sizeof vim);
		if(dfs(i))ans ++;
		// cout << "ans: " << ans << "\n";
		// cout << "\n";
	}
	cout << ans << "\n";
	return 0;
}