Submission #524247

#TimeUsernameProblemLanguageResultExecution timeMemory
524247veosHedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++11
8 / 100
3077 ms8012 KiB
#include <bits/stdc++.h>
using namespace std;

#define endl '\n'

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	
	int n, m;
	cin >> n >> m;
	
	long long int w[n+1];
	w[0] = 0;
	for (int i = 1; i <=n; i++)
		cin >> w[i];
	
	for (int i = 0; i < m; i++)
	{
		int l, r, k;
		cin >> l >> r >> k;
		
		long long int sum = 0;
		for (int i=l; i<r; i++)
			for (int j=i+1; j<=r; j++)
				if (w[i]>w[j])
					sum = max( sum, (w[i]+w[j]) );
	cout << (sum<=k?1:0) << endl;}
}
#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...