Submission #1143588

#	Time	Username	Problem	Language	Result	Execution time	Memory
1143588		crispxx	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++20	13 / 100	292 ms	18096 KiB

sortbooks

	/**
	 *    author: a.k
	 *    created: idk
	**/
	#include <bits/stdc++.h>
	using namespace std;
	 
	#define all(x) x.begin(), x.end()
	#define int long long
	#define nl '\n'

	signed main() {
		ios::sync_with_stdio(false);
		cin.tie(nullptr);
		
		int n, m; cin >> n >> m;
		
		vector<int> a(n);
		
		for(auto &u : a) cin >> u;
		
		vector<int> pref(n + 1);
		
		for(int i = 1; i < n; i++) {
			pref[i + 1] = pref[i] + (a[i - 1] > a[i]);
		}
		
		// for(int i = 1; i <= n; i++) {
			// cout << pref[i] << ' ';
		// }
		// cout << nl;
		
		while(m--) {
			int l, r, k; cin >> l >> r >> k;
			
			cout << (pref[r] == pref[l]) << nl;
		}
	}

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