# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
371147 | daniel920712 | Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) | C++14 | 614 ms | 14320 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 <iostream>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
int all[1000005];
int last[1000005];
int main()
{
int N,M,x,y,z,t,i,j;
scanf("%d %d",&N,&M);
for(i=1;i<=N;i++) scanf("%d",&all[i]);
if(N<=500&&M<=500)
{
while(M--)
{
scanf("%d %d %d",&x,&y,&z);
t=0;
for(i=x;i<=y;i++)
{
for(j=i+1;j<=y;j++)
{
if(all[i]>all[j]&&all[i]+all[j]>z)
{
t++;
}
}
}
if(t==0) printf("1\n");
else printf("0\n");
}
}
else
{
last[1]=1;
for(i=2;i<=N;i++)
{
if(all[i]>=all[i-1]) last[i]=last[i-1];
else last[i]=i;
}
while(M--)
{
scanf("%d %d %d",&x,&y,&z);
if(last[y]<=x) printf("1\n");
else printf("0\n");
}
}
return 0;
}
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... |