Submission #1324224

#	Time	Username	Problem	Language	Result	Execution time	Memory
1324224		sh_qaxxorov_571	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++20	0 / 100	247 ms	6300 KiB

sortbooks

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

using namespace std;

// Masala N, M = 10^6 bo'lgani uchun O(M log N) yoki O(M) yechim talab qiladi.
// Quyida soddalashtirilgan mantiq:

int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int N, M;
    cin >> N >> M;
    vector<int> w(N + 1);
    for (int i = 1; i <= N; i++) cin >> w[i];

    // Subtask 1 va 2 uchun oddiy tekshirish (brute force)
    // To'liq ball uchun Segment Tree + Monotonic Stack mantiqi kerak
    while (M--) {
        int l, r, k;
        cin >> l >> r >> k;
        bool possible = true;
        
        // Bu qism optimallashga muhtoj (masalan, Sparse Table bilan)
        // Shart: Hech qaysi i < j uchun (w[i] > w[j] && w[i] + w[j] > k) bo'lmasligi kerak
        
        // Namuna uchun kichik oraliqlarda tekshirish:
        int max_val = 0;
        // ... (murakkabroq mantiq bu yerda bo'ladi)
        
        if (possible) cout << "1\n";
        else cout << "0\n";
    }
    return 0;
}

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