oj.uz

Submission #490513

# Submission time Handle Problem Language Result Execution time Memory
490513 2021-11-27T17:06:52 Z fuad27 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
30 / 100
 3000 ms 14616 KB 
#include<bits/stdc++.h>
using namespace std;
const long long N = 1e6 + 10;
int main () {
    int n, m;
    cin >> n >> m;
    long long arr[n];
    for(int i = 0;i<n;i++)cin>>arr[i];
    int prefix[n+1] = {0};
    long long MIN = arr[0];
    for(int i = 2;i<=n;i++){
        MIN = min(MIN, arr[i-1]);
        prefix[i] = (prefix[i-1]+(arr[i-1] >= arr[i-2]));
    }
    while(m--) {
        int l, r, m;
        cin >> l >> r >> m;
        long long MAX = arr[l-1],ans = 0; 
        if(m <= MIN) {
            cout << (prefix[r]-prefix[l] == r-l) << endl;
        }
        else {
        for(int i = l;i<r;i++) {
            MAX = max(arr[i],MAX);
            if(arr[i] < MAX)
            ans = max(ans, MAX+arr[i]);
        }
        cout << (ans <= m) << endl;}
    }
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 2 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 2 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 2 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 2 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 2 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 2 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 9 ms 204 KB Output is correct
12 Correct 18 ms 356 KB Output is correct
13 Correct 14 ms 332 KB Output is correct
14 Correct 22 ms 360 KB Output is correct
15 Correct 20 ms 348 KB Output is correct
16 Correct 21 ms 332 KB Output is correct
17 Correct 17 ms 348 KB Output is correct
18 Correct 24 ms 356 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2533 ms 14140 KB Output is correct
2 Correct 2600 ms 14340 KB Output is correct
3 Correct 2620 ms 14616 KB Output is correct
4 Correct 2678 ms 14480 KB Output is correct
5 Correct 2641 ms 14476 KB Output is correct

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2802 ms 1720 KB Output is correct
2 Execution timed out 3060 ms 1632 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 2 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 2 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 2 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 9 ms 204 KB Output is correct
12 Correct 18 ms 356 KB Output is correct
13 Correct 14 ms 332 KB Output is correct
14 Correct 22 ms 360 KB Output is correct
15 Correct 20 ms 348 KB Output is correct
16 Correct 21 ms 332 KB Output is correct
17 Correct 17 ms 348 KB Output is correct
18 Correct 24 ms 356 KB Output is correct
19 Execution timed out 3078 ms 2916 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 2 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 2 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 2 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 9 ms 204 KB Output is correct
12 Correct 18 ms 356 KB Output is correct
13 Correct 14 ms 332 KB Output is correct
14 Correct 22 ms 360 KB Output is correct
15 Correct 20 ms 348 KB Output is correct
16 Correct 21 ms 332 KB Output is correct
17 Correct 17 ms 348 KB Output is correct
18 Correct 24 ms 356 KB Output is correct
19 Correct 2533 ms 14140 KB Output is correct
20 Correct 2600 ms 14340 KB Output is correct
21 Correct 2620 ms 14616 KB Output is correct
22 Correct 2678 ms 14480 KB Output is correct
23 Correct 2641 ms 14476 KB Output is correct
24 Correct 2802 ms 1720 KB Output is correct
25 Execution timed out 3060 ms 1632 KB Time limit exceeded
26 Halted 0 ms 0 KB -