oj.uz

Submission #490510

# Submission time Handle Problem Language Result Execution time Memory
490510 2021-11-27T17:04:07 Z fuad27 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
0 / 100
 3000 ms 14080 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};
    prefix[1] = 1;
    long long MIN = 1e18;
    for(int i = 1;i<n;i++){
        MIN = min(MIN, arr[i]);
        prefix[i+1] = (prefix[i]+(arr[i] >= arr[i-1]));
    }
    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-1] == 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
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 0 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 0 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

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

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2732 ms 1868 KB Output is correct
2 Execution timed out 3060 ms 1972 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 Incorrect 0 ms 204 KB Output isn't correct
3 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 Incorrect 0 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -