B. Running for Gold (结构体排序)

浅浅的花香味﹌ 2022-09-12 15:56 85阅读 0赞

[https://codeforces.com/contest/1552/problem/B][https_codeforces.com_contest_1552_problem_B]

写了很久，发现是个简单的排序题

// Problem: B. Running for Gold
    // Contest: Codeforces - Codeforces Global Round 15
    // URL: https://codeforces.com/contest/1552/problem/B
    // Memory Limit: 256 MB
    // Time Limit: 1000 ms
    // 
    // Powered by CP Editor (https://cpeditor.org)
    
    #include<iostream>
    #include<cstdio>
    #include<string>
    #include<ctime>
    #include<cmath>
    #include<cstring>
    #include<algorithm>
    #include<stack>
    #include<climits>
    #include<queue>
    #include<map>
    #include<set>
    #include<sstream>
    #include<cassert>
    #include<bitset>
    #include<list>
    #include<unordered_map>
    using namespace std;
    #define ff first
    #define ss second
    #define lowbit(x) (x&-x)
    #define pf(a) printf("%d\n",a)
    #define mem(x,y) memset(x,y,sizeof(x))
    #define dbg(x) cout << #x << " = " << x << endl
    #define rep(i,l,r) for(int i = l; i <= r; i++)
    #define fep(i,a,b) for(int i=b; i>=a; --i)
    typedef pair<int,int> PII;
    typedef long long ll;
    typedef unsigned long long ull;
    
    const int N = 5e4 + 10;
    
    struct Node{ 
    	int id;
    	int a,b,c,d,e;
    	bool operator < (const Node &x) const{ 
    		int s1 = 0, s2 = 0;
    		if(a < x.a) s1++;
    		else s2++;
    		
    		if(b < x.b) s1++;
    		else s2++;
    		
    		if(c < x.c) s1++;
    		else s2++;
    		
    		if(d < x.d) s1++;
    		else s2++;
    		
    		if(e < x.e) s1++;
    		else s2++;
    		
    		if(s1 >= 3) return false;
    		if(s2 >= 3) return true;
    	}
    }f[N];
    
    
    void solve()
    { 
    	int n;
    	scanf("%d", &n);
    	rep(i,1,n)
    	{ 
    		cin >> f[i].a >> f[i].b >> f[i].c >> f[i].d >> f[i].e;
    		f[i].id = i;
    	}
    	
    	if(n==1) { puts("1");return;}
    	
    	sort(f+1, f+1+n);
    
    	bool flag = true;
    	rep(i,1,n-1)
    	{ 
    		if(f[n] < f[i]) flag = false; // 判重
    	}
    	if(!flag)  puts("-1");
    	else cout << f[n].id << endl;
    	
    }
    
    int main()
    { 
    
    	int Case;scanf("%d", &Case);
    	while(Case--)
    		solve();
    	return 0;
    }

[https_codeforces.com_contest_1552_problem_B]: https://codeforces.com/contest/1552/problem/B