P3386 【模板】二分图最大匹配

【模板】二分图最大匹配 - 洛谷https://www.luogu.com.cn/problem/P3386

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <cmath>
#include <map>
#include <bitset>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 1e6 + 10;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)
#define lowbit(x) ((x)&(-x))
//using P = pair<int, int>;


const int N = 5e5 + 5;
int ver[N];
int head[N];
int nxt[N];
int cnt;
int n, m, e;
int mc[N];
int vis[1005];
void add(int x, int y) {
	ver[++cnt] = y;
	nxt[cnt] = head[x];
	head[x] = cnt;
}

bool dfs(int p) {
	for (int i = head[p]; i; i = nxt[i]) {
		int v = ver[i];
		if (!vis[v]) {
			vis[v] = 1;
			if (mc[v] == 0 || dfs(mc[v])) {
				mc[v] = p;
				return true;
			}
		}
	}
	return false;
}

int match() {
	int cnt = 0;
	for (int i = 1; i <= n; i++) {
		memset(vis, 0, sizeof(vis));
		if (dfs(i))
			cnt++;
	}
	return cnt;
}

int main() {
//	int n,m,e;
	scanf("%d%d%d", &n, &m, &e);
	for (int i = 1; i <= e; i++) {
		int x, y;
		scanf("%d %d", &x, &y);
		add(x, n + y);
	}
	printf("%d\n", match());
	return 0;
}