Submission #772321

#	Time	Username	Problem	Language	Result	Execution time	Memory
772321		ttamx	Team Contest (JOI22_team)	C++14	0 / 100	1 ms	320 KiB

team

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N=150005;

int n;
priority_queue<pair<int,int>> pq[3];

int main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    cin >> n;
    for(int i=1;i<=n;i++){
        for(int j=0;j<3;j++){
            int x;
            cin >> x;
            pq[j].emplace(x,i);
        }
    }
    while(!pq[0].empty()&&!pq[1].empty()&&!pq[2].empty()){
        set<int> s;
        for(int i=0;i<3;i++){
            for(int j=0;j<i;j++){
                if(pq[i].top().second==pq[j].top().second){
                    s.emplace(i);
                    s.emplace(j);
                }
            }
        }
        if(s.empty()){
            ll sum=0;
            for(int i=0;i<3;i++)sum+=pq[i].top().first;
            cout << sum;
            exit(0);
        }
        for(auto x:s)pq[x].pop();
    }
    cout << -1;
}

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