861. 二分图的最大匹配

#include<cstring>
#include<iostream>
#include<algorithm>
#include<cstdio>

using namespace std;

const int N = 100010;

int n1, n2, m;

int match[N];

bool st[N];

int h[N],e[N],ne[N],idx;

void add(int a, int b)
{
    e[idx] = b, ne[idx] = h[a], h[a] = idx ++;
}

bool find(int x)
{
    for(int i = h[x]; i != -1; i = ne[i])
    {
        int j = e[i];
        if(!st[j])
        {
            st[j] = true;
            if(match[j] == 0 || find(match[j]))
            {
                match[j] = x;
                return true;
            }
        }
    }
    
    return false;
}

int main()
{
    cin >> n1 >> n2 >> m;
    memset(h, -1, sizeof h);
    
    while(m --)
    {
        int a, b;
        cin >> a >> b;
        
        add(a, b);
    }
    
    int ans = 0;
    
    for(int i = 1; i <= n1; i ++)
    {
        memset(st,false, sizeof st);
        
        if(find(i)) ans ++;
    }
    
    cout << ans << endl;
    
    return 0;
}//来自acwing