#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define blt(x) __builtin_popcount(x)
#define pb push_back
#define popf pop_front
#define popb pop_back
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
fastIO();
if (str != "") {
freopen((str + ".in").c_str(), "r", stdin);
freopen((str + ".out").c_str(), "w", stdout);
}
}
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 150005, M = 5005;
int x[N], y[N], z[N];
int n, mat[M][M];
map<int, vector<pair<int, int>>> mp;
bool marked[M][M];
struct segTreeMax {
vector<long long> mTree;
int size;
void init(long long n) {
size = 1;
while(size < n) {
size *= 2;
}
mTree.assign(2 * size - 1, INT64_MIN);
}
void upd(int u, long long v, int x, int lx, int rx) { // set value at pos u
if(rx - lx == 1) {
mTree[x] = max(mTree[x], v);
return;
}
int m = (lx + rx) / 2;
if(u < m) {
upd(u, v, 2 * x + 1, lx, m);
}else {
upd(u, v, 2 * x + 2, m, rx);
}
mTree[x] = max(mTree[2 * x + 1], mTree[2 * x + 2]);
}
void upd(int u, long long v) {
upd(u, v, 0, 0, size);
}
long long qry (int l, int r, int x, int lx, int rx) { // range queries
if(l >= rx || lx >= r) {
return INT64_MIN;
}
if(lx >= l && r >= rx) {
return mTree[x];
}
int m = (rx + lx) / 2;
long long s1 = qry(l, r, 2 * x + 1, lx, m);
long long s2 = qry(l, r, 2 * x + 2, m, rx);
return max(s1, s2);
}
long long qry(int l, int r) {
return qry(l, r, 0, 0, size);
}
};
segTreeMax seg_max;
void solve_() {
cin >> n;
vector<pair<long long, int>> xs, ys, zs;
vector<pair<pair<long long, long long>, int>> vec;
vector<long long> values_x, values_y;
for(int i = 1; i <= n; i++) {
cin >> x[i] >> y[i] >> z[i];
values_x.push_back(x[i]);
values_y.push_back(y[i]);
vec.push_back({{x[i], y[i]}, z[i]});
}
// if(n <= 4000) {
// sort(all(vec));
// uniq(vec);
// sort(all(values_x));
// uniq(values_x);
// sort(all(values_y));
// uniq(values_y);
// n = sz(vec);
// auto getx = [&](long long val)-> int {
// return lower_bound(all(values_x), val) - values_x.begin() + 1;
// };
// auto gety = [&](long long val)-> int {
// return lower_bound(all(values_y), val) - values_y.begin() + 1;
// };
// for(int i = 1; i <= n; i++) {
// x[i] = getx(vec[i - 1].first.first);
// y[i] = gety(vec[i - 1].first.second);
// z[i] = vec[i - 1].second;
// if(x[i] < M && y[i] < M) {
// mat[x[i]][y[i]] = max(mat[x[i]][y[i]], vec[i - 1].second);
// }
// //
// xs.emplace_back(x[i], i);
// ys.emplace_back(y[i], i);
// zs.emplace_back(z[i], i);
// }
// for(int i = 0; i < M; i++) {
// for(int j = 0; j < M; j++) {
// if(i - 1 >= 0) {
// mat[i][j] = max(mat[i][j], mat[i - 1][j]);
// }
// if(j - 1 >= 0) {
// mat[i][j] = max(mat[i][j], mat[i][j - 1]);
// }
// }
// }
// sort(rall(xs));
// sort(rall(ys));
// sort(rall(zs));
// long long answ = -1;
// for(int i = 0; i < n; i++) {
// for(int j = 0; j < n; j++) {
// int xx = xs[i].second, yy = ys[j].second;
// if(x[xx] <= x[yy]) {
// continue;
// }
// if(y[yy] <= y[xx]) {
// continue;
// }
// int mx_z = 0;
// if(x[xx] && y[yy]) {
// mx_z = mat[x[xx] - 1][y[yy] - 1];
// }
// if(mx_z && mx_z > z[xx] && mx_z > z[yy] && values_x[x[xx] - 1] + values_y[y[yy] - 1] + mx_z > answ) {
// answ = max(answ, values_x[x[xx] - 1] + values_y[y[yy] - 1] + mx_z);
// }
// }
// }
// cout << answ << '\n';
// } else {
// sort(all(vec));
// uniq(vec);
// for(int i = 1; i <= n; i++) {
// x[i] = vec[i - 1].first.first;
// y[i] = vec[i - 1].first.second;
// z[i] = vec[i - 1].second;
// if(x[i] < M && y[i] < M) {
// mat[x[i]][y[i]] = max(mat[x[i]][y[i]], vec[i - 1].second);
// }
// //
// xs.emplace_back(x[i], i);
// ys.emplace_back(y[i], i);
// zs.emplace_back(z[i], i);
// }
vector<bool> mar(M);
vector<int> mn(M, INT32_MAX);
seg_max.init(M + 1);
for(int i = 1; i <= n; i++) {
mat[x[i]][y[i]] = max(mat[x[i]][y[i]], z[i]);
marked[x[i]][y[i]] = true;
mp[x[i]].push_back({y[i], z[i]});
}
int answ = -1;
for(auto i: mp) {
for(auto j: i.second) {
for(int k = j.first + 2; k < M; k++) {
if(!mar[k]) continue;
int new_z = seg_max.qry(1, k);
if(new_z <= j.second) continue;
if(new_z <= mn[k]) continue;
answ = max(answ, i.first + k + new_z);
}
}
for(auto j: i.second) {
mar[j.first] = true;
mn[j.first] = min(mn[j.first], j.second);
seg_max.upd(j.first, j.second);
}
}
cout << answ << '\n';
// }
}
int main() {
setIO();
auto solve = [&](int test_case)-> void {
while(test_case--) {
solve_();
}
};
int test_cases = 1;
// cin >> test_cases;
solve(test_cases);
return 0;
}
Compilation message
team.cpp: In function 'void setIO(std::string)':
team.cpp:64:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
64 | freopen((str + ".in").c_str(), "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
team.cpp:65:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
65 | freopen((str + ".out").c_str(), "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
468 KB |
Output is correct |
| 2 |
Correct |
1 ms |
468 KB |
Output is correct |
| 3 |
Correct |
1 ms |
468 KB |
Output is correct |
| 4 |
Incorrect |
1 ms |
468 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
468 KB |
Output is correct |
| 2 |
Correct |
1 ms |
468 KB |
Output is correct |
| 3 |
Correct |
1 ms |
468 KB |
Output is correct |
| 4 |
Incorrect |
1 ms |
468 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
468 KB |
Output is correct |
| 2 |
Correct |
1 ms |
468 KB |
Output is correct |
| 3 |
Correct |
1 ms |
468 KB |
Output is correct |
| 4 |
Incorrect |
1 ms |
468 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
468 KB |
Output is correct |
| 2 |
Correct |
1 ms |
468 KB |
Output is correct |
| 3 |
Correct |
1 ms |
468 KB |
Output is correct |
| 4 |
Incorrect |
1 ms |
468 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
468 KB |
Output is correct |
| 2 |
Correct |
1 ms |
468 KB |
Output is correct |
| 3 |
Correct |
1 ms |
468 KB |
Output is correct |
| 4 |
Incorrect |
1 ms |
468 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
468 KB |
Output is correct |
| 2 |
Correct |
1 ms |
468 KB |
Output is correct |
| 3 |
Correct |
1 ms |
468 KB |
Output is correct |
| 4 |
Incorrect |
1 ms |
468 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
468 KB |
Output is correct |
| 2 |
Correct |
1 ms |
468 KB |
Output is correct |
| 3 |
Correct |
1 ms |
468 KB |
Output is correct |
| 4 |
Incorrect |
1 ms |
468 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
