CodeForces - 1552B. Running for Gold（Floyd表胜负）

我是传送门~
The Olympic Games have just started and Federico is eager to watch the marathon race.

There will be n athletes, numbered from 1 to n, competing in the marathon, and all of them have taken part in 5 important marathons, numbered from 1 to 5, in the past. For each 1≤i≤n and 1≤j≤5, Federico remembers that athlete i ranked ri,j-th in marathon j (e.g., r2,4=3 means that athlete 2 was third in marathon 4).

Federico considers athlete x superior to athlete y if athlete x ranked better than athlete y in at least 3 past marathons, i.e., rx,j<ry,j for at least 3 distinct values of j.

Federico believes that an athlete is likely to get the gold medal at the Olympics if he is superior to all other athletes.

Find any athlete who is likely to get the gold medal (that is, an athlete who is superior to all other athletes), or determine that there is no such athlete.

Input
The first line contains a single integer t (1≤t≤1000) — the number of test cases. Then t test cases follow.

The first line of each test case contains a single integer n (1≤n≤50000) — the number of athletes.

Then n lines follow, each describing the ranking positions of one athlete.

The i-th of these lines contains the 5 integers ri,1,ri,2,ri,3,ri,4,ri,5 (1≤ri,j≤50000) — the ranking positions of athlete i in the past 5 marathons. It is guaranteed that, in each of the 5 past marathons, the n athletes have distinct ranking positions, i.e., for each 1≤j≤5, the n values r1,j,r2,j,…,rn,j are distinct.

It is guaranteed that the sum of n over all test cases does not exceed 50000.

Output
For each test case, print a single integer — the number of an athlete who is likely to get the gold medal (that is, an athlete who is superior to all other athletes). If there are no such athletes, print −1. If there is more than such one athlete, print any of them.

Example
Input
4
1
50000 1 50000 50000 50000
3
10 10 20 30 30
20 20 30 10 10
30 30 10 20 20
3
1 1 1 1 1
2 2 2 2 2
3 3 3 3 3
6
9 5 3 7 1
7 4 1 6 8
5 6 7 3 2
6 7 8 8 6
4 2 2 4 5
8 3 6 9 4
Output
1
-1
1
5

---

• 题意：共t组数据，每组有n个选手，每次都比赛5的回合，任意的两个选手胜负按5赢3的标准（任选无先后）。如果有选手赢得其他所有人输出他的序号，否则输出-1；
• 分析：先用二维数组输进去，然后按顺序遍历一边，标记当前的赢家，也就是说最后除去这个标记的人，其他的人都不可能赢得所有人，然后再遍历一边查询是否有人可以赢得上次这个标记的人，如果赢了则说明没有符合最终要求的人，输出-1.否则输出标记的这个人。
• ac代码：

#include<stdio.h>
int a[50010][5];
int main()
{
	int t,n,i,j,sum,f,flag;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d",&n);
		for(i=1;i<=n;i++)
		for(j=1;j<=5;j++)
		{
			scanf("%d",&a[i][j]);
		}
		f=1;
		flag=0;
		for(i=1;i<=n;i++)
		{
			sum=0;
			for(j=1;j<=5;j++)
			{
				if(a[i][j]<a[f][j])//谁的数字小谁获胜 
				sum++;
			}
			if(sum>=3)
			f=i;
		}
		for(i=1;i<=n;i++)
		{
			sum=0;
			for(j=1;j<=5;j++)
			{
				if(a[i][j]<a[f][j])	
				sum++;
			}
			if(sum>=3)
			{
				flag=1;
				break;
			}
		}
		if(flag)
		printf("-1\n");
		else printf("%d\n",f);
	}
}