POJ 3660 Cow ContestCow（Floyd传递闭包）题解

题意：给出m个关系，问你能确定机头牛的排名

思路：要确定排名那必须要把他和其他n-1头牛比过才行，所以Floyd传递闭包，如果赢的+输的有n-1就能确定排名。

代码：

#include<cstdio>
#include<set>
#include<map>
#include<cmath>
#include<stack>
#include<vector>
#include<queue>
#include<cstring>
#include<string>
#include<sstream>
#include<iostream>
#include<algorithm>
#define ll long long
using namespace std;
const int maxn = 100+10;
const int INF = 0x3f3f3f3f;
int mp[maxn][maxn],can[maxn];
int main(){int n,m;memset(mp,0,sizeof(mp));memset(can,0,sizeof(can));scanf("%d%d",&n,&m);while(m--){int u,v;scanf("%d%d",&u,&v);mp[u][v] = 1;}for(int k = 1;k <= n;k++){for(int i = 1;i <= n;i++){for(int j = 1;j <= n;j++){if(mp[i][k] && mp[k][j]){mp[i][j] = 1;}}}}int ans = 0;for(int i = 1;i <= n;i++){for(int j = 1;j <= n;j++){if(mp[i][j] && i != j){can[i]++;can[j]++;}}}for(int i = 1;i <= n;i++){if(can[i] == n - 1) ans++;}printf("%d\n",ans);return 0;
}

转载于:https://www.cnblogs.com/KirinSB/p/9486507.html

POJ 3660 Cow ContestCow（Floyd传递闭包）题解相关推荐

POJ 3660 Cow Contest [Floyd]
POJ - 3660 Cow Contest http://poj.org/problem?id=3660 N (1 ≤ N ≤ 100) cows, conveniently numbered 1. ...
POJ 3660 Cow Contest（传递闭包floyed算法）
Description N (1 ≤ N ≤ 100) cows, conveniently numbered 1..N, are participating in a programming con ...
POJ 3660 Cow Contest【传递闭包】
解题思路:给出n头牛,和这n头牛之间的m场比赛结果,问最后能知道多少头牛的排名. 首先考虑排名怎么想,如果知道一头牛打败了a头牛,以及b头牛打赢了这头牛,那么当且仅当a+b+1=n时可以知道排名,即为 ...
POJ 3660 Cow Contest 传递闭包+Floyd
原题链接:http://poj.org/problem?id=3660 Cow Contest Time Limit: 1000MS Memory Limit: 65536K Total Subm ...
poj 3660 Cow Contest 传递闭包
题目链接: http://poj.org/problem?id=3660 题目大意: 有n头牛,每头牛都有一个战斗值,农夫约翰想给这些牛排名次,但是只有m场比赛,约翰想知道有多少头牛的名次是确定的. ...
[传递闭包]POJ#3660 Cow Contest
题面传送门 Cow Contest Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 24342 Accepted: 13539 ...
Cow Contest POJ - 3660（floyed求传递闭包）
N (1 ≤ N ≤ 100) cows, conveniently numbered 1-N, are participating in a programming contest. As we a ...
POJ - 3660 Cow Contest(最短路变形+闭包传递)
题目链接:点击查看题目大意:给定n头牛和m个关系,每个关系表示为两个整数a与b,其意义为a牛能打败b牛,问可以确定排名的牛的数量. 题目分析: 在这里先说一下关系闭包: 关系闭包有三种: 自反闭包( ...
POJ 3660 Cow Contest (闭包传递)
Cow Contest Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 7690 Accepted: 4288 Descr ...

POJ 3660 Cow ContestCow（Floyd传递闭包）题解

POJ 3660 Cow ContestCow（Floyd传递闭包）题解相关推荐

最新文章

热门文章