Submission #1071315

#TimeUsernameProblemLanguageResultExecution timeMemory
1071315vjudge1Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++17
8 / 100
3094 ms6332 KiB
#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m;
	cin>>n>>m;
	int a[n];
	for(int i=1 ;i<=n ;i++){
		cin>>a[i];
	}
	while(m--){
		int l,r,k; 
		cin>>l>>r>>k;
		int qwemsafovorlpwqpkwqekxzcmnldsfjoewirmfkdintaaacinaaaforaaaaaaaaaaaaaaa=0;
		for(int i=l ;i<=r ;i++){
			for(int j=i+1 ;j<=r; j++){
				if (a[i]+a[j]>k && a[i]>a[j]){
					cout<<"0\n";
					//cout<<a[i]<<" "<<a[j]<<" "<<i<<" "<<j<<" "<<k<<" \n";
					qwemsafovorlpwqpkwqekxzcmnldsfjoewirmfkdintaaacinaaaforaaaaaaaaaaaaaaa=1;
					i=r+1;
					j=r+1;
				}
			}
		}
		if(qwemsafovorlpwqpkwqekxzcmnldsfjoewirmfkdintaaacinaaaforaaaaaaaaaaaaaaa==0){
			cout<<"1\n";
		}
	}
}
#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...