oj.uz

답안 #943055

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
943055 2024-03-11T07:57:07 Z LOLOLO Two Antennas (JOI19_antennas) C++14
13 / 100
 144 ms 50796 KB 
#include <bits/stdc++.h>
typedef long long ll;

#define           f    first
#define           s    second
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (int32_t)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)

using namespace std;
const int N = 2e5 + 10;
int h[N], a[N], b[N], ans[N];
vector <pair <int, int>> ask[N], event[N];
const int lim = 1e9 + 100;

struct node{
    int mx = -1, val = lim, lz = -1;
} seg[N * 4];

void add(node &C, node A, node B) {
    C.mx = max({A.mx, B.mx, C.mx});
    C.val = min(A.val, B.val);
}

void push(int id) {
    int t = seg[id].lz;
    seg[id * 2].lz = max(seg[id * 2].lz, t);
    seg[id * 2 + 1].lz = max(seg[id * 2 + 1].lz, t);
    seg[id * 2].mx = max(seg[id * 2].mx, t - seg[id * 2].val);
    seg[id * 2 + 1].mx = max(seg[id * 2 + 1].mx, t - seg[id * 2 + 1].val);
    seg[id].lz = -1;
}

void point(int id, int l, int r, int p, int i) {
    if (l > p || r < p)
        return;

    if (l == r) {
        if (i) {
            seg[id].val = h[p];
        } else {
            seg[id].val = lim;
        }
        return;
    }

    push(id);
    int m = (l + r) / 2;
    point(id * 2, l, m, p, i);
    point(id * 2 + 1, m + 1, r, p, i);
    add(seg[id], seg[id * 2], seg[id * 2 + 1]);
}

void upd(int id, int l, int r, int u, int v, int val) {
    if (l > v || r < u || u > v)
        return;

    if (l >= u && r <= v) {
        seg[id].mx = max(seg[id].mx, val - seg[id].val);
        seg[id].lz = max(seg[id].lz, val);
        return;
    }

    int m = (l + r) / 2;
    push(id);
    upd(id * 2, l, m, u, v, val);
    upd(id * 2 + 1, m + 1, r, u, v, val);
    add(seg[id], seg[id * 2], seg[id * 2 + 1]);
}

int get(int id, int l, int r, int u, int v) {
    if (l > v || r < u || u > v)
        return -1;

    push(id);
    if (l >= u && r <= v)
        return seg[id].mx;

    int m = (l + r) / 2;
    return max(get(id * 2, l, m, u, v), get(id * 2 + 1, m + 1, r, u, v));
}

