Submission #1186322

#TimeUsernameProblemLanguageResultExecution timeMemory
1186322thelegendary08Team Contest (JOI22_team)C++17
100 / 100
91 ms17148 KiB
#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define pout(a) cout<<a.first<<' '<<a.second<<'\n'
#define vout(v) for(auto u : v){cout<<u<<' ';} cout<<'\n'
#define dout(a) cout<<a<<' '<<#a<<'\n'
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<'\n'
#define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;
 
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	//ifstream cin(".in");
	//ofstream cout(".out");
	in(n);
	vpii a, b, c;
	vvi v(n, vi(3));
	f0r(i,n){
		in3(x,y,z);
		a.pb(mp(x, i));
		b.pb(mp(y, i));
		c.pb(mp(z, i));
		v[i][0] = x;
		v[i][1] = y;
		v[i][2] = z;
	}
	
	sort(all(a));
	sort(all(b));
	sort(all(c));
	
	int p1 = n-1;
	int p2 = n-1;
	int p3 = n-1;
	vb vis(n);
	bool ok = 0;
	int ans = -1;
	while(p1 >= 0 && p2 >= 0 && p3 >= 0){
		int m1 = a[p1].first;
		int m2 = b[p2].first;
		int m3 = c[p3].first;
		
		int c1 = 1 + (v[a[p1].second][1] == m2) + (v[a[p1].second][2] == m3);
		int c2 = 1 + (v[b[p2].second][0] == m1) + (v[b[p2].second][2] == m3);
		int c3 = 1 + (v[c[p3].second][0] == m1) + (v[c[p3].second][1] == m2);
		
		if(c1 >= 2){
			vis[a[p1].second] = 1;
		}
		else if(c2 >= 2){
			vis[b[p2].second] = 1;
		}
		else if(c3 >= 2){
			vis[c[p3].second] = 1;
		}
		else{
			ok = 1;
			ans = m1 + m2 + m3;
		}
		
		while(p1 >= 0 && vis[a[p1].second])p1--;
		while(p2 >= 0 && vis[b[p2].second])p2--;
		while(p3 >= 0 && vis[c[p3].second])p3--;
		if(ok)break;
	}
	out(ans);
}
#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...