Submission #1335888

#TimeUsernameProblemLanguageResultExecution timeMemory
1335888ensonHedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++20
8 / 100
361 ms16860 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int N, M;
    cin >> N >> M;
    int W[N];
    for(int i = 0; i < N; i++) cin >> W[i];
    if (N <= 500 && M <= 500){
        int l, r, v;
        for(int i = 0; i < M; i++){
            int m = 0;
            cin >> l >> r >> v;
            for(int j = l-1; j < r; j++){
                for(int k = j+1; k < r; k++){
                    m = max(m, (W[j] > W[k]) ? W[j]+W[k] : 0);
                }
            }
            if (m > v) cout << 0 << '\n';
            else cout << 1 << '\n';
        }
    } else {
        int X[N];
        X[0] = 0;
        for(int i = 1; i < N; i++){
            if (W[i] < W[i-1]) X[i] = i;
            else X[i] = X[i-1];
        }
        int l, r, v;
        for(int i = 0; i < M; i++){
            cin >> l >> r >> v;
            if (X[r-1] <= l-1) cout << 1;
            else cout << 0;
        }
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...