POJ 3660 Cow Contest

Question Link

Question analysising

如果一只奶牛能确定和另外n-1头奶牛的关系，那么就能确定这头奶牛在奶牛中的ranking

写法

e[i][j] 有值 即 i 打败了 j 。否则无关系，或者被打败。只能是有向图，否则多对一，无法确定关系。当i打败k，k也打败了j时，能确定i和j的关系。当i打败k，j也打败了k时，不能确定i和j的关系。

#include<iostream>
#include<queue>
#include<cstring>
#include<string>
#include<sstream>
#include<map>
#include<vector>
#include<cstdio>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstdlib>
#include<stack>
#include<ctime>
using namespace std; 
#define rep(i,aa,bb) for(register int i=aa;i<=bb;i++)
#define rrep(i,aa,bb) for(register int i=aa;i>=bb;i--)
#define mset(var,val)	 memset(var,val,sizeof(var))
#define LL long long 
#define eps 0.000001
#define inf 0x7f7f7f7f
#define llinf 1e18
#define exp 0.000001
#define pai 3.141592654
#define random(x)   rand()%(x)
#define lowbit(x)   x&(-x)
inline int read()
{
	int x=0,y=1;char a=getchar();while ( a>'9' || a<'0'){if ( a=='-')y=-1;a=getchar();}
	while ( a>='0' && a<='9' ){	x=(x<<3)+(x<<1)+a-'0'; a=getchar();}return x*y;
}
#define N 109
int e[N][N];
int main()
{
//	freopen("1.txt","r",stdin);
	srand((int)time(0));
//	std::ios::sync_with_stdio(false);
	int n,m; 
	while ( scanf("%d%d",&n,&m) != EOF ){
		mset(e,0);
		rep(aai,1,m){
			int a,b; 	scanf("%d%d",&a,&b);
			e[a][b] = 1; 
		}
		for (int k = 1; k <= n; k++){
			for (int i = 1; i <= n; i++){
				for (int j = 1; j <= n ; j++){
					if( e[i][k] && e[k][j] )
						e[i][j] = 1; 
				}
			}
		}
		int ans = 0; 
		for (int i = 1; i <= n; i++){
			int res = 0; 
			for (int j = 1; j <= n; j++){
				if ( e[i][j] || e[j][i] )
					res++;
			}
			if ( res == n-1 )
				ans++;
		}
		cout<<ans<<endl; 		
	}

	return 0;
}