网络流24题3 最小路径覆盖问题

Description

---

给定n个顶点m条边求这张图的最小路径覆盖

Analysis

---

首先证明:最小路径覆盖=总点数-最大匹配
拆点成i和i’并连边求最大流，然后求方案
以前的方法似乎是不能正确地找到路径的，改用dinic就A了
话说辣么多次bfs真的不会慢？

Code

---

/*
ID:wjp13241
PROG:
LANG:C++
*/
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <ctime>
#include <algorithm>
#include <iostream>
#include <vector>
#include <cmath>
#include <stack>
#include <queue>
#include <map>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define dfo(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,x,e) for(int i=ls[x];i;i=e[i].next)
#define fil(x,t) memset(x,t,sizeof(x))
#define FILEIN(s) freopen(s,"r",stdin)
#define FILEOUT(s) freopen(s,"w",stdout)
#define STP system("pause")
#define min(x,y) x<y?x:y
#define max(x,y) x>y?x:y
#define MP(x,y) make_pair(x,y)
#define PuB(v,x) v.push_back(x)
#define PoB(v) v.pop_back()
#define ld long double
#define ll long long
#define db double
#define INF 0x3f3f3f3f
#define LIM 100000000
#define EPS 1e-4
#define N 100201
#define E N*20+1
#define L 21
using namespace std;
struct edge{int y,w,rev,next;}e[E];
int dis[N],nex[N],ls[N],maxE=0;
int add(int x,int y,int w){
    e[++maxE]=(edge){y,w,maxE+1,ls[x]};ls[x]=maxE;
    e[++maxE]=(edge){x,0,maxE-1,ls[y]};ls[y]=maxE;
}
int bfs(int st,int ed){
    queue<int>q;
    fil(dis,63);
    q.push(st);
    dis[st]=0;
    while (!q.empty()){
        int now=q.front();q.pop();
        for (int i=ls[now];i;i=e[i].next){
            if (e[i].w>0&&dis[now]+1<dis[e[i].y]){
                dis[e[i].y]=dis[now]+1;
                q.push(e[i].y);
                if (e[i].y==ed)
                    return 1;
            }
        }
    }
    return 0;
}
int find(int now,int ed,int mn){
    if (now==ed){
        return mn;
    }
    for (int i=ls[now];i;i=e[i].next){
        if (dis[now]+1==dis[e[i].y]&&e[i].w>0){
            int d=find(e[i].y,ed,min(mn,e[i].w));
            if (d>0){
                e[i].w-=d;
                e[e[i].rev].w+=d;
                nex[now]=e[i].y;
                return d;
            }
        }
    }
    return 0;
}
int main(){
    ios::sync_with_stdio(false);
    int n,m;
    cin>>n>>m;
    fo(i,1,m){
        int x,y;
        cin>>x>>y;
        add(x,y+n,1);
    }
    fo(i,1,n){
        add(0,i,1);
        add(i+n,n+n+1,1);
    }
    int mxFlow=0;
    fil(nex,0);
    while (bfs(0,n+n+1)){
        int d=find(0,n+n+1,INF);
        mxFlow+=d;
    }
    fo(now,1,n){
        if (nex[now]){
            int i=now;
            do{
                if (i>n)
                    i-=n;
                cout<<i<<" ";
                int tmp=nex[i];
                nex[i]=0;
                i=tmp;
            }while (i);
            cout<<endl;
        }
    }
    cout<<n-mxFlow<<endl;
    return 0;
}