제출 #887571

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
887571		MinaRagy06	Team Contest (JOI22_team)	C++17	0 / 100	1 ms	600 KiB

team

#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 < n; j++) {
			mx[0] = max(mx[0], a[j][2]);
			mx[1] = max(mx[1], a[j][2]);
		}
		for (int j = 0; j < n; j++) {
			if (a[j][2] < mx[1]) {
				mx2[0] = max(mx2[0], a[j][1]);
			}
		}
		for (int j = 0; j < n; j++) {
			if (a[j][1] < mx2[0]) {
				mx2[1] = max(mx2[1], a[j][2]);
			}
		}
		ans = max(ans, a[i][0] + mx2[0] + mx2[1]);

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

• Subtask 1: 0 / 8
• Subtask 2: 0 / 29
• Subtask 3: 0 / 9
• Subtask 4: 0 / 9
• Subtask 5: 0 / 9
• Subtask 6: 0 / 9
• Subtask 7: 0 / 27