Submission #602225

#	Time	Username	Problem	Language	Result	Execution time	Memory
602225		uncripted	Team Contest (JOI22_team)	C++11	46 / 100	2064 ms	4120 KiB

team

#include<bits/stdc++.h>
#define f first
#define s second
#define pb push_back
using namespace std;
int main(){
	int n;
	cin>>n;
	pair<int, pair<int,int> >  p[n+1];
	set<pair<int, pair<int,int> > > sd;
	for(int i=1; i<=n; i++){
		int x,y,z;
		cin>>x>>y>>z;
		p[i]={x, {y,z}};
		sd.insert(p[i]);
	}
	sort(p+1, p+n+1, greater<pair<int, pair<int,int> > >() );
	int pas=-1;
	for(int i=1; i<=n; i++){
	set<pair<int, pair<int,int> > >::iterator it=sd.lower_bound({p[i].f, {0, 0}});
		if(it==sd.begin()){
			continue;
		}
		it--;
		vector<pair<int,int> > vx,vy;
		while(true){
			pair<int, pair<int,int> > px;
			px=*it;
			vx.pb({px.s.f, px.s.s});
			vy.pb({px.s.s, px.s.f});
			if(it==sd.begin()){
				break;
			}
			it--;
		}
		sort(vx.begin(), vx.end());
		sort(vy.begin(), vy.end());
		int i1=0,i2=0;
	//		cout<<vx.size()<<"   u "<<vy.size() <<endl;
		while(vx[vx.size()-1].f==vx[vx.size()-1].f && vx[vx.size()-1].s==vy[vy.size()-1].f){
	//		cout<<vx[vx.size()-1].f<<" assfgh "<<vx[vx.size()-1].f<<" s "<<vx[vx.size()-1].s<<" "<<vy[vy.size()-1].f<<endl	;
			vx.pop_back();
			vy.pop_back();	
	//		cout<<vx[vx.size()-1].f<<endl;
	//		cout<<vy[vy.size()-1].f<<endl;
		}
	//	cout<<vx.size()<<"   asd "<<vy.size() <<endl;
		if(!vx.size() || !vy.size()){
			continue;
		}
	//	cout<<"s"<<endl;
		if(vx[vx.size()-1].f<=p[i].s.f || vy[vy.size()-1].f<=p[i].s.s  ){
			continue;
		}
//		cout<<"enter"<<endl;
	//	cout<<endl;
	//	cout<<p[i].f<<" "<<vx[vx.size()-1].f<<" "<<vy[vy.size()-1].f<<endl;
		pas=max(pas, p[i].f+vx[vx.size()-1].f+vy[vy.size()-1].f);
	}	
	cout<<pas;
}

Compilation message (stderr)

team.cpp: In function 'int main()':
team.cpp:38:7: warning: unused variable 'i1' [-Wunused-variable]
   38 |   int i1=0,i2=0;
      |       ^~
team.cpp:38:12: warning: unused variable 'i2' [-Wunused-variable]
   38 |   int i1=0,i2=0;
      |            ^~

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