제출 #604549

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
604549		uncripted	Team Contest (JOI22_team)	C++11	0 / 100	199 ms	23400 KiB

team

#include<bits/stdc++.h>
#define f first
#define s second
#define pb push_back
using namespace std;
int main(){
	long long n;
	cin>>n;
	pair<long long, pair<long long,long long> >  p[n+1];
	multiset<pair<long long,long long> > vx,vy;	
	for(long long i=1; i<=n; i++){
		long long x,y,z;
		cin>>x>>y>>z;
		p[i]={x, {y,z}};
		vx.insert({y, z});
		vy.insert({z, y});
	}
	
	sort(p+1, p+n+1, greater<pair<long long, pair<long long,long long> > >() );
	long long pas=-1;	

	

	for(long long i=1; i<=n; i++){
		if(vx.find({p[i].s.f, p[i].s.s})!=vx.end()){
				vx.erase(vx.find({p[i].s.f, p[i].s.s}));
		}
		if(vy.find({p[i].s.s, p[i].s.f})!=vy.end()){
				vy.erase(vy.find({p[i].s.s, p[i].s.f}));
		}
		while( (*vx.rbegin()).f==(*vy.rbegin()).s && (*vx.rbegin()).s==(*vy.rbegin()).f){
			vx.erase(--vx.end());
			vy.erase(--vy.end());
			if(!vx.size() || !vy.size()){
				break;
			}
		}
	//	cout<<"y";
		if(!vx.size() || !vy.size()){
			break;
			
		}
	//	cout<<"z";
		if((*vx.rbegin()).f<=p[i].s.f || (*vy.rbegin()).f<=p[i].s.s  ){
			continue;
		}
		pas=max(pas, p[i].f+(*vx.rbegin()).f+(*vy.rbegin()).f);
	}	
	cout<<pas;
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 29
• Subtask 3: 0 / 9
• Subtask 4: 0 / 9
• Subtask 5: 0 / 9
• Subtask 6: 0 / 9
• Subtask 7: 0 / 27