HihoCoder 1122 二分图二•二分图最大匹配之匈牙利算法

模板Orz

#include <bits/stdc++.h>

using namespace std;

#define se second
#define fi first
#define ll long long
#define pb push_back
#define CLR(a,b) memset(a,(b),sizeof(a))
const int MAXN = (int)1e3+10;

int k, m, n;
int E[MAXN][MAXN];
bool used[MAXN];
int bl[MAXN];
bool find(int u) {
    for(int i = 1; i <= n; ++i) {
        if(used[i]==false && E[u][i]) {
            used[i] = true;
            if(bl[i]==0 || find(bl[i])) {
                bl[i] = u;
                return true;
            }
        }
    }
    return false;
}
int main() {
    ios::sync_with_stdio(false);
    CLR(bl, 0);
    int p, x; cin >> n >> m;
    for(int i = 1; i <= m; ++i) {
        int u, v;
        cin >> u >> v;
        E[u][v] = true;
        E[v][u] = true;
    }
    int ans = 0;
    for(int i = 1; i <= n; ++i) {
        CLR(used, false);
        if(find(i)) ans++;
    }
    cout << ans/2 << endl;

    return 0;
}