Submission #843076

#	Time	Username	Problem	Language	Result	Execution time	Memory
843076		yahyobekabdunazarov	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	30 / 100	375 ms	51028 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;

const int maxn = 1e6 + 9;
int f[maxn];
void upd(int n){
    while(n < maxn){
        f[n]++;
        n += n & -n;
    }
}
int summa(int n){
    int sm = 0;
    while(n){
        sm += f[n];
        n -= n & -n;
    }
    return sm;
}
int summa(int l, int r){
    return summa(r) - summa(l);
}
void solve(){  
    int n, m;
    cin >> n >> m;
    int a[n + 1];
    a[0] = 0;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
        if(a[i] >= a[i - 1]) upd(i);
    }
    while(m--){
        int l, r, k, mx = 0, sum = 0, ok = 1;
        cin >> l >> r >> k;
        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{
            // 1 2 3 4
            // 2 1 2 3
            // 1 0 1 1
            cout << (summa(l, r) >= r - l ? "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;
}

Compilation message (stderr)

sortbooks.cpp: In function 'void solve()':
sortbooks.cpp:40:39: warning: unused variable 'ok' [-Wunused-variable]
   40 |         int l, r, k, mx = 0, sum = 0, ok = 1;
      |                                       ^~

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