Submission #498576

#	Time	Username	Problem	Language	Result	Execution time	Memory
498576		The_Samurai	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++98	8 / 100	3065 ms	8192 KiB

sortbooks

#include <bits/stdc++.h>
 
using namespace std;

/*
5 2
3 5 1 8 2
1 5 10
*/

void solve() {
	int n, m, l, r, k;
	
	cin >> n >> m;
	int arr[n];
	for (int i = 0; i < n; i++) {
		cin >> arr[i];
	}
	for (int b = 0; b < m; b++) {
		cin >> l >> r >> k;
		int a[n];
		for (int i = 0; i < n; i++) {
			a[i] = arr[i];
		}
		bool p = 1;
		for (int i = l; i < r; i++) {
			int x = a[i];
			// x = 5
			int j = i - 1;
			// j = 0
			while (j >= l - 1 && a[j] > x && a[j] + x <= k) {
				a[j + 1] = a[j];
				j--;
			}
			if (j >= l - 1 && a[j] > x) {
				p = 0;
				cout << "0\n";
				break;
			}
			a[j + 1] = x;
		}
		if (p) {
			cout << "1\n";
		}
	}
}
 
int main() {
	int t = 1;
	
//	cin >> t;
	while (t--) {
		solve();
	}
}

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