Submission #889837

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
889837	2023-12-20T08:04:52 Z	rati	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	0 / 100	3000 ms	4588 KB

sortbooks

#include <bits/stdc++.h>

using namespace std;
int m,n;
int ar[1000001];

int main(){
    cin>>n>>m;
    for(int i=0;i<n;i++)    cin>>ar[i];
    for(int i=0;i<m;i++){
        int l,r,k;
        cin>>l>>r>>k;
        int maxdif=0;
        int cur=ar[l-1];
        for(int j=l;j<r;j++){
            if(cur>=ar[j]){
                maxdif=max(maxdif,cur+ar[j]);
            }
            else{
                cur=ar[j];
            }
        }
        if(maxdif>k) cout<<0<<endl;
        else cout<<1<<endl;
    }
}

Subtask #1

0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Incorrect	1 ms	348 KB	Output isn't correct
11	Halted	0 ms	0 KB	-

Subtask #2

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Incorrect	1 ms	348 KB	Output isn't correct
11	Halted	0 ms	0 KB	-

Subtask #3

0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	3016 ms	4588 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #4

0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	2508 ms	3240 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Incorrect	1 ms	348 KB	Output isn't correct
11	Halted	0 ms	0 KB	-

Subtask #6

0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Incorrect	1 ms	348 KB	Output isn't correct
11	Halted	0 ms	0 KB	-