#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define int long long
#define rnd(l, r) uniform_int_distribution<int>(l, r)(rng)
using namespace std;
void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
int pow(int a,int b,int m){int ans=1;while(b){if(b&1){ans=(ans*a)%m;}b>>=1;a=(a*a)%m;}return ans;}
int binpow(int a,int b){int ans=1;while(b){if(b&1){ans=(ans*a);}b>>=1;a=(a*a);}return ans;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int N = 1e5, maxn =200005, inf = 2e9, MXN = 1e8 + 2;
struct node{
int mn;
node *l, *r;
node(){
mn = -1e9;
l = nullptr;
r = nullptr;
}
};
void update(node *&p, int pos, int val, int tl = 1, int tr = MXN){
if(p == nullptr){
p = new node();
}
if(tl == tr){
p -> mn = max(p -> mn, val);
return;
}
int mid = (tl + tr) >> 1;
if(pos > mid)
update(p -> r, pos, val, mid + 1, tr);
else
update(p -> l, pos, val, tl, mid);
int left = -1e9;
if(p -> l != nullptr)
left = p -> l -> mn;
int right = -1e9;
if(p -> r != nullptr)
right = p -> r -> mn;
p -> mn = max(left, right);
}
int get(node *p, int l, int r, int tl = 1, int tr = MXN){
if(p == nullptr){
return -1e9;
}
if(tl > r || tr < l || l > r)
return -1e9;
if(tl >= l && tr <= r)
return p -> mn;
int mid = (tl + tr) >> 1;
return max(get(p -> r, l, r, mid + 1, tr), get(p -> l, l, r, tl, mid));
}
int n;
void solve(vector <pair <int, pair <int,int > > > vp, int &ans){
vector <pair <int,int > > pref(n);
int pivot = 0;
node *root = new node();
for(int i = 0; i < n; i++){;
while(pivot < i && vp[pivot].ff != vp[i].ff){
pref[pivot] = {-inf, -inf};
if(pivot)pref[pivot] = pref[pivot - 1];
update(root, vp[pivot].ss.ff, vp[pivot].ss.ss);
int x = get(root, 1, vp[pivot].ss.ff - 1);
if(x > vp[pivot].ss.ss)
pref[pivot] = max(pref[pivot], {vp[pivot].ss.ff, x});
pivot++;
}
if(pivot > 0){
if(pref[pivot - 1].ff > vp[i].ss.ff && pref[pivot - 1].ss > vp[i].ss.ss){
ans = max(vp[i].ff + pref[pivot - 1].ff + pref[pivot - 1].ss , ans);
}
}
}
}
main(){
iostream::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
cin >> n;
vector <pair <int, pair <int,int > > > vp(n);
for(int i = 0; i < n; i++){
cin >> vp[i].ff >> vp[i].ss.ff >> vp[i].ss.ss;
}
sort(all(vp), [](auto a, auto b)
{
if(a.ff == b.ff){
return a.ss.ff > b.ss.ff;
}
return a.ff < b.ff;
});
int ans = -1;
solve(vp, ans);
cout << ans << endl;
}
/*
* Before implementing the problem:
Do I understand the problem correctly?
Which places are tricky? What do I need to remember to implement them correctly?
Which place is the heaviest by implementation? Can I do it simpler?
Which place is the slowest? Where do I need to be careful about constant factors and where I can choose slower but simpler implementation?
----------------------------------
If not AC:
Did you remember to do everything to handle the tricky places you thought about before?
Is the solution correct?
Do I understand the problem correctly?
----------------------------------
If you have a test on which the solution gives wrong answer:
Is the solution doing what it was supposed to do?
Is the problem in the code or in the idea?
*/
Compilation message
team.cpp:86:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
86 | main(){
| ^~~~
team.cpp: In function 'void fp(std::string)':
team.cpp:15:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
15 | void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
team.cpp:15:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
15 | void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
