Submission #889847

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
889847	2023-12-20T08:09:20 Z	rati	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++11	0 / 100	3000 ms	9560 KB

sortbooks

#include <bits/stdc++.h>

using namespace std;
long long m,n;
long long ar[10000001];

int main(){
    cin>>n>>m;
    for(long long i=0;i<n;i++) cin>>ar[i];
    for(long long i=0;i<m;i++){
        long long l,r,k;
        cin>>l>>r>>k;
        long long maxdif=0;
        long long cur=ar[l-1];
        for(long long 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	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	348 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	348 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	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	348 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	348 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	3006 ms	9560 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #4

0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	2513 ms	2652 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	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	348 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	348 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	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	348 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	348 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	-