oj.uz

Submission #708693

# Submission time Handle Problem Language Result Execution time Memory
708693 2023-03-12T07:56:53 Z PixelCat Two Antennas (JOI19_antennas) C++14
100 / 100
 724 ms 63148 KB 
#include <bits/stdc++.h>
#define For(i, a, b) for(int i = a; i <= b; i++)
#define Forr(i, a, b) for(int i = a; i >= b; i--)
#define F first
#define S second
#define sz(x) ((int)x.size())
#define all(x) x.begin(), x.end()
#define eb emplace_back
#define int LL
using namespace std;
using LL = long long;
using pii = pair<int, int>;

const int MAXN = 200020;
const int INF = 1e10;

#define L(id) ((id) * 2 + 1)
#define R(id) ((id) * 2 + 2)
struct SegTree {
    const pii null = pii(INF, 0);
    pii a[MAXN << 2]; // {min, max}
    pii q[MAXN << 2]; // {min, max}
    int ans[MAXN << 2];
    
    pii merge(const pii &p1, const pii &p2) {
        return pii(min(p1.F, p2.F), max(p1.S, p2.S));
    }
    int eval(pii pa, pii pq) {
        int res = -1;
        if(pq.F < INF) {
            if(pa.F < INF) res = max(res, abs(pa.F - pq.F));
            if(pa.S > 0)   res = max(res, abs(pa.S - pq.F));
        }
        if(pq.S > 0) {
            if(pa.F < INF) res = max(res, abs(pa.F - pq.S));
            if(pa.S > 0)   res = max(res, abs(pa.S - pq.S));
        }
        return res;
    }
    
    void pull(int id) {
        a[id] = merge(a[L(id)], a[R(id)]);
        ans[id] = max(ans[L(id)], ans[R(id)]);
    }
    void addq(int id, pii pq) {
        ans[id] = max(ans[id], eval(a[id], pq));
        q[id] = merge(q[id], pq);
    }
    void push(int id) {
        if(q[id] != null) {
            addq(L(id), q[id]);
            addq(R(id), q[id]);
            q[id] = null;
        }
    }
    void init() {
        memset(ans, -1, sizeof(ans));
        For(i, 0, (MAXN << 2) - 1) {
            a[i] = q[i] = null;
        }
    }
    void upd(int id, int l, int r, int i, int x) {
        if(l == r) {
            if(x) a[id] = pii(x, x);
            else a[id] = null;
            return;
        }
        int m = (l + r) / 2;
        push(id);
        if(i <= m) upd(L(id), l, m, i, x);
        else       upd(R(id), m + 1, r, i, x);
        pull(id);
    }
    void updq(int id, int l, int r, int L, int R, int x) {
        if(l > R || r < L) return;
        if(l >= L && r <= R) {
            addq(id, pii(x, x));
            return;
        }
        int m = (l + r) / 2;
        push(id);
        if(L <= m) updq(L(id), l, m, L, R, x);
        if(R > m)  updq(R(id), m + 1, r, L, R, x);
        pull(id);
    }
    int qry(int id, int l, int r, int L, int R) {
        if(l > R || r < L) return -1;
        if(l >= L && r <= R) return ans[id];
        int res = -1;
        int m = (l + r) / 2;
        push(id);
        if(L <= m) res = max(res, qry(L(id), l, m, L, R));
        if(R > m)  res = max(res, qry(R(id), m + 1, r, L, R));
        pull(id);
        return res;
    }
} seg;

int h[MAXN];
int l[MAXN];
int r[MAXN];

vector<pii> vq[MAXN]; // {l, id}
int ans[MAXN];

