#include <time.h>
#include <cstdlib>
#include <stack>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <map>
#include <set>
#include <iterator>
#include <deque>
#include <queue>
#include <sstream>
#include <array>
#include <string>
#include <tuple>
#include <chrono>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <list>
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <bitset>
#define ll long long
using namespace std;
int tt = 1, n;
ll x[200005], y[200005], z[200005];
pair<pair<ll, ll>, pair<ll, int>> p[200005];
vector<int> g1[3003], g2[3003], g3[3003];
ll mx;
int main(){
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
cin >> n;
for(int i = 1; i <= n; i++){
cin >> x[i] >> y[i] >> z[i];
p[i] = {{x[i], y[i]}, {z[i], i}};
}
if(n <= 4000){
sort(p + 1, p + n + 1);
for(int i = 3; i <= n; i++){
set<ll> st;
vector<pair<ll, ll>> v;
for(int j = i - 1; j >= 1; j--){
if(p[i].first.first != p[j].first.first)
v.push_back({p[j].first.second, j});
}
sort(v.begin(), v.end());
// for(int j = 0; j < v.size(); j++){
// if(j == 0) mx[j] = p[v[j].second].second.first;
// else mx[j] = max(mx[j - 1], p[v[j].second].second.first);
// }
int last = 0;
for(int j = 1; j < v.size(); j++){
while(last < j && v[last].first != v[j].first){
st.insert(p[v[last].second].second.first);
last++;
}
if(!st.empty() && p[v[j].second].second.first < *st.rbegin() && v[j].first > p[i].first.second && p[i].second.first < *st.rbegin()){
mx = max(mx, p[i].first.first + v[j].first + *st.rbegin());
// cout << p[i].first.first << " " << v[j].first << " " << *st.rbegin() << "\n";
}
}
}
if(mx == 0) cout << -1;
else cout << mx;
return 0;
}
for(int i = 1; i <= n; i++){
g1[x[i]].push_back(i);
g2[y[i]].push_back(i);
g3[z[i]].push_back(i);
}
int mxx = 0;
for(int i = 1; i <= 20; i++){
for(int j = 1; j <= 20; j++){
// vector<int> v;
for(int k = 1; k <= 20; k++){
int kol1 = 0, kol2 = 0, kol3 = 0;
for(int to1 : g1[i])
if(y[to1] < j && z[to1] < k) kol1++;
for(int to1 : g2[j])
if(x[to1] < i && z[to1] < k) kol2++;
for(int to1 : g3[k])
if(y[to1] < j && x[to1] < i) kol3++;
if(min(kol1, kol2, kol3) > 0)
mxx = max(mxx, i + j + k);
}
}
}
if(mxx == 0) cout << -1;
else cout << mxx;
}
Compilation message
team.cpp: In function 'int main()':
team.cpp:58:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
58 | for(int j = 1; j < v.size(); j++){
| ~~^~~~~~~~~~
In file included from /usr/include/c++/10/deque:60,
from /usr/include/c++/10/stack:60,
from team.cpp:3:
/usr/include/c++/10/bits/stl_algobase.h: In instantiation of 'constexpr const _Tp& std::min(const _Tp&, const _Tp&, _Compare) [with _Tp = int; _Compare = int]':
team.cpp:90:40: required from here
/usr/include/c++/10/bits/stl_algobase.h:281:17: error: '__comp' cannot be used as a function
281 | if (__comp(__b, __a))
| ~~~~~~^~~~~~~~~~
