Submission #1071221

#	Time	Username	Problem	Language	Result	Execution time	Memory
1071221		vjudge1	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	17 / 100	74 ms	8028 KiB

sortbooks

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define nn "\n";
const int N = 2e5 + 8  , inf = 1e9+7 ;
int  n , m , q ;
signed main() {
    ios_base::sync_with_stdio(0), cin.tie(0);
    cin>> n >> q;
    int w[n+1];
    int mx1 = max(n , q );
    for(int i= 1 ; i <= n; i++){
        cin>> w[i];
    }
    if(mx1 <= 5000){
        while(q--){
            int l , r , k ;
            cin>>l >> r >> k ;
            int mx =w[l] , cnt =0  ;
            for(int i =l+1 ; i <= r ; i++){
                if(w[i]< mx ){
                    cnt = max(cnt , w[i]+mx);
                }
                else mx = w[i];
            }
            if(cnt <= k ){
                cout << 1 << nn
            }
            else cout << 0 << nn
        }
    }
}

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