Submission #168062

#TimeUsernameProblemLanguageResultExecution timeMemory
168062spartan_enkhHedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++14
0 / 100
3056 ms2040 KiB
#include<bits/stdc++.h>
#define max_n 200005

using namespace std;

int main(){
	int n,m,i,k,j,l,r;
	int a[max_n];
	
	cin >> n >> m;
	for(i=1;i<=n;i++){
		cin >> a[i];
	}
	for(i=1;i<=m;i++){
		int ans=1;
		cin >> l >> r >> k;
		for(j=1;j<=r;j++){
			for(int l=j+1;l<=r;l++){
				if(a[j]>a[l] && a[j]+a[l]>k){
					ans=0;
					break;
				}
			}
			if(!ans) break;
		}
		cout << ans << endl;
	}
	return 0;
}
#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...