제출 #770273

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
770273		Plurm	Team Contest (JOI22_team)	C++11	0 / 100	1 ms	212 KiB

team

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

map<int, vector<pair<int, int>>> bckt;
int main() {
    int n;
    cin >> n;
    vector<int> keys;
    for (int i = 0; i < n; i++) {
        int x, y, z;
        cin >> x >> y >> z;
        bckt[y].push_back({x, z});
        keys.push_back(y);
    }
    sort(keys.begin(), keys.end());
    keys.resize(unique(keys.begin(), keys.end()) - keys.begin());
    int mx = -1;
    for (int g : keys) {
        for (auto pti : bckt[g]) {
            set<tuple<int, int, int>> cand;
            int mxz = -1;
            for (int gg : keys) {
                for (auto ptk : bckt[gg]) {
                    if (ptk.first < pti.first) {
                        if (gg < g)
                            mxz = max(mxz, ptk.second);
                        cand.insert({ptk.first, gg, ptk.second});
                    }
                }
            }
            for (int gg : keys) {
                if (gg <= g)
                    continue;
                for (auto ptj : bckt[gg]) {
                    if (pti.first > ptj.first) {
                        if (mxz > pti.second && mxz > ptj.second) {
                            mx = max(mx, pti.first + gg + mxz);
                        }
                    }
                }
                for (auto ptj : bckt[gg]) {
                    if (cand.count({ptj.first, gg, ptj.second}))
                        mxz = max(mxz, ptj.second);
                }
            }
        }
    }
    cout << mx << endl;
    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