# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
218340 | Lawliet | Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) | C++17 | 3099 ms | 4216 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 <bits/stdc++.h>
using namespace std;
const int MAXN = 1000010;
int n, q;
int v[MAXN];
int main()
{
scanf("%d %d",&n,&q);
for(int i = 1 ; i <= n ; i++)
scanf("%d",&v[i]);
for(int i = 1 ; i <= q ; i++)
{
int L, R, k;
scanf("%d %d %d",&L,&R,&k);
int mx = 0;
for(int a = L ; a <= R ; a++)
{
for(int b = a ; b >= L ; b--)
{
if( v[b] <= v[a] ) continue;
mx = max( mx , v[b] + v[a] );
}
}
if( mx <= k ) printf("1\n");
else printf("0\n");
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |