Submission #498562

#TimeUsernameProblemLanguageResultExecution timeMemory
498562The_SamuraiHedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++98
0 / 100
2517 ms6348 KiB
#include <bits/stdc++.h>
 
using namespace std;
 
void solve() {
	int n, m, l, r, k;
	
	cin >> n >> m;
	int arr[n];
	cin >> arr[0];
	bool p = 1;
	for (int i = 1; i < n; i++) {
		cin >> arr[i];
		if (arr[i - 1] > arr[i]) {
			p = 0;
		}
	}
	for (int i = 0; i < m; i++) {
		cin >> l >> r >> k;
		if (p) {
			cout << "1\n";
		}
		else {
			cout << "0\n";
		}
	}
}
 
int main() {
	int t = 1;
	
//	cin >> t;
	while (t--) {
		solve();
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...