题目来源:poj 3660 Cow Contest
题目让确定有几个人的位置是确定的,如果一个点有x个点能到达此点,从该点出发能到达y个点,若 x + y = n − 1 x+y=n-1 x+y=n−1,则该点的位置是确定的。用Floyd算法算出每两个点之间的距离,最后统计时,若 d i s [ a ] [ b ] dis[a][b] dis[a][b]之间无路且 d i s [ b ] [ a ] dis[b][a] dis[b][a]之间无路,则该点位置不能确定。最后用点个数减去不能确定的点的个数即可。
#include <iostream>
using namespace std;
const int maxn = 110;
const int INF = 0x3fffffff;
int dis[maxn][maxn];
int n, m; //顶点数,边数
void Floyd()
{
for (int k = 1; k <= n; k++)
{
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
if (dis[i][k] != INF && dis[k][j] != INF && dis[i][k] + dis[k][j] < dis[i][j])
{
dis[i][j] = dis[i][k] + dis[k][j];
}
}
}
}
}
int main()
{
cin >> n >> m;
fill(dis[0], dis[0] + maxn * maxn, INF);
int u, v;
for (int i = 0; i < m; i++)
{
cin >> u >> v;
dis[u][v] = 1;
}
Floyd();
int ans = 0;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
if (i == j)
{
continue;
}
if (dis[i][j] == INF && dis[j][i] == INF)
{
ans++;
break;
}
}
}
cout << n - ans << endl;
return 0;
}