# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
524331 | AzamatRustamov | Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
using namespace std;
// pair - sort
//
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, m;
scanf("%d %d", &n, &m);
int w[n+1];
w[0] = 0;
for (int i=1; i<=n; i++) scanf("%d", &w[i]);
for (int i=0; i<m; i++)
{
int l, r, k;
scanf("%d %d %d", &l, &r, &k);
bool can = 1;
for (int i = l; can && i < r; i++)
for (int j = i+1; can && j <= r; j++)
if (w[i]>w[j] && w[i]+w[j]>k)
can = 0;
printf("%d\n", can);
}
return 0;
}