Submission #880405

#	Time	Username	Problem	Language	Result	Execution time	Memory
880405		dubabuba	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	0 / 100	1 ms	348 KiB

sortbooks

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

const int mxn = 55;
int a[mxn], n, m;
int b[mxn];

void go() {
	cin >> n >> m;
	for(int i = 1; i <= n; i++)
		cin >> a[i];

	while(m--) {
		int l, r, k;
		cin >> l >> r >> k;

		for(int i = 1; i <= n; i++)
			b[i] = a[i];

		bool sus = 0;
		for(int i = l; i <= r && !sus; i++)
		for(int j = l; j < r; j++) {
			if(a[j] > a[j + 1]) {
				if(a[j] + a[j + 1] > k) {
					cout << "0\n";
					sus = 1;
					break;
				}
				swap(a[j], a[j + 1]);
			}
		}

		if(!sus)
		cout << "1\n";
	}
}

int main() {
	int T = 1;
	while(T--)
		go();
	return 0;
}

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