oj.uz

Submission #887580

# Submission time Handle Problem Language Result Execution time Memory
887580 2023-12-14T18:50:53 Z MinaRagy06 Team Contest (JOI22_team) C++17
0 / 100
 1 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long

const int inf = 1e9;
int main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	int n;
	cin >> n;
	array<ll, 3> a[n];
	for (int i = 0; i < n; i++) {
		cin >> a[i][0] >> a[i][1] >> a[i][2];
	}
	sort(a, a + n);
	ll ans = -1;
	int cur = 0;
	for (int i = 0; i < n; i++) {
		while (a[cur][0] < a[i][0]) cur++;
		ll mx[2] = {-inf, -inf};
		ll mx2[2] = {-inf, -inf};
		for (int j = 0; j < cur; j++) {
			mx[0] = max(mx[0], a[j][2]);
			mx[1] = max(mx[1], a[j][2]);
		}
		ll x = 1e9;
		for (int j = 0; j < cur; j++) {
			if (a[j][2] < mx[1]) {
				if (a[j][1] == mx2[0]) {
					x = min(x, a[j][2]);
				} else if (a[j][1] > mx2[0]) {
					x = a[j][2];
					mx2[0] = max(mx2[0], a[j][1]);
				}
			}
		}
		for (int j = 0; j < cur; j++) {
			if (a[j][1] < mx2[0]) {
				mx2[1] = max(mx2[1], a[j][2]);
			}
		}
		if (mx2[1] > x && mx2[0] > a[i][1] && mx2[1] > a[i][2]) {
			ans = max(ans, a[i][0] + mx2[0] + mx2[1]);
		}

		mx2[0] = -inf, mx2[1] = -inf;
		x = 1e9;
		for (int j = 0; j < cur; j++) {
			if (a[j][1] < mx[0]) {
				if (a[j][2] == mx2[1]) {
					x = min(x, a[j][1]);
				} else if (a[j][2] > mx2[1]) {
					x = a[j][1];
					mx2[1] = max(mx2[1], a[j][2]);
				}
			}
		}
		for (int j = 0; j < cur; j++) {
			if (a[j][2] < mx2[1]) {
				mx2[0] = max(mx2[0], a[j][1]);
			}
		}
		if (mx2[0] > x && mx2[0] > a[i][1] && mx2[1] > a[i][2]) {
			cout << a[i][0] << ' ' << mx2[0] << ' ' << mx2[1] << '\n';
			ans = max(ans, a[i][0] + mx2[0] + mx2[1]);
		}
	}
	cout << ans << '\n';
	return 0;
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -