Submission #308792

#	Time	Username	Problem	Language	Result	Execution time	Memory
308792		nikatamliani	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	8 / 100	3080 ms	4344 KiB

sortbooks

#include <bits/stdc++.h>
using namespace std;
int main() {
	int n, m;
	cin >> n >> m;
	int a[n + 1];
	for(int i = 1; i <= n; ++i) cin >> a[i];
	for(int i = 1; i <= m; ++i) {
		int l, r, k;
		cin >> l >> r >> k;
		bool can = 1;
		for(int x = l; x <= r; ++x) {
			for(int y = x; y <= r; ++y) {
				if(a[x] > a[y] && a[x] + a[y] > k) {
					can = false;
				} 
			}
		}
		cout << can << '\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