Submission #887289

#	Time	Username	Problem	Language	Result	Execution time	Memory
887289		Hovhannes1234	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	0 / 100	2165 ms	21096 KiB

sortbooks

#include <bits/stdc++.h>
using namespace std;
 
const int N=1e6+10;
int a[N];
bool sorted[N];

 
int main() {
	int n,m;
	cin>>n>>m;
	sorted[0]=true;
	for(int i=1; i<=n; i++)
	{
		cin>>a[i];
		if(sorted[i-1] && a[i] >= a[i-1])sorted[i]=true;
	}
	
	for(int i=1; i<=m; i++){
		int l,r,k;
		cin>>l>>r>>k;
		bool ans=true;
		if(sorted[r]){
			cout<<ans;
			continue;
		}
		for(int i=l; i<r; i++){
			if(a[i] > a[i+1]){
				ans=false;
				break;
			}
		}
		cout<<ans<<endl;
	}
}

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