HDU 1151 Air Raid (最小路径覆盖数 = 顶点数 - 最大匹配数)

https://cn.vjudge.net/contest/68127#problem/J

最小顶点覆盖的孪生问题，如何选择最少的路径使得选中的路径经过图中所有顶点

一般都是单向无环图，这样比较容易建立二分图，，，

所以直接建立二分图即可，这样就可以进行求解，证明不论

最小顶点覆盖 = 最大匹配数

最小路径覆盖 = n（定点数） - 最大匹配数

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#define ll long long
#define mod 1000000007
#define inf 0x3f3f3f3f
using namespace std;
const int maxn = 1505;
char a[maxn][maxn];
int mx[maxn], my[maxn];
int dx[maxn], dy[maxn];
int link[maxn];
bool vis[maxn];
int head[maxn];
int cnt;
int dis;
int n, m, k;
struct node
{
    int to, next;
}e[maxn*maxn];
void init()
{
    cnt = 0;
    memset(head, -1, sizeof(head));
    memset(link, -1, sizeof(link));
    memset(mx, -1, sizeof(mx));
    memset(my, -1, sizeof(my));
}
void addedge(int u, int v)
{
    e[cnt].to = v;
    e[cnt].next = head[u];
    head[u] = cnt ++;
}
bool searchP()
{
    queue<int> q;
    dis = inf;
    memset(dx, -1, sizeof(dx));
    memset(dy, -1, sizeof(dy));
    for(int i = 1; i <= n; i ++)
    {
        if(mx[i] == -1)
        {
            q.push(i);
            dx[i] = 0;
        }
    }
    while(! q.empty())
    {
        int u = q.front();
        q.pop();
        if(dx[u] > dis) break;
        //int sz = G[u].size();
        for(int i = head[u]; ~i; i = e[i].next)
        {
            //int v = G[u][i];
            int v = e[i].to;
            if(dy[v] == -1)
            {
                dy[v] = dx[u] + 1;
                if(my[v] == -1) dis = dy[v];
                else
                {
                    dx[my[v]] = dy[v] + 1;
                    q.push(my[v]);
                }
            }
        }
    }
    return dis != inf;
}
bool dfs(int u)
{
    for(int i = head[u]; ~i; i = e[i].next)
    {
        int v = e[i].to;
        if(! vis[v] && dy[v] == dx[u] + 1)
        {
            vis[v] = 1;
            if(my[v] != -1 && dy[v] == dis) continue;
            if(my[v] == -1 || dfs(my[v]))
            {
                my[v] = u;
                mx[u] = v;
                return 1;
            }
        }
    }
    return 0;
}
//int num[maxn][maxn];
int lab[maxn][maxn];
bool ok(int i, int j)
{
    if(a[i][j] == '*' && i >= 1 && i <= n && j >= 1 && j <= m)
        return 1;
    else return 0;
}
int main()
{
    int t;
    scanf("%d", &t);
    while(t --)
    {
        init();
        scanf("%d%d", &n, &m);
        int u, v;
        for(int i = 1; i <= m; i ++)
        {
            scanf("%d%d", &u, &v);
            addedge(u, v);
        }
        int ans = 0;
        while(searchP())
        {
            memset(vis, 0, sizeof(vis));
            for(int i = 1; i <= n; i ++)
                if(mx[i] == -1 && dfs(i))
                    ans ++;
        }
        printf("%d\n", n - ans);
    }
    return 0;
}