#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define all(v) v.begin(),v.end()
void boos() {
ios_base :: sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
const int N = 3e5 + 100;
const int M = 4e3 + 100;
const ll LLINF = (ll)1e18;
ll a[N],b[N],c[N];
int mn[M][M],mn1[M][M],mn2[M][M];
int n;
bool cmp(int x,int y) {
return a[x] < a[y];
}
bool cmp1(int x,int y) {
return b[x] < b[y];
}
ll check(ll x,ll y,ll t) {
bool ch = 0,ch1 = 0,ch2 = 0;
for(int i = 1;i <= n;i++) {
if(a[i] == x && b[i] < y && c[i] < t)ch = 1;
if(a[i] < x && b[i] == y && c[i] < t)ch1 = 1;
if(a[i] < x && b[i] < y && c[i] == t)ch2 = 1;
}
if(ch && ch1 && ch2)return x + y + t;
else return -1;
}
void solve() {
cin >> n;
vector <int> g,q;
ll mx = 0;
for(int i = 1;i <= n;i++) {
cin >> a[i] >> b[i] >> c[i];
mx = max(mx,a[i]);
mx = max(mx,b[i]);
mx = max(mx,c[i]);
g.pb(i);
q.pb(i);
}
ll ans = -1;
if(mx <= 300) {
for(int i = 1;i <= mx;i++) {
for(int j = 1;j <= mx;j++) {
mn[i][j] = mx + 1;
mn1[i][j] = mx + 1;
mn2[i][j] = mx + 1;
}
}
for(int i = 1;i <= n;i++) {
mn[a[i]][b[i] + 1] = c[i];
mn1[b[i]][a[i] + 1] = c[i];
mn2[c[i]][a[i] + 1] = b[i];
}
for(int i = 1;i <= mx;i++) {
for(int j = 2;j <= mx;j++) {
mn[i][j] = min(mn[i][j],mn[i][j - 1]);
mn1[i][j] = min(mn1[i][j],mn1[i][j - 1]);
mn2[i][j] = min(mn2[i][j],mn2[i][j - 1]);
}
}
for(int i = 1;i <= mx;i++) {
for(int j = 1;j <= mx;j++) {
for(int h = 1;h <= mx;h++) {
if(mn[i][j] < h && mn1[j][i] < h && mn2[h][i] < j)ans = max(ans,(ll)(i + j + h));
}
}
}
cout << ans;
return;
}
sort(all(g),cmp);
sort(all(q),cmp1);
for(auto v : g) {
ll mxa = a[v];
set <ll> tt;
//cout << v << " -- " << a[v] << endl;
for(int j = 0;j < q.size();j++) {
int to = q[j];
ll mxb = b[to];
//cout << to << " :: " << b[to] << " == ";
if(j > 0 && b[q[j - 1]] != b[to]) {
int pos = j - 1;
while(pos >= 0 && b[q[pos]] == b[q[j - 1]]) {
int p = q[pos];
if(a[p] < mxa)tt.insert(c[p]);
pos--;
}
}
if(a[to] >= mxa || b[v] >= mxb) {
//cout << "fail" << endl;
continue;
}
if(!tt.empty()) {
ll val = *(tt.rbegin());
if(val > max(c[v],c[to]))ans = max(ans,mxa + mxb + val);
//cout << val << " ";
}
//cout << ans << endl;
}
//cout << ans << endl;
}
cout << ans;
}
int main() {
boos();
solve();
}
Compilation message
team.cpp: In function 'void solve()':
team.cpp:82:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
82 | for(int j = 0;j < q.size();j++) {
| ~~^~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
340 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
340 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
340 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
340 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
340 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
340 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
340 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
340 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
340 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
340 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
340 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
340 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
340 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
340 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
