Submission #1093975

#	Time	Username	Problem	Language	Result	Execution time	Memory
1093975		Muhammet	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	17 / 100	3098 ms	8440 KiB

sortbooks

#include <bits/stdc++.h>

using namespace std;

const int N = 1e6;

int n, m, l[N], r[N], k[N], p[N], a[N];

int main(){
	ios::sync_with_stdio(false); cin.tie(nullptr);
	cin >> n >> m;
	for(int i = 1; i <= n; i++){
		cin >> a[i];
		p[i] = p[i-1] + (a[i] < a[i-1]);
	}
	for(int i = 1; i <= m; i++){
		cin >> l[i] >> r[i] >> k[i];
		int mx = 0, k1 = 0;
		for(int j = l[i]; j <= r[i]; j++){
			if(mx > a[j]) k1 = max(k1,a[j]+mx);
			mx = max(a[j],mx);
		}
		cout << (k1 <= k[i]) << '\n';
	}
}

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