제출 #843065

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

sortbooks

#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define int long long
#define pii pair<int, int>
#define ff first
#define ss second
//... max1 .... max2
//... max2 .... max1
using namespace std;


void solve(){  
    int n, m;
    cin >> n >> m;
    int a[n];
    for(int &i: a) cin >> i;
    while(m--){
        int l, r, k, mx = 0, sum = 0, ok = 1;
        cin >> l >> r >> k;
        l--, r--;
        if(n <= 5000 && m <= 5000){
            for(int i = l; i <= r; i++){
                sum = max(sum, (a[i] + mx) * (a[i] < mx));
                mx = max(mx, a[i]);
            }
            cout << (sum <= k ? "1\n" : "0\n");
        }
        else{
            for(int i = l; i < r - 1; i++){
                if(a[i] > a[i + 1]) ok = 0;
            }
            cout << (ok ? "1\n" : "0\n");
        }
    }
}

int32_t main(){
 
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
 
    int t = 1;  
    //cin >> t;
    while(t--){
        solve();
        cout << '\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