Submission #998143

#	Time	Username	Problem	Language	Result	Execution time	Memory
998143		onbert	Team Contest (JOI22_team)	C++17	100 / 100	91 ms	14920 KiB

team

#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int n;
    cin >> n;
    array<int, 3> a[n];
    vector<vector<pair<int,int>>> v(3, vector<pair<int,int>>(n));
    for (int i=0;i<n;i++) {
        int x, y, z;
        cin >> x >> y >> z;
        a[i] = {x, y, z};
        v[0][i] = {x, i};
        v[1][i] = {y, i};
        v[2][i] = {z, i};
    }
    for (int i=0;i<=2;i++) sort(v[i].begin(), v[i].end());
    while (v[0].size() > 0 && v[1].size() > 0 && v[2].size() > 0) {
        for (int i=0;i<=2;i++) {
            int cur = v[i].back().second;
            bool kill = 0;
            for (int j=0;j<=2;j++) if (i!=j && a[cur][j] >= v[j].back().first) {
                v[i].pop_back();
                kill = true;
                break;
            }
            if (kill) break;

            if (i==2) {
                cout << v[0].back().first + v[1].back().first + v[2].back().first << '\n';
                return 0;
            }
        }
    }
    cout << "-1\n";
}

• Subtask 1: 8 / 8
• Subtask 2: 29 / 29
• Subtask 3: 9 / 9
• Subtask 4: 9 / 9
• Subtask 5: 9 / 9
• Subtask 6: 9 / 9
• Subtask 7: 27 / 27