제출 #634561

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
634561		PixelCat	Team Contest (JOI22_team)	C++14	0 / 100	2089 ms	3796 KiB

team

#include <bits/stdc++.h>
#define For(i, a, b) for(int i = a; i <= b; i++)
#define Forr(i, a, b) for(int i = a; i >= b; i--)
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define sz(x) ((int)x.size())
#define eb emplace_back
#define int LL
using namespace std;
using LL = long long;
using pii = pair<int, int>;

struct Owo {
    int x, y, z;
};

int32_t main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    // OAO
    int n; cin >> n;
    vector<Owo> v(n);
    for(auto &i:v) {
        cin >> i.x >> i.y >> i.z;
    }
    sort(all(v), [](const auto &a, const auto &b) {
        return a.z < b.z;
    });
    int ans = -1;
    For(r, 2, n - 1) {
        sort(v.begin(), v.begin() + r, [](const auto &a, const auto &b) {
            return a.y < b.y;
        });
        int mxx = -1e18;
        For(m, 0, r - 1) {
            if(v[m].z == v[r].z) continue;
            if(v[m].y > v[r].y && mxx > max(v[m].x, v[r].x)) {
                ans = max(ans, v[m].y + v[r].z + mxx);
            }
            mxx = max(mxx, v[m].x);
        }
    }
    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