Submission #1335850

#TimeUsernameProblemLanguageResultExecution timeMemory
1335850sporknivesHedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++20
0 / 100
1 ms344 KiB
#include <bits/stdc++.h>
#define int long long
using namespace std;

signed main() {
	int n,q; cin>>n>>q;
	if(n>1000)return 0;
	int a[n]; for(int i=0;i<n;i++) cin>>n;
	for(int i=0;i<q;i++) {
		int l,r,k; cin>>l>>r>>k; l--; r--;
		int mx=0;
		for(int j=l;j<=r;j++) {
			for(int m=j+1;m<=r;m++) {
				if(a[j]>a[m]) {
					mx=max(mx,a[j]+a[m]);
				}
			}
		}
		if(mx>k) cout<<0;
		else cout<<1;
		cout<<"\n";
	}
	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...