#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 = 250005, M = 5005;
long long x[N], y[N], z[N];
long long n, is_del[N];
long long mat[M][M];
set<pair<long long, long long>> sty, stz;
void del(long long index) {
if(sty.find({y[index], index}) != sty.end()) sty.erase({y[index], index});
if(stz.find({z[index], index}) != stz.end()) stz.erase({z[index], index});
}
struct node {
long long x, y, z;
long long index;
};
vector<node> vecc;
bool cmp(node a, node b) {
return a.x >= b.x;
}
void solve_() {
cin >> n;
vector<pair<long long, int>> xs, ys, zs;
vector<pair<pair<long long, long long>, long long>> vec;
vector<long long> values_x, values_y;
for(int i = 1; i <= n; i++) {
cin >> 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 {
for(int i = 1; i <= n; i++) {
vecc.push_back({x[i], y[i], z[i], i});
//
sty.insert({y[i], i});
stz.insert({z[i], i});
}
sort(all(vecc), cmp);
long long answ = -1;
for(int i = 0; i < n; i++) {
int j = i;
while(j < n && vecc[i].x == vecc[j].x) {
del(vecc[j].index);
j++;
}
while (sz(sty) && sz(stz)) {
auto yy = *sty.rbegin();
auto zz = *stz.rbegin();
if(z[yy.second] == zz.first) {
del(yy.second);
} else if(y[zz.second] == yy.first) {
del(zz.second);
} else {
break;
}
}
int my = -1, mz = -1;
if(sz(sty) && sz(stz)) {
my = sty.rbegin()->first;
mz = stz.rbegin()->first;
}
for(int k = i; k < j; k++) {
if(k < n && my > vecc[k].y && mz > vecc[k].z) {
answ = max(answ, vecc[k].x + my + mz);
}
}
i = j - 1;
}
cout << answ << endl;
}
}
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 |
Incorrect |
182 ms |
196416 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
182 ms |
196416 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
183 ms |
196408 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
183 ms |
196408 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
183 ms |
196408 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
183 ms |
196408 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
182 ms |
196416 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
