Submission #887536

#	Time	Username	Problem	Language	Result	Execution time	Memory
887536		MinaRagy06	Team Contest (JOI22_team)	C++17	0 / 100	2073 ms	2836 KiB

team

#include <bits/stdc++.h>
using namespace std;
#define ll long long

int main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	int n;
	cin >> n;
	array<int, 3> a[n];
	array<int, 3> mx = {0, 0, 0};
	for (int i = 0; i < n; i++) {
		cin >> a[i][0] >> a[i][1] >> a[i][2];
		mx[0] = max(mx[0], a[i][0]);
		mx[1] = max(mx[1], a[i][1]);
		mx[2] = max(mx[2], a[i][2]);
	}
	int ans = -1;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			for (int k = 0; k < n; k++) {
				if (a[i][0] != mx[0] && a[j][1] != mx[1] && a[k][2] != mx[2]) continue;
				if (a[i][0] > a[j][0] && a[i][0] > a[k][0] && 
					a[j][1] > a[i][1] && a[j][1] > a[k][1] && 
					a[k][2] > a[i][2] && a[k][2] > a[j][2]) {
					ans = max(ans, a[i][0] + a[j][1] + a[k][2]);
				}
			}
		}
	}
	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