C++ 代码

#include <bits/stdc++.h>
using namespace std;
const int N = 1000010;
int match[N],n,m,k,res = 0;
bool st[N];
bool g[1010][1010];

bool find(int x)
{
    for(int i = 1;i <= m;i++)
    {
        if(!st[i]&&g[x][i])
        {
            st[i] = true;
            if(match[i] == 0||find(match[i]))
            {
                match[i] = x;
                return true;
            }
        }
    }
    return false;
}

int main()
{

    while(cin >> n >> m >> k)
    {
        memset(g,0,sizeof g);
        memset(match,0,sizeof match);
        while(k--)
        {
            int t,a,b;
            cin >> t >> a >> b;
            if(!a||!b)
            {
                continue;
            }
            g[a][b] = true;
        }
        int res = 0;
        for(int i = 1;i <= n;i++)
        {
            memset(st,0,sizeof st);
            if(find(i))
            {
                res++;
            }
        }
        cout << res << endl;
    }

}