int n, q, l[N], r[N];
void solve() {
    for (int i = 1; i <= n; i++) {
        event[i + a[i]].pb({i, 1});
        event[i + b[i] + 1].pb({i, 0});
    }

    for (int i = 1; i <= q; i++) {
        ask[r[i]].pb({l[i], i});
    }

    for (int i = 1; i <= n; i++) {
        for (auto x : event[i]) {
            point(1, 1, n, x.f, x.s);
        }

        int x = max(i - b[i], 1), y = max(0, i - a[i]);
        upd(1, 1, n, x, y, h[i]);
        for (auto x : ask[i]) {
            ans[x.s] = max(ans[x.s], get(1, 1, n, x.f, i));
        }
    }
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    mem(ans, -1);
    cin >> n;

    for (int i = 1; i <= n; i++) {
        cin >> h[i] >> a[i] >> b[i];
    }

    cin >> q;
    for (int i = 1; i <= q; i++) {
        cin >> l[i] >> r[i];
    }

    solve();
    for (int i = 1; i <= n; i++) {
        event[i].clear();
        ask[i].clear();
    }

    for (int i = 1; i <= n * 4; i++) {
        seg[i].lz = -1;
        seg[i].mx = -1;
        seg[i].val = lim;
    }

    reverse(h + 1, h + n + 1);
    reverse(a + 1, a + n + 1);
    reverse(b + 1, b + n + 1);

    for (int i = 1; i <= q; i++) {
        l[i] = n - l[i] + 1;
        r[i] = n - r[i] + 1;
        swap(l[i], r[i]);
    }

    solve();

    for (int i = 1; i <= q; i++) {
        cout << ans[i] << '\n';
    }

    return 0;
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 12636 KB Output is correct
2 Correct 4 ms 12636 KB Output is correct
3 Correct 3 ms 12636 KB Output is correct
4 Correct 3 ms 12636 KB Output is correct
5 Correct 3 ms 12636 KB Output is correct
6 Correct 4 ms 12892 KB Output is correct
7 Correct 3 ms 12636 KB Output is correct
8 Correct 3 ms 12636 KB Output is correct
9 Correct 3 ms 12752 KB Output is correct
10 Correct 4 ms 12632 KB Output is correct
11 Correct 3 ms 12636 KB Output is correct
12 Correct 3 ms 12788 KB Output is correct
13 Correct 3 ms 12636 KB Output is correct
14 Correct 4 ms 12636 KB Output is correct
15 Correct 3 ms 12636 KB Output is correct
16 Correct 3 ms 12636 KB Output is correct
17 Correct 3 ms 12828 KB Output is correct
18 Correct 3 ms 12636 KB Output is correct
19 Correct 3 ms 12636 KB Output is correct
20 Correct 3 ms 12636 KB Output is correct
21 Correct 3 ms 12768 KB Output is correct
22 Correct 3 ms 12636 KB Output is correct
23 Correct 3 ms 12636 KB Output is correct
24 Correct 4 ms 13040 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 12636 KB Output is correct
2 Correct 4 ms 12636 KB Output is correct
3 Correct 3 ms 12636 KB Output is correct
4 Correct 3 ms 12636 KB Output is correct
5 Correct 3 ms 12636 KB Output is correct
6 Correct 4 ms 12892 KB Output is correct
7 Correct 3 ms 12636 KB Output is correct
8 Correct 3 ms 12636 KB Output is correct
9 Correct 3 ms 12752 KB Output is correct
10 Correct 4 ms 12632 KB Output is correct
11 Correct 3 ms 12636 KB Output is correct
12 Correct 3 ms 12788 KB Output is correct
13 Correct 3 ms 12636 KB Output is correct
14 Correct 4 ms 12636 KB Output is correct
15 Correct 3 ms 12636 KB Output is correct
16 Correct 3 ms 12636 KB Output is correct
17 Correct 3 ms 12828 KB Output is correct
18 Correct 3 ms 12636 KB Output is correct
19 Correct 3 ms 12636 KB Output is correct
20 Correct 3 ms 12636 KB Output is correct
21 Correct 3 ms 12768 KB Output is correct
22 Correct 3 ms 12636 KB Output is correct
23 Correct 3 ms 12636 KB Output is correct
24 Correct 4 ms 13040 KB Output is correct
25 Correct 101 ms 18500 KB Output is correct
26 Correct 15 ms 13660 KB Output is correct
27 Correct 140 ms 20708 KB Output is correct
28 Correct 142 ms 20628 KB Output is correct
29 Correct 94 ms 18752 KB Output is correct
30 Correct 96 ms 18384 KB Output is correct
31 Correct 103 ms 19816 KB Output is correct
32 Correct 144 ms 20660 KB Output is correct
33 Correct 119 ms 20564 KB Output is correct
34 Correct 67 ms 16724 KB Output is correct
35 Correct 133 ms 21076 KB Output is correct
36 Correct 132 ms 20560 KB Output is correct
37 Correct 76 ms 17040 KB Output is correct
38 Correct 132 ms 19840 KB Output is correct
39 Correct 22 ms 13916 KB Output is correct
40 Correct 131 ms 19796 KB Output is correct
41 Correct 97 ms 18232 KB Output is correct
42 Correct 141 ms 19800 KB Output is correct
43 Correct 46 ms 15552 KB Output is correct
44 Correct 132 ms 19556 KB Output is correct
45 Correct 26 ms 14168 KB Output is correct
46 Correct 142 ms 19576 KB Output is correct
47 Correct 38 ms 14928 KB Output is correct
48 Correct 134 ms 19772 KB Output is correct

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 139 ms 50796 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 12636 KB Output is correct
2 Correct 4 ms 12636 KB Output is correct
3 Correct 3 ms 12636 KB Output is correct
4 Correct 3 ms 12636 KB Output is correct
5 Correct 3 ms 12636 KB Output is correct
6 Correct 4 ms 12892 KB Output is correct
7 Correct 3 ms 12636 KB Output is correct
8 Correct 3 ms 12636 KB Output is correct
9 Correct 3 ms 12752 KB Output is correct
10 Correct 4 ms 12632 KB Output is correct
11 Correct 3 ms 12636 KB Output is correct
12 Correct 3 ms 12788 KB Output is correct
13 Correct 3 ms 12636 KB Output is correct
14 Correct 4 ms 12636 KB Output is correct
15 Correct 3 ms 12636 KB Output is correct
16 Correct 3 ms 12636 KB Output is correct
17 Correct 3 ms 12828 KB Output is correct
18 Correct 3 ms 12636 KB Output is correct
19 Correct 3 ms 12636 KB Output is correct
20 Correct 3 ms 12636 KB Output is correct
21 Correct 3 ms 12768 KB Output is correct
22 Correct 3 ms 12636 KB Output is correct
23 Correct 3 ms 12636 KB Output is correct
24 Correct 4 ms 13040 KB Output is correct
25 Correct 101 ms 18500 KB Output is correct
26 Correct 15 ms 13660 KB Output is correct
27 Correct 140 ms 20708 KB Output is correct
28 Correct 142 ms 20628 KB Output is correct
29 Correct 94 ms 18752 KB Output is correct
30 Correct 96 ms 18384 KB Output is correct
31 Correct 103 ms 19816 KB Output is correct
32 Correct 144 ms 20660 KB Output is correct
33 Correct 119 ms 20564 KB Output is correct
34 Correct 67 ms 16724 KB Output is correct
35 Correct 133 ms 21076 KB Output is correct
36 Correct 132 ms 20560 KB Output is correct
37 Correct 76 ms 17040 KB Output is correct
38 Correct 132 ms 19840 KB Output is correct
39 Correct 22 ms 13916 KB Output is correct
40 Correct 131 ms 19796 KB Output is correct
41 Correct 97 ms 18232 KB Output is correct
42 Correct 141 ms 19800 KB Output is correct
43 Correct 46 ms 15552 KB Output is correct
44 Correct 132 ms 19556 KB Output is correct
45 Correct 26 ms 14168 KB Output is correct
46 Correct 142 ms 19576 KB Output is correct
47 Correct 38 ms 14928 KB Output is correct
48 Correct 134 ms 19772 KB Output is correct
49 Runtime error 139 ms 50796 KB Execution killed with signal 11
50 Halted 0 ms 0 KB -