poj 3660 传递性关系 floyd更新

原创 2015年11月19日 20:02:40


Cow Contest
Time Limit: 1000MS   Memory Limit: 65536K
Total Submissions: 8664   Accepted: 4873

Description

N (1 ≤ N ≤ 100) cows, conveniently numbered 1..N, are participating in a programming contest. As we all know, some cows code better than others. Each cow has a certain constant skill rating that is unique among the competitors.

The contest is conducted in several head-to-head rounds, each between two cows. If cow A has a greater skill level than cow B (1 ≤ AN; 1 ≤ BN; AB), then cow A will always beat cow B.

Farmer John is trying to rank the cows by skill level. Given a list the results of M (1 ≤ M ≤ 4,500) two-cow rounds, determine the number of cows whose ranks can be precisely determined from the results. It is guaranteed that the results of the rounds will not be contradictory.

Input

* Line 1: Two space-separated integers: N and M
* Lines 2..M+1: Each line contains two space-separated integers that describe the competitors and results (the first integer, A, is the winner) of a single round of competition: A and B

Output

* Line 1: A single integer representing the number of cows whose ranks can be determined
 

Sample Input

5 5
4 3
4 2
3 2
1 2
2 5

Sample Output

2



题意:有一些优劣关系,具有传递性,比如a>b && b>c 那么a>c,此时如果有c>d,那么a也要大于d,b也大于d。

给定n头牛,有m个关系,让你判定有多少头牛的位置是确定了的。

分析:开始乱搞一通,然而并不能更新全部的关系,老是漏了。然后看题解是用floyd,感觉很巧妙。


#include<bitset>
#include<map>
#include<vector>
#include<cstdio>
#include<iostream>
#include<cstring>
#include<string>
#include<algorithm>
#include<cmath>
#include<stack>
#include<queue>
#include<set>
#define inf 0x3f3f3f3f
#define mem(a,x) memset(a,x,sizeof(a))

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;

inline int in()
{
    int res=0;char c;
    while((c=getchar())<'0' || c>'9');
    while(c>='0' && c<='9')res=res*10+c-'0',c=getchar();
    return res;
}
const int N=101;


int win[N][N];
void floyd(int n)
{
    for(int k=1;k<=n;k++)
    {
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=n;j++)
            {
                win[i][j] |= win[i][k] && win[k][j];
            }
        }
    }
}
int main()
{
    int n,m;
    while(~scanf("%d%d",&n,&m))
    {
        mem(win,0);
        while(m--)
        {
            int x=in(),y=in();
            win[x][y]=1;
        }
        floyd(n);
        int ans=0;
        for(int i=1;i<=n;i++)
        {
            int t=0;
            for(int j=1;j<=n;j++)
            {
                t += win[i][j] || win[j][i]; //i>j 或者 j>i
            }
            if(t == n-1) ans ++ ; //能够确定的关系有n-1个,就能确定i的位置
        }
        printf("%d\n",ans);
    }
    return 0;
}



版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

poj 3660 floyd算法(传递闭包)

题目链接:http://poj.org/problem?id=3660题目大意:有n头牛比赛,m种比赛结果,最后问你一共有多少头牛的排名被确定了,其中如果a战胜b,b战胜c,则也可以说a战胜c,即可以...

POJ 3660 Cow Contest (floyd 传递闭包)

题目地址:点击打开链接 题意:有n头牛,有强有弱,现在给出m个关系A B(表示A比B强),现在让你求有几头牛的排名是可以确定的。 思路:强弱关系是传递的,先求一次传递闭包,再枚举每头牛,若比他...
  • CillyB
  • CillyB
  • 2017年03月21日 00:05
  • 145

poj 3660(Floyd求传递闭包)

Cow Contest Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 9317   Ac...

poj3660 Cow Contest(Floyd-Warshall方法求有向图的传递闭包)

题目链接题意: 有n头牛, 给你m对关系(a, b)表示牛a能打败牛b, 求在给出的这些关系下, 能确定多少牛的排名。分析: 在这呢先说一下关系闭包: 关系闭包有三种: 自反闭包(r), 对称...

poj 3660 floyd 传递闭包

poj 3660 Cow Contest

最短路径(8)--poj3660(用floyd求传递闭包)

Cow Contest                                          Time Limit:1000MS    Memory Limit:65536K...

poj 3660(Floyd传递闭包)

题目链接:http://poj.org/problem?id=3660         题目大意:有N头奶牛,现在告诉你他们两头牛之间比赛的胜负结果M组,要你据此求出有多少头奶牛的排名可以确定下来。...
  • kath_y
  • kath_y
  • 2012年03月31日 00:13
  • 698

POJ 3660 Cow Contest (Floyd求传递闭包)

传送门:http://poj.org/problem?id=3660题目大意:n(

POJ 3660 Cow Contest (Floyd 传递闭包判连通)

Cow Contest Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 7311 ...

POJ 3660 Cow Contest.(Floyd,传递闭包).

Description N (1 ≤ N ≤ 100) cows, conveniently numbered 1..N, are participating in a programming ...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:poj 3660 传递性关系 floyd更新
举报原因:
原因补充:

(最多只允许输入30个字)