제출 #681034

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
681034		Matteo_Verz	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	17 / 100	3068 ms	27668 KiB

sortbooks

#include <iostream>
#include <vector>
#include <stack>
#include <algorithm>

using namespace std;

struct Query {
    int l, r, w, idx;
};

int main() {
    int n, k;
    cin >> n >> k;
    vector <int> v(n);
    vector <Query> q(k);
    for (int i = 0; i < n; i++)
        cin >> v[i];
    for (int i = 0; i < k; i++) {
        cin >> q[i].l >> q[i].r >> q[i].w;
        q[i].l--; q[i].r--;
        q[i].idx = i;
    }
    
    sort(q.begin(), q.end(), [](Query a, Query b) {
        return a.r < b.r;
    });
    vector <int> rightpos(n, -1), ans(k);
    stack <int> st;
    int j = 0;
    for (int i = 0; i < n; i++) {
        while (st.size() && v[i] >= v[st.top()])
            st.pop();
        if (st.size())
            rightpos[st.top()] = i;
        st.push(i);

        while (j < k && q[j].r == i) {
            auto qi = q[j];
            ans[qi.idx] = 0;
            for (int pos = i; pos >= qi.l; pos--)
                if (rightpos[pos] != -1)
                    ans[qi.idx] = max(ans[qi.idx], v[pos] + v[rightpos[pos]]);
            j++;
        }
    }

    sort(q.begin(), q.end(), [](Query a, Query b) {
        return a.idx < b.idx;
    });
    
    for (auto qi : q) {
        // cerr << qi.ans << '\n';
        if (ans[qi.idx] > qi.w)
            cout << 0 << '\n';
        else cout << 1 << '\n';
    }
    return 0;
}

• Subtask 1: 8 / 8
• Subtask 2: 9 / 9
• Subtask 3: 0 / 13
• Subtask 4: 0 / 17
• Subtask 5: 0 / 30
• Subtask 6: 0 / 23