P2419 [USACO08JAN] Cow Contest S--C++代码

这个代码使用了BFS算法来寻找每个牛能够到达的最大距离，然后判断是否是一共n-1个牛都能够到达其他牛，如果是则计数加1，最后输出计数结果。

下面是一个C++代码的示例：

#include <iostream>
#include <vector>
#include <queue>

using namespace std;

const int MAXN = 101;

vector<int> adj[MAXN];
int dist[MAXN];

int bfs(int start) {
    queue<int> q;
    q.push(start);
    dist[start] = 0;

    while (!q.empty()) {
        int curr = q.front();
        q.pop();

        for (int i = 0; i < adj[curr].size(); i++) {
            int next = adj[curr][i];
            if (dist[next] == -1) {
                dist[next] = dist[curr] + 1;
                q.push(next);
            }
        }
    }

    int maxDist = 0;
    for (int i = 1; i <= MAXN; i++) {
        if (dist[i] != -1) {
            maxDist = max(maxDist, dist[i]);
        }
    }

    return maxDist;
}

int main() {
    int n, m;
    cin >> n >> m;

    for (int i = 0; i < m; i++) {
        int a, b;
        cin >> a >> b;
        adj[a].push_back(b);
    }

    int count = 0;
    for (int i = 1; i <= n; i++) {
        fill(dist, dist + MAXN, -1);
        int maxDist = bfs(i);

        if (maxDist == n - 1) {
            count++;
        }
    }

    cout << count << endl;

    return 0;
}