int32_t main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    // NYA =^-w-^=
    int n; cin >> n;
    vector<pii> ev;
    For(i, 1, n) {
        cin >> h[i] >> l[i] >> r[i];
        ev.eb(i + l[i], i);
        ev.eb(i + r[i] + 1, -i);
    }
    sort(all(ev));
    reverse(all(ev));

    int q; cin >> q;
    For(i, 1, q) {
        int a, b; cin >> a >> b;
        vq[b].eb(a, i);
    }

    seg.init();
    For(i, 1, n) {
        while(sz(ev) && ev.back().F == i) {
            auto x = ev.back().S;
            seg.upd(0, 1, n, abs(x), (x < 0 ? 0 : h[x]));
            ev.pop_back();
        }
        seg.updq(0, 1, n, i - r[i], i - l[i], h[i]);
        for(auto &it:vq[i]) { // {l, id}
            ans[it.S] = seg.qry(0, 1, n, it.F, i);
        }
    }

    For(i, 1, q) cout << ans[i] << "\n";
    return 0;
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 36316 KB Output is correct
2 Correct 18 ms 36308 KB Output is correct
3 Correct 17 ms 36268 KB Output is correct
4 Correct 18 ms 36400 KB Output is correct
5 Correct 18 ms 36352 KB Output is correct
6 Correct 19 ms 36308 KB Output is correct
7 Correct 17 ms 36308 KB Output is correct
8 Correct 22 ms 36372 KB Output is correct
9 Correct 20 ms 36308 KB Output is correct
10 Correct 21 ms 36352 KB Output is correct
11 Correct 19 ms 36288 KB Output is correct
12 Correct 21 ms 36308 KB Output is correct
13 Correct 20 ms 36352 KB Output is correct
14 Correct 18 ms 36308 KB Output is correct
15 Correct 17 ms 36308 KB Output is correct
16 Correct 18 ms 36308 KB Output is correct
17 Correct 18 ms 36312 KB Output is correct
18 Correct 18 ms 36364 KB Output is correct
19 Correct 18 ms 36360 KB Output is correct
20 Correct 19 ms 36300 KB Output is correct
21 Correct 18 ms 36352 KB Output is correct
22 Correct 23 ms 36384 KB Output is correct
23 Correct 20 ms 36412 KB Output is correct
24 Correct 18 ms 36384 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 36316 KB Output is correct
2 Correct 18 ms 36308 KB Output is correct
3 Correct 17 ms 36268 KB Output is correct
4 Correct 18 ms 36400 KB Output is correct
5 Correct 18 ms 36352 KB Output is correct
6 Correct 19 ms 36308 KB Output is correct
7 Correct 17 ms 36308 KB Output is correct
8 Correct 22 ms 36372 KB Output is correct
9 Correct 20 ms 36308 KB Output is correct
10 Correct 21 ms 36352 KB Output is correct
11 Correct 19 ms 36288 KB Output is correct
12 Correct 21 ms 36308 KB Output is correct
13 Correct 20 ms 36352 KB Output is correct
14 Correct 18 ms 36308 KB Output is correct
15 Correct 17 ms 36308 KB Output is correct
16 Correct 18 ms 36308 KB Output is correct
17 Correct 18 ms 36312 KB Output is correct
18 Correct 18 ms 36364 KB Output is correct
19 Correct 18 ms 36360 KB Output is correct
20 Correct 19 ms 36300 KB Output is correct
21 Correct 18 ms 36352 KB Output is correct
22 Correct 23 ms 36384 KB Output is correct
23 Correct 20 ms 36412 KB Output is correct
24 Correct 18 ms 36384 KB Output is correct
25 Correct 84 ms 43320 KB Output is correct
26 Correct 34 ms 37224 KB Output is correct
27 Correct 146 ms 46412 KB Output is correct
28 Correct 126 ms 46424 KB Output is correct
29 Correct 81 ms 43460 KB Output is correct
30 Correct 101 ms 43104 KB Output is correct
31 Correct 104 ms 45180 KB Output is correct
32 Correct 127 ms 46472 KB Output is correct
33 Correct 109 ms 45740 KB Output is correct
34 Correct 72 ms 41232 KB Output is correct
35 Correct 147 ms 46220 KB Output is correct
36 Correct 119 ms 46516 KB Output is correct
37 Correct 85 ms 41676 KB Output is correct
38 Correct 120 ms 45448 KB Output is correct
39 Correct 32 ms 37708 KB Output is correct
40 Correct 109 ms 45520 KB Output is correct
41 Correct 139 ms 43104 KB Output is correct
42 Correct 113 ms 45516 KB Output is correct
43 Correct 54 ms 39452 KB Output is correct
44 Correct 129 ms 45504 KB Output is correct
45 Correct 36 ms 37972 KB Output is correct
46 Correct 114 ms 45572 KB Output is correct
47 Correct 46 ms 38732 KB Output is correct
48 Correct 120 ms 45552 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 386 ms 46280 KB Output is correct
2 Correct 369 ms 47336 KB Output is correct
3 Correct 284 ms 44112 KB Output is correct
4 Correct 375 ms 47372 KB Output is correct
5 Correct 166 ms 41436 KB Output is correct
6 Correct 408 ms 47316 KB Output is correct
7 Correct 314 ms 45880 KB Output is correct
8 Correct 361 ms 47356 KB Output is correct
9 Correct 64 ms 38144 KB Output is correct
10 Correct 372 ms 47388 KB Output is correct
11 Correct 239 ms 43232 KB Output is correct
12 Correct 413 ms 47384 KB Output is correct
13 Correct 206 ms 47328 KB Output is correct
14 Correct 190 ms 47356 KB Output is correct
15 Correct 169 ms 47328 KB Output is correct
16 Correct 158 ms 47420 KB Output is correct
17 Correct 188 ms 47420 KB Output is correct
18 Correct 174 ms 47432 KB Output is correct
19 Correct 181 ms 47388 KB Output is correct
20 Correct 212 ms 47436 KB Output is correct
21 Correct 173 ms 47372 KB Output is correct
22 Correct 175 ms 47304 KB Output is correct
23 Correct 185 ms 47348 KB Output is correct
24 Correct 154 ms 47316 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 36316 KB Output is correct
2 Correct 18 ms 36308 KB Output is correct
3 Correct 17 ms 36268 KB Output is correct
4 Correct 18 ms 36400 KB Output is correct
5 Correct 18 ms 36352 KB Output is correct
6 Correct 19 ms 36308 KB Output is correct
7 Correct 17 ms 36308 KB Output is correct
8 Correct 22 ms 36372 KB Output is correct
9 Correct 20 ms 36308 KB Output is correct
10 Correct 21 ms 36352 KB Output is correct
11 Correct 19 ms 36288 KB Output is correct
12 Correct 21 ms 36308 KB Output is correct
13 Correct 20 ms 36352 KB Output is correct
14 Correct 18 ms 36308 KB Output is correct
15 Correct 17 ms 36308 KB Output is correct
16 Correct 18 ms 36308 KB Output is correct
17 Correct 18 ms 36312 KB Output is correct
18 Correct 18 ms 36364 KB Output is correct
19 Correct 18 ms 36360 KB Output is correct
20 Correct 19 ms 36300 KB Output is correct
21 Correct 18 ms 36352 KB Output is correct
22 Correct 23 ms 36384 KB Output is correct
23 Correct 20 ms 36412 KB Output is correct
24 Correct 18 ms 36384 KB Output is correct
25 Correct 84 ms 43320 KB Output is correct
26 Correct 34 ms 37224 KB Output is correct
27 Correct 146 ms 46412 KB Output is correct
28 Correct 126 ms 46424 KB Output is correct
29 Correct 81 ms 43460 KB Output is correct
30 Correct 101 ms 43104 KB Output is correct
31 Correct 104 ms 45180 KB Output is correct
32 Correct 127 ms 46472 KB Output is correct
33 Correct 109 ms 45740 KB Output is correct
34 Correct 72 ms 41232 KB Output is correct
35 Correct 147 ms 46220 KB Output is correct
36 Correct 119 ms 46516 KB Output is correct
37 Correct 85 ms 41676 KB Output is correct
38 Correct 120 ms 45448 KB Output is correct
39 Correct 32 ms 37708 KB Output is correct
40 Correct 109 ms 45520 KB Output is correct
41 Correct 139 ms 43104 KB Output is correct
42 Correct 113 ms 45516 KB Output is correct
43 Correct 54 ms 39452 KB Output is correct
44 Correct 129 ms 45504 KB Output is correct
45 Correct 36 ms 37972 KB Output is correct
46 Correct 114 ms 45572 KB Output is correct
47 Correct 46 ms 38732 KB Output is correct
48 Correct 120 ms 45552 KB Output is correct
49 Correct 386 ms 46280 KB Output is correct
50 Correct 369 ms 47336 KB Output is correct
51 Correct 284 ms 44112 KB Output is correct
52 Correct 375 ms 47372 KB Output is correct
53 Correct 166 ms 41436 KB Output is correct
54 Correct 408 ms 47316 KB Output is correct
55 Correct 314 ms 45880 KB Output is correct
56 Correct 361 ms 47356 KB Output is correct
57 Correct 64 ms 38144 KB Output is correct
58 Correct 372 ms 47388 KB Output is correct
59 Correct 239 ms 43232 KB Output is correct
60 Correct 413 ms 47384 KB Output is correct
61 Correct 206 ms 47328 KB Output is correct
62 Correct 190 ms 47356 KB Output is correct
63 Correct 169 ms 47328 KB Output is correct
64 Correct 158 ms 47420 KB Output is correct
65 Correct 188 ms 47420 KB Output is correct
66 Correct 174 ms 47432 KB Output is correct
67 Correct 181 ms 47388 KB Output is correct
68 Correct 212 ms 47436 KB Output is correct
69 Correct 173 ms 47372 KB Output is correct
70 Correct 175 ms 47304 KB Output is correct
71 Correct 185 ms 47348 KB Output is correct
72 Correct 154 ms 47316 KB Output is correct
73 Correct 541 ms 58700 KB Output is correct
74 Correct 426 ms 52760 KB Output is correct
75 Correct 558 ms 58160 KB Output is correct
76 Correct 664 ms 63148 KB Output is correct
77 Correct 345 ms 51444 KB Output is correct
78 Correct 578 ms 59356 KB Output is correct
79 Correct 636 ms 60892 KB Output is correct
80 Correct 689 ms 63048 KB Output is correct
81 Correct 252 ms 48964 KB Output is correct
82 Correct 552 ms 57328 KB Output is correct
83 Correct 517 ms 56932 KB Output is correct
84 Correct 724 ms 63040 KB Output is correct
85 Correct 361 ms 57596 KB Output is correct
86 Correct 445 ms 61832 KB Output is correct
87 Correct 221 ms 53080 KB Output is correct
88 Correct 404 ms 61780 KB Output is correct
89 Correct 379 ms 59056 KB Output is correct
90 Correct 390 ms 61796 KB Output is correct
91 Correct 290 ms 55064 KB Output is correct
92 Correct 436 ms 61768 KB Output is correct
93 Correct 215 ms 53396 KB Output is correct
94 Correct 413 ms 61776 KB Output is correct
95 Correct 243 ms 54356 KB Output is correct
96 Correct 405 ms 61896 KB Output is correct