最小路径覆盖问题【网路流24题】【最大流+题意+建边思路】

题目链接

---

  可以说是这道题的简化版了，这道题就是题意太难理解了，但是说的通俗易懂一些就是，我们最少用几条链，可以覆盖完所有的点？

  那么，怎么建边呢，不如就是这样：我们建立这样的穷情况"S -> i"、"i + N -> T"，然后若是遇到"i可以联通j的情况"，我们这么建边"i -> j+N"这样子就可以了，可以自己画图就理解了呢。

---

#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 0x3f3f3f3f
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const int maxN = 307;
const int maxE = 1e4 + 5e3 + 7;
const int S = 0;
int N, M, head[maxN], cur[maxN], cnt, T, top[maxN], tot;
struct Eddge
{
    int nex, to, flow;
    Eddge(int a=-1, int b=0, int c=0):nex(a), to(b), flow(c) {}
}edge[maxE], path[maxE];
inline void addEddge(int u, int v, int flow)
{
    edge[cnt] = Eddge(head[u], v, flow);
    head[u] = cnt++;
}
int deep[maxN];
bool bfs()
{
    memset(deep, 0, sizeof(deep));
    queue<int> Q;   Q.push(S);  deep[S] = 1;
    while(!Q.empty())
    {
        int u = Q.front();  Q.pop();
        for(int i=head[u], v, flow; ~i; i=edge[i].nex)
        {
            v = edge[i].to; flow = edge[i].flow;
            if(!deep[v] && flow)
            {
                deep[v] = deep[u] + 1;
                Q.push(v);
            }
        }
    }
    return deep[T];
}
int dfs(int u, int flow)
{
    if(u == T) return flow;
    for(int &i = cur[u], v, val; ~i; i=edge[i].nex)
    {
        v = edge[i].to; val = edge[i].flow;
        if(deep[u] + 1 == deep[v] && val)
        {
            int di = dfs(v, min(flow, val));
            if(di)
            {
                edge[i].flow -= di;
                edge[i^1].flow += di;
                return di;
            }
        }
    }
    return 0;
}
int Dinic()
{
    int ans = 0, tmp;
    while(bfs())
    {
        for(int i=S; i<=T; i++) cur[i] = head[i];
        while((tmp = dfs(S, INF))) ans += tmp;
    }
    return ans;
}
inline void addPath(int u, int v)
{
    path[tot] = Eddge(top[u], v);
    top[u] = tot++;
}
bool vis[maxN];
void Out_put(int u)
{
    printf("%d ", u);   vis[u] = true;
    for(int i=top[u], v; ~i; i=path[i].nex)
    {
        v = path[i].to;
        Out_put(v);
    }
}
inline void solve()
{
    int ans = N - Dinic();
    for(int i=1; i<=N; i++)
    {
        for(int u=head[i], v, val; ~u; u=edge[u].nex)
        {
            v = edge[u].to; val = edge[u^1].flow;
            if(val && v > N) addPath(i, v - N);
        }
    }
    for(int i=1; i<=N; i++)
    {
        if(vis[i]) continue;
        Out_put(i);
        printf("\n");
    }
    printf("%d\n", ans);
}
inline void init()
{
    cnt = tot = 0;    T = (N<<1) + 1;
    memset(head, -1, sizeof(head)); memset(top, -1, sizeof(top));   memset(vis, false, sizeof(vis));
}
int main()
{
    scanf("%d%d", &N, &M);
    init();
    for(int i=1; i<=N; i++)
    {
        addEddge(S, i, 1);
        addEddge(i, S, 0);
        addEddge(i + N, T, 1);
        addEddge(T, i + N, 0);
    }
    for(int i=1, u, v; i<=M; i++)
    {
        scanf("%d%d", &u, &v);
        addEddge(u, v + N, 1);
        addEddge(v + N, u, 0);
    }
    solve();
    return 0;
}