[POJ3660] [USACO2008Jan,Silver] Cow Contest [floyd/dfs]

[$\mathfrak{L}\mathfrak{i}\mathfrak{n}\mathfrak{k}$]

---

给点权和某一些点对的偏序关系，要问的是最后有多少个点Rank可以确定。
可以建出关系图。在什么情况下一个点的点Rank会被唯一确定？
只要从这个点开始，往某一边跑正边、另一边跑反边能够遍历所有点就行了。
需要注意的是这道题数据里面有环。。

---

Floyd-Warshall 传递闭包
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cctype>
#include<ctime>
#include<cmath>
using namespace std;
int n, m, ans;
bool dis[105][105];
void floyd() {
	for (int k = 1; k <= n; ++k) {
		for (int i = 1; i <= n; ++i) {
			for (int j = 1; j <= n; ++j) {
				dis[i][j] |= (dis[i][k]&&dis[k][j]);
			}
		}
	}
}
int main() {
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; ++i) {
		dis[i][i] = 1;
	}
	for (int a, b, i = 1; i <= m; ++i) {
		scanf("%d%d", &a, &b);
		dis[a][b] = 1;
	}
	floyd();
	for (int i = 1; i <= n; ++i) {
		bool fail = 0;
		for (int j = 1; j <= n; ++j) {
			if (j == i) continue;
			if ( !(dis[i][j]||dis[j][i]) || (dis[i][j]&&dis[j][i]) ) {
				fail = 1;
				break;
			}
		}
		ans += !fail;
	}
	printf("%d", ans);
    return 0;
}

DFS判连通（n^2跑得比n^3慢.jpg）
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cctype>
#include<ctime>
#include<cmath>
using namespace std;
int n, m, ans, cnt;
bool vis[105];
bool dis[105][105];
void dfs(int x) {
	vis[x] = 1;
	++cnt;
	for (int i = 1; i <= n; ++i) {
		if (vis[i]) continue;
		if (!dis[x][i]) continue;
		dfs(i);
	}
}
void dfs_plus_plus(int x) {
	if (!vis[x]) {
		vis[x] = 1;
		++cnt;
	}
	for (int i = 1; i <= n; ++i) {
		if (vis[i]) continue;
		if (!dis[i][x]) continue;
		dfs_plus_plus(i);
	}
}
int main() {
	scanf("%d%d", &n, &m);
	for (int a, b, i = 1; i <= m; ++i) {
		scanf("%d%d", &a, &b);
		dis[a][b] = 1;
	}
	for (int i = 1; i <= n; ++i) {
		memset(vis, 0, sizeof(vis));
		cnt = 0;
		dfs(i);
		dfs_plus_plus(i);
		if (cnt == n) ++ans;
	}
	printf("%d", ans);
    return 0;
}