Submission #1244078

#	Time	Username	Problem	Language	Result	Execution time	Memory
1244078		fskarica	Team Contest (JOI22_team)	C++20	17 / 100	2093 ms	836 KiB

team

#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define fi first
#define se second
#define pii pair<int, int>

int n;
int x, y, z;
map <int, int> mp;
vector <vector<int>> v;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    cin >> n;

    for (int i = 0; i < n; i++) {
        cin >> x >> y >> z;

        int numb = (x * 1000 + y) * 1000 + z;
        if (mp[numb]) continue;
        mp[numb] = 1;

        vector <int> bla = {x, y, z};
        v.push_back(bla);
    }

    int sol = -1;
    int m = v.size();
    for (int i = 0; i < m; i++) {
        for (int j = 0; j < m; j++) {
            if (i == j) continue;

            for (int k = 0; k < m; k++) {
                if (k == i) continue;
                if (k == j) continue;

                if (v[i][0] <= v[j][0] || v[i][0] <= v[k][0]) continue;
                if (v[j][1] <= v[i][1] || v[j][1] <= v[k][1]) continue;
                if (v[k][2] <= v[i][2] || v[k][2] <= v[j][2]) continue;

                sol = max(sol, v[i][0] + v[j][1] + v[k][2]);
            }
        }
    }

    cout << sol << "\n";

    return 0;
}

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