oj.uz

Submission #1094969

# Submission time Handle Problem Language Result Execution time Memory
1094969 2024-10-01T04:25:47 Z eysbutno Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
0 / 100
 3000 ms 20676 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = array<int, 2>;
#define all(x) begin(x), end(x)
#define sz(x) (int) (x).size()

int main() {
    cin.tie(0) -> sync_with_stdio(0);
    int n, q;
    cin >> n >> q;
    vector<int> w(n);
    for (int &i : w) { cin >> i; }
    for (int t = 0; t < q; t++) {
        int l, r, k;
        cin >> l >> r >> k;
        --l, --r;
        vector<int> sorted;
        for (int i = l; i <= r; i++) {
            sorted.push_back(w[i]);
        }
        sort(all(sorted));
        int big = -1;
        int mn = INT_MAX;
        for (int i = r; i >= l; i--) {
            if (sorted[i - l] != w[i]) {
                big = max(big, w[i]);
                mn = min(mn, w[i]);
            }
        }
        if (big == -1) {
            cout << 1;
        } else if (mn + big <= k) {
            cout << 1;
        } else {
            cout << 0;
        }
        cout << "\n";
    }
}

// this is just for subtasks lmao to see if my sol is right

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 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 0 ms 348 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

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

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3056 ms 2316 KB Time limit exceeded
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 0 ms 348 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 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 0 ms 348 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -