oj.uz

답안 #733581

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
733581 2023-05-01T03:57:23 Z Pring Fire (JOI20_ho_t5) C++14
0 / 100
 114 ms 38940 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];
int spt[20][MXN];

void BUILDSPT() {
    for (int i = 0; i < n; i++) spt[0][i] = a[i];
    for (int i = 1; i < 20; i++) {
        for (int j = 0; j < n; j++) {
            if (j - (1 << i) < 0) spt[i][j] = spt[i - 1][j];
            else spt[i][j] = max(spt[i - 1][j], spt[i - 1][j - (1 << (i - 1))]);
        }
    }
}

int query(int w, int r) {
    int lg = __lg(w);
    if (r - (w - (1 << lg)) < 0) return spt[lg][r];
    return max(spt[lg][r - w + (1 << lg)], spt[lg][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];
    BUILDSPT();
    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;
    for (int i = 0; i < n; i++) cout << query(t[i] + 1, r[i] - 1) << endl;
    return 0;
}

Subtask #1
0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Incorrect 0 ms 468 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Incorrect 92 ms 38940 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Incorrect 114 ms 38900 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 94 ms 36840 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Incorrect 0 ms 468 KB Output isn't correct
3 Halted 0 ms 0 KB -