Submission #587527

#	Time	Username	Problem	Language	Result	Execution time	Memory
587527		Tekor	Team Contest (JOI22_team)	C++17	0 / 100	2086 ms	5192 KiB

team

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define all(v) v.begin(),v.end()
void boos() {
	ios_base :: sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
}
const int N = 3e5 + 100;
ll a[N],b[N],c[N];
int n;
bool cmp(int x,int y) {
	return a[x] < a[y];
}
bool cmp1(int x,int y) {
	return b[x] < b[y];
}
void solve() {
	cin >> n;
	vector <int> g,q;
	for(int i = 1;i <= n;i++) {
		cin >> a[i] >> b[i] >> c[i];
		g.pb(i);
		q.pb(i);
	}
	sort(all(g),cmp);
	sort(all(q),cmp1);
	ll ans = -1;
	for(auto v : g) {
		ll mxa = a[v];
		for(auto to : q) {
			ll mxb = b[to];
			if(a[to] >= mxa)continue;
			for(int j = 1;j <= n;j++) {
				if(a[j] < mxa && b[j] < mxb && c[j] > max(c[v],c[to])) {
					ans = max(ans,mxa + mxb + c[j]);
				}
			}
		}
	} 
	cout << ans;
}
int main() {
	boos();
	solve();
}

• 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