oj.uz

Submission #733572

# Submission time Handle Problem Language Result Execution time Memory
733572 2023-05-01T03:44:50 Z Pring Fire (JOI20_ho_t5) C++14
0 / 100
 140 ms 14816 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define endl '\n'
typedef pair<int, int> pii;

const int MXN = 200005;
int n, q, a[MXN], b[MXN], t[MXN], l[MXN], r[MXN], smg[MXN * 4];

void MONO(int w) {
    deque<pii> dq;
    for (int i = 0; i < n; i++) {
        if (dq.size() && dq.front().second <= i - w) dq.pop_front();
        while (dq.size() && dq.back().first < a[i]) dq.pop_back();
        dq.push_back({a[i], i});
        b[i] = dq.front().first;
    }
}

void build(int id, int l, int r) {
    if (l + 1 == r) {
        smg[id] = b[l];
        return;
    }
    int mid = (l + r) >> 1;
    build(id * 2 + 1, l, mid);
    build(id * 2 + 2, mid, r);
    smg[id] = smg[id * 2 + 1] + smg[id * 2 + 2];
}

int query(int id, int l, int r, int _l, int _r) {
    if (_r <= l || r <= _l) return 0;
    if (_l <= l && r <= _r) return smg[id];
    int mid = (l + r) >> 1;
    return query(id * 2 + 1, l, mid, _l, _r) + query(id * 2 + 2, mid, r, _l, _r);
}

int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> q;
    for (int i = 0; i < n; i++) cin >> a[i];
    for (int i = 0; i < q; i++) cin >> t[i] >> l[i] >> r[i];
    MONO(t[0] + 1);
    build(0, 0, n);
    for (int i = 0; i < n; i++) cout << query(0, 0, n, l[i] - 1, r[i]) << endl;
    return 0;
}

Subtask #1
0 / 1.0

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

Subtask #2
0 / 6.0

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

Subtask #3
0 / 7.0

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

Subtask #4
0 / 6.0

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

Subtask #5
0 / 80.0

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