Submission #561001

#	Time	Username	Problem	Language	Result	Execution time	Memory
561001		two_sides	Team Contest (JOI22_team)	C++17	100 / 100	635 ms	26984 KiB

team

#include <bits/stdc++.h>

using namespace std;

const int N = 150005;

int x[N][3];
set<pair<int, int>> s[3];

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n; cin >> n;
    for (int i = 0; i < n; i++)
        for (int j = 0; j < 3; j++) {
            cin >> x[i][j];
            s[j].emplace(x[i][j], i);
        }
    while (s[0].size()) {
        int p = -1;
        for (int j = 0; j < 3; j++)
            for (int k = 0; k < 3; k++) {
                if (j == k) continue;
                int q = s[j].rbegin()->second;
                if (x[q][k] == s[k].rbegin()->first)
                    p = q;
            }
        if (p < 0) {
            cout << s[0].rbegin()->first
            + s[1].rbegin()->first
            + s[2].rbegin()->first;
            return 0;
        }
        for (int j = 0; j < 3; j++)
            s[j].erase(make_pair(x[p][j], p));
    }
    cout << -1;
}

• 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