Submission #837043

#	Time	Username	Problem	Language	Result	Execution time	Memory
837043		MODDI	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	17 / 100	3068 ms	39280 KiB

sortbooks

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<long long, long long> pll;
typedef pair<int,int> pii;
typedef vector<long long> vl;
typedef vector<int> vi;
int n, m;
vi arr;
int main(){
	cin>>n>>m;
	for(int i = 0; i < n; i++){
		int a;
		cin>>a;
		arr.pb(a);
	}
	while(m--){
		int l, r, k;
		cin>>l>>r>>k;
		l--; r--;
		bool can = true;
		int maxi = -1e9;
		for(int i = l; i <= r; i++){
			if(maxi > arr[i] && maxi + arr[i] > k){
				can = false;
				break;
			}
			maxi = max(maxi, arr[i]);
		}
		cout<<can<<endl;
	}

	return 0;
}

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