【hiho】hiho第三十一周·二分图最大匹配，一些基础结论也会在此更新

#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <string>
#include <math.h>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <set>
#pragma warning(disable:4996)

#define Zero(a) memset(a, 0, sizeof(a))
#define Neg(a)  memset(a, -1, sizeof(a))
#define All(a) a.begin(), a.end()
#define PB push_back
#define repf(i,a,b) for(i = a;i <= b; i++)
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define root 1,n,1
#define ld rt << 1
#define rd rt << 1 | 1
#define ll long long
#define MAXN 1005
#define mod 10007
using namespace std;

int linker[MAXN];
bool used[MAXN];
vector<int>mp[MAXN];
int uN;

bool dfs(int u){
    for (int i = 0; i<mp[u].size(); i++){
        if (!used[mp[u][i]])        {
            used[mp[u][i]] = true;
            if (linker[mp[u][i]] == -1 || dfs(linker[mp[u][i]]))            {
                linker[mp[u][i]] = u;
            return true;
            }
        }
    }
    return false;
}
int hungary()
{
    int u;
    int res = 0;
    memset(linker, -1, sizeof(linker));
    for (u = 1; u <= uN; u++)    {
        memset(used, false, sizeof(used));
        if (dfs(u)) res++;
    }
    return res;
}
int main(){
    int k;
    while (~scanf("%d%d", &uN, &k)){
        for (int i = 1; i <= uN; ++i){
            mp[i].clear();
        }
        int u, v;
        while (k--){
            scanf("%d%d", &u, &v);
            mp[u].push_back(v);
            mp[v].push_back(u);
        }
        printf("%d\n%d\n", hungary() / 2, uN - hungary() / 2);
    }
    return 0;
}