Submission #499778

#	Time	Username	Problem	Language	Result	Execution time	Memory
499778		yahyobekabdunazarov	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	0 / 100	420 ms	14720 KiB

sortbooks

#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    int a[n], dp[n], dp2[n];
    for (int i = 0; i < n; i++){
        cin >> a[i];
    }
    dp[0]=0;
    for (int i = 1; i < n; i++){
        dp[i]=dp[i-1];
        if(a[i-1]>a[i]){
            dp[i]+=a[i-1];
        }
    }
    for(int i = 0; i<n; i++){
        dp2[i]=dp[i]+a[i];
    }
    for(int i = 0; i<m; i++){
        int l, r, k;
        cin >> l >> r >> k;
        dp2[r-1]-dp2[l-1]<=k?cout << "1\n":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