洛谷P2764 最小路径覆盖问题(最小割)
链接
题意:给一张有向无环图,要用最少的路径覆盖所有的边,输出多少条路径并且输出具体路径
思路:我们可以根据最小割最大流定理理解成,割掉最小流量,让整个图不连通吗,所以就变成了一个几乎是模板题的最小割,其中记录一下路径即可,我们在每次更新流量的时候记录一下。
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1500, INF = 2147483647000000;
int head[N], idx = 1;
struct Edge{int to, nxt, d;}e[10000010];
void add(int u, int v, int d) {e[++idx].nxt = head[u], e[idx].to = v, e[idx].d = d, head[u] = idx;}
int dep[N], gap[N], cur[N], n, m, s, t, maxflow, nxt[N], pre[N], vis[N];
void bfs()
{
memset(dep, -1, sizeof (dep));
memset(gap, 0, sizeof (gap));
dep[t] = 0;
gap[0] = 1;
queue<int> Q;
Q.push(t);
while (!Q.empty()) {
int u = Q.front(); Q.pop();
for (int i = head[u]; i; i = e[i].nxt) {
int v = e[i].to;
if (dep[v] != -1) continue;
dep[v] = dep[u] + 1;
gap[dep[v]]++;
Q.push(v);
}
}
}
int dfs(int u, int flow)
{
if (u == t) {
maxflow += flow;
return flow;
}
int used = 0;
for (int &i = cur[u]; i; i = e[i].nxt) {
int v = e[i].to, d = e[i].d;
if (d && dep[v] + 1 == dep[u]) {
int mi = dfs(v, min(flow - used, d));
if (mi) {
e[i].d -= mi;
e[i ^ 1].d += mi;
used += mi;
nxt[u] = v - n;
pre[v - n] = u;
}
if (used == flow) return used;
}
}
gap[dep[u]]--;
if (gap[dep[u]] == 0) dep[s] = N + 1;
dep[u]++;
gap[dep[u]]++;
return used;
}
int ISAP()
{
maxflow = 0;
bfs();
while (dep[s] < N) {memcpy(cur, head, sizeof (head)); dfs(s, INF);}
return maxflow;
}
signed main()
{
cin >> n >> m;
t = N - 10;
for (int i = 1; i <= n; i++) {add(s, i, 1); add(i, s, 0); add(i + n, t, 1); add(t, i + n, 0);}
for (int i = 1; i <= m; i++) {
int u, v;
cin >> u >> v;
add(u, v + n, 1); add(v + n, u, 0);
}
int a = n - ISAP();
for (int i = 1; i <= n; i++) {
if (vis[i]) continue;
if (!pre[i]) {
int st = i;
while (st) {
vis[st] = 1;
cout << st << ' ';
st = nxt[st];
}cout << endl;
}
}
cout << a;
return 0;
}