Submission #1171738

#	Time	Username	Problem	Language	Result	Execution time	Memory
1171738		coolboy19521	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++20	0 / 100	1 ms	328 KiB

sortbooks

#include "bits/stdc++.h"

#define mxN 102

using namespace std;

int a[mxN];

int main(){
	int N, M;
	cin >> N >> M;
	
	for (int i = 1; i <= N; i ++)
		cin >> a[i];

	while (M --){
		int L, R, K;
		cin >> L >> R >> K;
		
		int mx = 0;
		int ok = 1;
		
		for (int i = L; i <= R; i ++){
			if (mx > a[i] && a[i] + mx > K)	ok = 0;
											mx = max(mx, a[i]);
		}
		
		ok ? puts("1") : puts("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