Submission #651211

#	Time	Username	Problem	Language	Result	Execution time	Memory
651211		lemonislemon	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	17 / 100	16 ms	468 KiB

sortbooks

#include <iostream>
#include <vector>
using namespace std;
const int MAXN = 5005;
int w[MAXN];
void solve() {
	int n, m;
	cin >> n >> m;
	for(int i = 1; i <= n; ++i) {
		cin >> w[i];	
	}
	for(int i = 1; i <= m; ++i) {
		int l, r, k;
		cin >> l >> r >> k;
		int summx = 0;
		int mx = 0;
		for(int j = l; j <= r; ++j) {
			int val = w[j];
			if(val < mx) summx = max(summx, val + mx);  
			else mx = val;
		}
		if(summx > k) cout << "0\n";
		else cout << "1\n";	
	}
}
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	solve();
}

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