题目:
http://poj.org/problem?id=3660
题意:
有
n
个奶牛在比赛,有
思路:
可以发现,对于一个奶牛而言,如果战胜它的奶牛数和它打败的奶牛数之和等于
floyd:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
const int N = 100 + 10, INF = 0x3f3f3f3f;
bool mp[N][N];
void floyd(int n)
{
for(int k = 1; k <= n; k++)
for(int i = 1; i <= n; i++)
if(mp[i][k]) //一个优化
for(int j = 1; j <= n; j++)
mp[i][j] = mp[i][j] || (mp[i][k] && mp[k][j]);
}
int main()
{
int n, m;
while(~ scanf("%d%d", &n, &m))
{
memset(mp, 0, sizeof mp);
int a, b;
for(int i = 1; i <= m; i++)
{
scanf("%d%d", &a, &b);
mp[a][b] = 1;
}
floyd(n);
int ans = 0;
for(int i = 1; i <= n; i++)
{
int tot = 0;
for(int j = 1; j <= n; j++)
if(mp[i][j] || mp[j][i]) tot++;
if(tot == n-1) ans++;
}
printf("%d\n", ans);
}
return 0;
}
bfs:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
const int N = 100 + 10, INF = 0x3f3f3f3f;
struct edge
{
int to, next;
}g[N*N*2];
int cnt, head[N];
int a[N*N*2], b[N*N*2];
bool vis[N];
void add_edge(int v, int u)
{
g[cnt].to = u, g[cnt].next = head[v], head[v] = cnt++;
}
int bfs(int s)
{
queue<int> que;
memset(vis, 0, sizeof vis);
que.push(s), vis[s] = true;
int tot = 0;
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), vis[u] = true, tot++;
}
}
return tot;
}
int main()
{
int n, m;
while(~ scanf("%d%d", &n, &m))
{
cnt = 0;
memset(head, -1, sizeof head);
for(int i = 1; i <= m; i++)
{
scanf("%d%d", &a[i], &b[i]);
add_edge(a[i], b[i]);
}
int t1[N], t2[N];
for(int i = 1; i <= n; i++) t1[i] = bfs(i);
cnt = 0;
memset(head, -1, sizeof head);
for(int i = 1; i <= m; i++) add_edge(b[i], a[i]);
for(int i = 1; i <= n; i++) t2[i] = bfs(i);
int ans = 0;
for(int i = 1; i <= n; i++)
if(t1[i] + t2[i] == n-1) ans++;
printf("%d\n", ans);
}
return 0;
}