제출 #597491

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
597491		AA_Surely	Team Contest (JOI22_team)	C++14	0 / 100	1 ms	332 KiB

team

#include <bits/stdc++.h>

#define FOR(i, x, n) for(int i = x; i < n; i++)
#define F0R(i, n) FOR(i, 0, n)
#define ROF(i, x, n) for(int i = n - 1; i >= x; i--)
#define R0F(i, n) ROF(i, 0, n)

#define WTF cout << "WTF" << endl

#define IOS ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define F first
#define S second
#define pb push_back

#define ALL(x) x.begin(), x.end()
#define RALL(x) x.rbegin(), x.rend()


using namespace std;

typedef long long LL;

typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;

typedef vector<int> VI;
typedef vector<LL> VLL;
typedef vector<PII> VPII;
typedef vector<PLL> VPLL;

const int N = 2e5 + 7;
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;

int n;
bool exist[N];
priority_queue<PII> x, y, z;

int main() {
    IOS;

    cin >> n;
    F0R(i, n) {
        int a, b, c; cin >> a >> b >> c;
        x.push({a, i}); y.push({b, i}); z.push({c, i});
        exist[i] = 1;
    }

    while(!x.empty() && !y.empty() && !z.empty()) {
        if (x.top().S == y.top().S) 
            exist[ x.top().S ] = 0;
        
        else if (x.top().S == z.top().S) 
            exist[ x.top().S ] = 0;

        else if (y.top().S == z.top().S) 
            exist[ y.top().S ] = 0;

        else {
            cout << x.top().F + y.top().F + z.top().F;
            return 0;
        }

        while(!x.empty() && !exist[x.top().S]) x.pop();
        while(!y.empty() && !exist[y.top().S]) y.pop();
        while(!z.empty() && !exist[z.top().S]) z.pop();
    }

    cout << -1;
    return 0;
}

• 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