Submission #587695

#	Time	Username	Problem	Language	Result	Execution time	Memory
587695		LastRonin	Team Contest (JOI22_team)	C++14	0 / 100	1 ms	320 KiB

team

#pragma GCC optimize("O3")

#include <bits/stdc++.h> 
#define ll long long
#define mp make_pair
#define f first
#define s second
#define pb push_back
#define pill pair<ll, ll>
#define speed ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
using namespace std;

const int N = 311 + 1;
const ll hsh[2] = {1555555699, 1222222763};
const ll P = 113;

ll n;
ll a[N], b[N], c[N];

int main() {
	speed;
	cin >> n;
	for(int i = 1; i <= n; i++) {
		cin >> a[i] >> b[i] >> c[i];
	}
	ll sum = 0;
	for(int j = 0; j < n; j++) {
		for(int i = 0; i < n; i++) {
			for(int k = 0; k < n; k++) { 
				if(a[j] > max(a[i], a[k]) && b[i] > max(b[j], b[k]) && c[k] > max(c[j], c[k])) {
					sum = max(sum, a[j] + b[i] + c[k]);
				}
			}
		}
	}
	cout << sum;
}

• 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