Submission #344071

#	Time	Username	Problem	Language	Result	Execution time	Memory
344071		koketsu	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	8 / 100	3091 ms	53356 KiB

sortbooks

#include <bits/stdc++.h>
#define pb push_back
#define LL long long
#define Kultivator ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

using namespace std;

const LL Mxn = 1e6 + 7;
const LL Mod = 1e9 + 7;
const LL Inf = 1e14 + 7;

set <int> A[Mxn];

int N, M, T[Mxn];

int main() {
    Kultivator;
    cin >> N >> M;
    for(int i = 1; i <= N; i++){
        cin >> T[i];
    }
    while(M--){
        int L, R, K;
        bool Ok = false;
        cin >> L >> R >> K;
        for(int i = L; i < R; i++){
            for(int j = i + 1; j <= R; j++){
                if(T[i] > T[j] && T[i] + T[j] > K){
                    Ok = true;
                    break;
                }
            }
            if(Ok) break;
        }
        if(Ok) cout << 0 << '\n';
        else cout << 1 << '\n';
    }
}

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