Submission #587551

#	Time	Username	Problem	Language	Result	Execution time	Memory
587551		SeDunion	Team Contest (JOI22_team)	C++17	8 / 100	2090 ms	3772 KiB

team

#include<iostream>
#include<vector>
#include<assert.h>

using namespace std;
using ll = long long;

const int N = 2e5 + 123;

ll ix[N], iy[N], iz[N];

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n;
	cin >> n;
	ll ans = 0;
	for (int i = 0 ; i < n ; ++ i) {
		cin >> ix[i] >> iy[i] >> iz[i];
	}
	for (int i = 0 ; i < n ; ++ i) {
		for (int j = 0 ; j < n ; ++ j) {
			for (int k = 0 ; k < n ; ++ k) {
				if (ix[i] > max(ix[j], ix[k]) && 
					iy[j] > max(iy[i], iy[k]) && 
					iz[k] > max(iz[i], iz[j])) {
					ans = max(ans, ix[i] + iy[j] + iz[k]);
				}
			}
		}
	}
	cout << (ans ? ans : -1);
}

• Subtask 1: 8 / 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