Submission #1173563

#	Time	Username	Problem	Language	Result	Execution time	Memory
1173563		VMaksimoski008	Team Contest (JOI22_team)	C++20	100 / 100	573 ms	23312 KiB

team

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

signed main() {
    int n; cin >> n;
    set<pair<int, int> > st[3];
    vector<array<int, 3> > a(n+1);
    for(int i=1; i<=n; i++) {
        cin >> a[i][0] >> a[i][1] >> a[i][2];
        for(int j=0; j<3; j++) st[j].insert({ a[i][j], i });
    }
    
    ll ans = -1;
    while(!st[0].empty() && !st[1].empty() && !st[2].empty()) {
        set<int> bad;

        for(int i=0; i<3; i++) {
            int p = st[i].rbegin()->second;
            for(int j=0; j<3; j++) {
                if(i == j) continue;
                if(a[p][j] >= st[j].rbegin()->first) bad.insert(p);
            }
        }

        if(bad.empty()) {
            for(int i=0; i<3; i++) ans += st[i].rbegin()->first;
            break;
        } else {
            for(auto p : bad) {
                for(int i=0; i<3; i++)
                    st[i].erase({ a[p][i], p });
            }
        }
    }

    cout << ans + (ans > -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