제출 #1138186

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1138186		fzyzzz_z	Team Contest (JOI22_team)	C++20	46 / 100	22 ms	2492 KiB

team

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

using ll = long long;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n; 
    cin >> n; 
    map<int, vector<pair<int, int>>> f; 
    for (int i = 0; i < n; ++i) {
        int x, y, z; 
        cin >> x >> y >> z; 
        f[x].push_back({y, z}); 
    }

    set<pair<int, int>> st, ts; 
    int sx = -1, sy = -1; 

    int ans = -1; 
    for (auto & [d1, v]: f) {
        for (auto [x, y]: v) {
            if (x < sx && y < sy) {
                ans = max(ans, d1 + sx + sy); 
            }
        }

        for (auto [x, y]: v) {
            if (x >= sx && y >= sy) {
                if (st.find({x, y}) != st.end()) continue; 
                
                auto it = st.upper_bound({x, y}); 

                if (it != st.begin()) {
                    it--; 
                    if ((*it).second > y) {
                        sx = x; 
                        sy = (*it).second; 
                    }
                } 

                auto ti = ts.upper_bound({y, x}); 

                if (ti != ts.begin()) {
                    ti--; 
                    if ((*ti).second > x) {
                        sy = y; 
                        sx = (*ti).second; 
                    }
                }

                st.insert({x, y});
                ts.insert({y, x}); 
            } else if (x > sx) {
                sx = x; 
            } else if (y > sy) {
                sy = y; 
            }
            while (st.size()) {
                auto [x, y] = *st.begin(); 
                if (x <= sx && y <= sy) {
                    st.erase(st.begin()); 
                } else {
                    break; 
                }
            }
            while (ts.size()) {
                auto [y, x] = *st.begin(); 
                if (x <= sx && y <= sy) {
                    ts.erase(ts.begin()); 
                } else {
                    break; 
                }
            }
        }


    }

    cout << ans << "\n"; 


    return 0;
}

• Subtask 1: 8 / 8
• Subtask 2: 29 / 29
• Subtask 3: 9 / 9
• Subtask 4: 0 / 9
• Subtask 5: 0 / 9
• Subtask 6: 0 / 9
• Subtask 7: 0 / 27