Submission #551659

#TimeUsernameProblemLanguageResultExecution timeMemory
551659kshitij_sodaniTeam Contest (JOI22_team)C++14
64 / 100
2071 ms28228 KiB
#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define a first
#define b second
#define pb push_back
#define endl '\n'
const llo mod=1e9+7;
llo n;
llo it[200001][3];
multiset<llo> pre[3];
llo ma[3];
llo vis[200001];
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin>>n;

	for(llo i=0;i<n;i++){
		for(llo j=0;j<3;j++){
			cin>>it[i][j];
			pre[j].insert(it[i][j]);
		}
	}
	while(true){
		if(pre[0].size()<3){
			cout<<-1<<endl;
			return 0;
		}
		for(llo i=0;i<3;i++){
			auto j=pre[i].end();
			j--;
			ma[i]=(*j);
		}
		llo st=0;
		for(llo i=0;i<n;i++){
			llo co=0;
			if(vis[i]){
				continue;
			}

			for(llo j=0;j<3;j++){
				if(it[i][j]==ma[j]){
					co++;
				}
			}
			if(co>1){
				for(llo j=0;j<3;j++){
					auto ii=pre[j].find(it[i][j]);
					pre[j].erase(ii);

				}
				vis[i]=1;
				st++;
			}
		}
		if(st==0){
			cout<<ma[0]+ma[2]+ma[1]<<endl;
			return 0;
		}
	}







	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...