【POJ 2594】Treasure Exploration（最小可交路径覆盖）

Treasure Exploration

题目链接：POJ 2594

题目大意

给你一个有向无环图，然后问你至少要多少条路径才能覆盖所有点。
路径之间可以有交。

思路

无交的我们会做，那我们考虑有交的怎么办。

那我们考虑把它转化成无交的，不难想到可以对它做一次 Floyed 求出传递闭包。
那原本有交的我们就把它变成了无交，就可以做了。

代码

#include<queue>
#include<cstdio>
#include<iostream>
#include<algorithm>
#define INF 0x3f3f3f3f3f3f3f3f

using namespace std;

const int N = 500 + 10; 
int n, m, x, y, a[N][N];
struct node {
	int x, to, nxt, op;
}e[(N * N + N << 1) << 1];
int le[N << 1], KK, S, T, tot;
int lee[N << 1], deg[N << 1];

//网络流模板 
void add(int x, int y, int z) {
	e[++KK] = (node){z, y, le[x], KK + 1}; le[x] = KK;
	e[++KK] = (node){0, x, le[y], KK - 1}; le[y] = KK;
}

bool bfs() {
	for (int i = 1; i <= tot; i++) lee[i] = le[i], deg[i] = 0;
	queue <int> q; q.push(S); deg[S] = 1;
	while (!q.empty()) {
		int now = q.front(); q.pop();
		for (int i = le[now]; i; i = e[i].nxt)
			if (e[i].x && !deg[e[i].to]) {
				deg[e[i].to] = deg[now] + 1;
				if (e[i].to == T) return 1; q.push(e[i].to);
			}
	}
	return 0;
}

int dfs(int now, int sum) {
	if (now == T) return sum;
	int go = 0;
	for (int &i = lee[now]; i; i = e[i].nxt)
		if (e[i].x && deg[e[i].to] == deg[now] + 1) {
			int this_go = dfs(e[i].to, min(sum - go, e[i].x));
			if (this_go) {
				e[i].x -= this_go; e[e[i].op].x += this_go;
				go += this_go; if (go == sum) return go;
			}
		}
	if (go != sum) deg[now] = -1; return go;
}

int dinic() {
	int re = 0;
	while (bfs()) re += dfs(S, INF);
	return re;
}

int main() {
	scanf("%d %d", &n, &m);
	while (n || m) {
		tot = 2 * n; S = ++tot; T = ++tot;
		for (int i = 1; i <= n; i++) add(S, i, 1), add(n + i, T, 1);//建图
		for (int i = 1; i <= m; i++) {
			scanf("%d %d", &x, &y); a[x][y] = 1;
		}
		for (int k = 1; k <= n; k++)//Floyed算法求出传递闭包（其实就是两个点之间是否可以到达） 
			for (int i = 1; i <= n; i++)
				for (int j = 1; j <= n; j++)
					a[i][j] |= a[i][k] & a[k][j]; 
		for (int i = 1; i <= n; i++)//根据传递闭包建图 
			for (int j = 1; j <= n; j++)
				if (a[i][j]) add(i, n + j, 1);
		
		printf("%d\n", n - dinic());//最小路径覆盖等价于点数减去最大流 
		
		for (int i = 1; i <= tot; i++) le[i] = 0; KK = 0;//清空
		for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) a[i][j] = 0;
		
		scanf("%d %d", &n, &m);
	}
	
	return 0;
}