제출 #341855

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
341855		boykut	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	21 / 100	3070 ms	10348 KiB

sortbooks

#include <bits/stdc++.h>

using namespace std;

#define work_with_io ios::sync_with_stdio(0);cin.tie(0);
//#define int long long

signed main() {
	std::work_with_io;
	int q = 1;
	//cin >> q;
	while (q--) {
		int n, m;
		cin >> n >> m;
		int a[n];
		for (int i = 0; i < n; i++) {
			cin >> a[i];
		}
		int mna = *min_element(a, a + n);
		int dp[n];
		dp[0] = 1;
		for (int i = 1; i < n; i++) {
			if (a[i] >= a[i - 1])
				dp[i] = dp[i - 1] + 1;
			else
				dp[i] = 1;
		}
		for (int tmp = m; tmp--;) {
			int l, r, k;
			cin >> l >> r >> k;
			l--;r--;
			if (k < mna) {
				if (r-l+1 <= dp[r])
					cout << "1\n";
				else
					cout << "0\n";
			} else {
				int ans = 1;
				for (int left = l; left <= r; left++) {
					for (int right = left + 1; right <= r; right++) {
						if (a[left] > a[right] && a[left] + a[right] > k)
							ans = 0;
					}
				}
				cout << ans << '\n';
			}
		}
	}
	return 0;
}

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