POJ 3265 Cow Picnic bfs

题目：

http://poj.org/problem?id=3256

题意：

有$k$只奶牛在$n$个牧场，牧场间有一些单向道路相连，现在这些奶牛想聚集到一个牧场中，问有多少个这样的牧场可以使所有的牛都到达

思路：

从每个奶牛所在的牧场出发，进行$bfs$，把能到达的牧场计数$+1$，最后统计一下被访问$k$次的牧场个数即可。用$floyd$算法求传递闭包$1930ms$卡过。。。
$bfs:$

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>

using namespace std;

const int N = 1000 + 10, INF = 0x3f3f3f3f;

struct edge
{
    int to, next;
}g[N*N];

int cnt, head[N];
int a[N], num[N];
bool vis[N];

void add_edge(int v, int u)
{
    g[cnt].to = u, g[cnt].next = head[v], head[v] = cnt++;
}
void bfs(int s)
{
    queue<int> que;
    memset(vis, 0, sizeof vis);
    que.push(s), num[s]++, vis[s] = true;
    while(! que.empty())
    {
        int v = que.front(); que.pop();
        for(int i = head[v]; i != -1; i = g[i].next)
        {
            int u = g[i].to;
            if(! vis[u]) que.push(u), num[u]++, vis[u] = true;
        }
    }
}
int main()
{
    int k, n, m;
    while(~ scanf("%d%d%d", &k, &n, &m))
    {
        cnt = 0;
        memset(head, -1, sizeof head);
        memset(num, 0, sizeof num);
        for(int i = 1; i <= k; i++) scanf("%d", &a[i]);
        int v, u;
        for(int i = 1; i <= m; i++)
        {
            scanf("%d%d", &v, &u);
            add_edge(v, u);
        }
        for(int i = 1; i <= k; i++) bfs(a[i]);
        int ans = 0;
        for(int i = 1; i <= n; i++)
            if(num[i] == k) ans++;
        printf("%d\n", ans);
    }
    return 0;
}

$floyd:$

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>

using namespace std;

const int N = 1000 + 10, INF = 0x3f3f3f3f;

int a[N];
int arr[N][N], brr[N][N];
int ka[N], kb[N];
bool mp[N][N];

int main()
{
    int k, n, m;
    while(~ scanf("%d%d%d", &k, &n, &m))
    {
        memset(ka, 0, sizeof ka);
        memset(kb, 0, sizeof kb);
        memset(mp, 0, sizeof mp);
        for(int i = 1; i <= n; i++) mp[i][i] = true;
        for(int i = 1; i <= k; i++) scanf("%d", &a[i]);
        int v, u;
        for(int i = 1; i <= m; i++)
        {
            scanf("%d%d", &v, &u);
            mp[v][u] = true;
            arr[v][++ka[v]] = u;
            brr[u][++kb[u]] = v;
        }
        for(int k = 1; k <= n; k++)
        {
            for(int i = 1; i <= kb[k]; i++)
            {
                int v = brr[k][i];
                for(int j = 1; j <= ka[k]; j++)
                {
                    int u = arr[k][j];
                    if(! mp[v][u])
                    {
                        mp[v][u] = true;
                        arr[v][++ka[v]] = u;
                        brr[u][++kb[u]] = v;
                    }
                }
            }
        }
        int ans = 0;
        for(int i = 1; i <= n; i++)
        {
            bool flag = true;
            for(int j = 1; j <= k; j++)
                if(! mp[a[j]][i])
                {
                    flag = false;
                    break;
                }
            if(flag) ans++;
        }
        printf("%d\n", ans);
    }
    return 0;
}