제출 #1138203

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1138203		Shadow1	Team Contest (JOI22_team)	C++20	100 / 100	106 ms	12236 KiB

team

// Programmer: Shadow1

#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
using namespace std;

using ll = long long;
using ld = long double;
using ull = unsigned long long;
using str = string; // yay python!

#define i64 int64_t
#define show(x) cerr << (#x) << " = " << (x) << '\n';
#define output_vector(v) for(auto &x : v){cout << x << ' ';}cout << '\n';
#define output_pairvector(v) for(auto &x : v){cout << x.first << " " << x.second << '\n';}
#define read_vector(v) for(auto &x : v){cin >> x;}
#define vt vector
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define pii pair<int,int>
#define fir first
#define sec second
#define sz(x) ll(x.size())
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define int long long
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
// 
// 


const int INF = 1e15;

void solve() {
    int n; cin >> n;
    priority_queue<pii> a, b, c;
    vector<int> x(n), y(n), z(n);
    for(int i=0; i<n; ++i) {
        cin >> x[i] >> y[i] >> z[i];
        a.push({x[i], i});
        b.push({y[i], i});
        c.push({z[i], i});
    }
    vector<bool> done(n);
    bool  have = true;
    while(!a.empty() && !b.empty() &&!c.empty()) {
        have = true;
        if(y[a.top().sec] == y[b.top().sec] || z[a.top().sec] == z[c.top().sec]) {
            done[a.top().sec] = true;
            have = false;
        }
        if(x[b.top().sec] == x[a.top().sec] || z[b.top().sec] == z[c.top().sec]) {
            done[b.top().sec] = true;
            have = false;
        }
        if(x[c.top().sec] == x[a.top().sec] || y[c.top().sec] == y[b.top().sec]) {
            done[c.top().sec] = true;
            have = false;
        }
        if(have) {
            cout << a.top().fir + b.top().fir + c.top().fir << '\n';
            return;
        }
        while(!a.empty() && done[a.top().sec]) a.pop();
        while(!b.empty() && done[b.top().sec]) b.pop();
        while(!c.empty() && done[c.top().sec]) c.pop();
    }
    cout << -1 << '\n';
}






// CHECK YOUR OVERFLOWS!!!! 
signed main() {
    // freopen("output.txt", "w", stdout);
    // freopen("input.txt", "r", stdin);
    ios::sync_with_stdio(false);
    cin.tie(NULL); 
    int T = 1;
    // cin >> T;
    for(int tc = 1; tc <= T; ++tc) {
        // cout << "Case #" << tc << ": ";
        solve();
    }

    return 0;
}

• 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