Submission #938606

#	Time	Username	Problem	Language	Result	Execution time	Memory
938606		Pannda	Team Contest (JOI22_team)	C++17	8 / 100	2052 ms	2392 KiB

team

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

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;
    vector<array<int, 3>> a(n);
    for (int i = 0; i < n; i++) {
        int x, y, z;
        cin >> x >> y >> z;
        a[i] = {x, y, z};
    }

    auto get = [&](int i, int j, int k) -> int {
        array<int, 3> mx;
        mx[0] = max({a[i][0], a[j][0], a[k][0]});
        mx[1] = max({a[i][1], a[j][1], a[k][1]});
        mx[2] = max({a[i][2], a[j][2], a[k][2]});
        int cnti = 0, cntj = 0, cntk = 0;
        for (int t = 0; t < 3; t++) {
            cnti += (mx[t] == a[i][t]);
            cntj += (mx[t] == a[j][t]);
            cntk += (mx[t] == a[k][t]);
        }
        if (array<int, 3>{cnti, cntj, cntk} != array<int, 3>{1, 1, 1}) return -1;
        return mx[0] + mx[1] + mx[2];
    };

    int res = -1;
    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            for (int k = j + 1; k < n; k++) {
                res = max(res, get(i, j, k));
            }
        }
    }
    cout << res << '\n';
}

• Subtask 1: 8 / 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