Submission #925248

# Submission time Handle Problem Language Result Execution time Memory
925248 2024-02-11T08:08:52 Z 12345678 Two Antennas (JOI19_antennas) C++17
100 / 100
450 ms 51028 KB
#include <bits/stdc++.h>

using namespace std;

const int nx=2e5+5, inf=1e9+5;

int n, q, h[nx], a[nx], b[nx], res[nx], l[nx], r[nx];
vector<int> qrs[nx], add[nx], rem[nx];

struct segtree
{
    struct node {
        int mx, mn, ans, lzmx, lzmn;
        node(): mx(-inf), mn(inf), lzmx(-inf), lzmn(inf), ans(-1) {}
    } d[4*nx];
    node merge(node &lhs, node &rhs)
    {
        node tmp;
        tmp.mx=max(lhs.mx, rhs.mx);
        tmp.mn=min(lhs.mn, rhs.mn);
        tmp.ans=max(lhs.ans, rhs.ans);
        return tmp;
    }
    void pushlz(int l, int r, int i)
    {
        if (d[i].lzmx==-inf) return;
        d[i].ans=max({d[i].ans, d[i].mx-d[i].lzmn, d[i].lzmx-d[i].mn});
        if (l!=r) d[2*i].lzmx=max(d[2*i].lzmx, d[i].lzmx), d[2*i].lzmn=min(d[2*i].lzmn, d[i].lzmn);
        if (l!=r) d[2*i+1].lzmx=max(d[2*i+1].lzmx, d[i].lzmx), d[2*i+1].lzmn=min(d[2*i+1].lzmn, d[i].lzmn);
        d[i].lzmx=-inf;
        d[i].lzmn=inf;
    }
    void open(int l, int r, int i, int idx, int t)
    {
        pushlz(l, r, i);
        if (r<idx||idx<l) return;
        if (l==r) return d[i].mx=t?h[idx]:-inf, d[i].mn=t?h[idx]:inf, void();
        int md=(l+r)/2;
        open(l, md, 2*i, idx, t);
        open(md+1, r, 2*i+1, idx, t);
        d[i]=merge(d[2*i], d[2*i+1]);
    }
    void update(int l, int r, int i, int ql, int qr, int vl)
    {
        pushlz(l, r, i);
        if (r<ql||qr<l) return;
        if (ql<=l&&r<=qr) return d[i].lzmx=d[i].lzmn=vl, pushlz(l, r, i), void();
        int md=(l+r)/2;
        update(l, md, 2*i, ql, qr, vl);
        update(md+1, r, 2*i+1, ql, qr, vl);
        d[i]=merge(d[2*i], d[2*i+1]);
    }
    int query(int l, int r, int i, int ql, int qr)
    {
        pushlz(l, r, i);
        if (r<ql||qr<l) return -1;
        if (ql<=l&&r<=qr) return d[i].ans;
        int md=(l+r)/2;
        return max(query(l, md ,2*i, ql, qr), query(md+1, r, 2*i+1, ql, qr));
    }
    void show(int l, int r, int i)
    {
        pushlz(l, r, i);
        cout<<l<<' '<<r<<' '<<i<<'\n';
        cout<<"mx"<<' '<<d[i].mx<<'\n';
        cout<<"mn"<<' '<<d[i].mn<<'\n';
        cout<<"ans"<<' '<<d[i].ans<<'\n';
        if (l!=r) show(l, (l+r)/2, 2*i), show((l+r)/2+1, r, 2*i+1);
    }
} s;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n;
    for (int i=1; i<=n; i++)
    {
        cin>>h[i]>>a[i]>>b[i];
        if (i+a[i]<=n) add[i+a[i]].push_back(i);
        if (i+b[i]<=n) rem[i+b[i]].push_back(i);
    }
    cin>>q;
    for (int i=1; i<=q; i++)
    {
        cin>>l[i]>>r[i];
        qrs[r[i]].push_back(i);
    }
    for (int i=1; i<=n; i++)
    {
        for (auto x:add[i]) s.open(1, n, 1, x, 1);
        if (i-a[i]>=1) s.update(1, n, 1, max(1, i-b[i]), i-a[i], h[i]);
        for (auto x:qrs[i]) res[x]=s.query(1, n, 1, l[x], r[x]);
        for (auto x:rem[i]) s.open(1, n, 1, x, 0);
        //s.show(1, n, 1);
    }
    for (int i=1; i<=q; i++) cout<<res[i]<<'\n';
}

Compilation message

antennas.cpp: In constructor 'segtree::node::node()':
antennas.cpp:13:32: warning: 'segtree::node::lzmn' will be initialized after [-Wreorder]
   13 |         int mx, mn, ans, lzmx, lzmn;
      |                                ^~~~
antennas.cpp:13:21: warning:   'int segtree::node::ans' [-Wreorder]
   13 |         int mx, mn, ans, lzmx, lzmn;
      |                     ^~~
antennas.cpp:14:9: warning:   when initialized here [-Wreorder]
   14 |         node(): mx(-inf), mn(inf), lzmx(-inf), lzmn(inf), ans(-1) {}
      |         ^~~~
# Verdict Execution time Memory Grader output
1 Correct 9 ms 33368 KB Output is correct
2 Correct 7 ms 33372 KB Output is correct
3 Correct 8 ms 33368 KB Output is correct
4 Correct 7 ms 33372 KB Output is correct
5 Correct 7 ms 33372 KB Output is correct
6 Correct 7 ms 33420 KB Output is correct
7 Correct 7 ms 33368 KB Output is correct
8 Correct 8 ms 33400 KB Output is correct
9 Correct 9 ms 33628 KB Output is correct
10 Correct 8 ms 33372 KB Output is correct
11 Correct 7 ms 33372 KB Output is correct
12 Correct 8 ms 33372 KB Output is correct
13 Correct 7 ms 33372 KB Output is correct
14 Correct 8 ms 33460 KB Output is correct
15 Correct 7 ms 33372 KB Output is correct
16 Correct 8 ms 33424 KB Output is correct
17 Correct 8 ms 33368 KB Output is correct
18 Correct 7 ms 33368 KB Output is correct
19 Correct 8 ms 33372 KB Output is correct
20 Correct 8 ms 33456 KB Output is correct
21 Correct 8 ms 33528 KB Output is correct
22 Correct 7 ms 33368 KB Output is correct
23 Correct 7 ms 33372 KB Output is correct
24 Correct 7 ms 33372 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 9 ms 33368 KB Output is correct
2 Correct 7 ms 33372 KB Output is correct
3 Correct 8 ms 33368 KB Output is correct
4 Correct 7 ms 33372 KB Output is correct
5 Correct 7 ms 33372 KB Output is correct
6 Correct 7 ms 33420 KB Output is correct
7 Correct 7 ms 33368 KB Output is correct
8 Correct 8 ms 33400 KB Output is correct
9 Correct 9 ms 33628 KB Output is correct
10 Correct 8 ms 33372 KB Output is correct
11 Correct 7 ms 33372 KB Output is correct
12 Correct 8 ms 33372 KB Output is correct
13 Correct 7 ms 33372 KB Output is correct
14 Correct 8 ms 33460 KB Output is correct
15 Correct 7 ms 33372 KB Output is correct
16 Correct 8 ms 33424 KB Output is correct
17 Correct 8 ms 33368 KB Output is correct
18 Correct 7 ms 33368 KB Output is correct
19 Correct 8 ms 33372 KB Output is correct
20 Correct 8 ms 33456 KB Output is correct
21 Correct 8 ms 33528 KB Output is correct
22 Correct 7 ms 33368 KB Output is correct
23 Correct 7 ms 33372 KB Output is correct
24 Correct 7 ms 33372 KB Output is correct
25 Correct 62 ms 36556 KB Output is correct
26 Correct 14 ms 33884 KB Output is correct
27 Correct 100 ms 38100 KB Output is correct
28 Correct 80 ms 38228 KB Output is correct
29 Correct 67 ms 36688 KB Output is correct
30 Correct 54 ms 36720 KB Output is correct
31 Correct 70 ms 37536 KB Output is correct
32 Correct 76 ms 38280 KB Output is correct
33 Correct 69 ms 37716 KB Output is correct
34 Correct 44 ms 35772 KB Output is correct
35 Correct 86 ms 38168 KB Output is correct
36 Correct 83 ms 38264 KB Output is correct
37 Correct 46 ms 35548 KB Output is correct
38 Correct 75 ms 37348 KB Output is correct
39 Correct 17 ms 33880 KB Output is correct
40 Correct 88 ms 37204 KB Output is correct
41 Correct 56 ms 36176 KB Output is correct
42 Correct 74 ms 37208 KB Output is correct
43 Correct 43 ms 34676 KB Output is correct
44 Correct 76 ms 37248 KB Output is correct
45 Correct 22 ms 34136 KB Output is correct
46 Correct 82 ms 37236 KB Output is correct
47 Correct 26 ms 34384 KB Output is correct
48 Correct 87 ms 37364 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 208 ms 41772 KB Output is correct
2 Correct 239 ms 42832 KB Output is correct
3 Correct 164 ms 40036 KB Output is correct
4 Correct 238 ms 42964 KB Output is correct
5 Correct 100 ms 37460 KB Output is correct
6 Correct 241 ms 42836 KB Output is correct
7 Correct 212 ms 41668 KB Output is correct
8 Correct 228 ms 43216 KB Output is correct
9 Correct 38 ms 34648 KB Output is correct
10 Correct 239 ms 42880 KB Output is correct
11 Correct 137 ms 39252 KB Output is correct
12 Correct 238 ms 42816 KB Output is correct
13 Correct 135 ms 40232 KB Output is correct
14 Correct 130 ms 40424 KB Output is correct
15 Correct 127 ms 40660 KB Output is correct
16 Correct 116 ms 41044 KB Output is correct
17 Correct 136 ms 40448 KB Output is correct
18 Correct 126 ms 41064 KB Output is correct
19 Correct 149 ms 40268 KB Output is correct
20 Correct 134 ms 40416 KB Output is correct
21 Correct 134 ms 40248 KB Output is correct
22 Correct 136 ms 40640 KB Output is correct
23 Correct 130 ms 40380 KB Output is correct
24 Correct 113 ms 40652 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 9 ms 33368 KB Output is correct
2 Correct 7 ms 33372 KB Output is correct
3 Correct 8 ms 33368 KB Output is correct
4 Correct 7 ms 33372 KB Output is correct
5 Correct 7 ms 33372 KB Output is correct
6 Correct 7 ms 33420 KB Output is correct
7 Correct 7 ms 33368 KB Output is correct
8 Correct 8 ms 33400 KB Output is correct
9 Correct 9 ms 33628 KB Output is correct
10 Correct 8 ms 33372 KB Output is correct
11 Correct 7 ms 33372 KB Output is correct
12 Correct 8 ms 33372 KB Output is correct
13 Correct 7 ms 33372 KB Output is correct
14 Correct 8 ms 33460 KB Output is correct
15 Correct 7 ms 33372 KB Output is correct
16 Correct 8 ms 33424 KB Output is correct
17 Correct 8 ms 33368 KB Output is correct
18 Correct 7 ms 33368 KB Output is correct
19 Correct 8 ms 33372 KB Output is correct
20 Correct 8 ms 33456 KB Output is correct
21 Correct 8 ms 33528 KB Output is correct
22 Correct 7 ms 33368 KB Output is correct
23 Correct 7 ms 33372 KB Output is correct
24 Correct 7 ms 33372 KB Output is correct
25 Correct 62 ms 36556 KB Output is correct
26 Correct 14 ms 33884 KB Output is correct
27 Correct 100 ms 38100 KB Output is correct
28 Correct 80 ms 38228 KB Output is correct
29 Correct 67 ms 36688 KB Output is correct
30 Correct 54 ms 36720 KB Output is correct
31 Correct 70 ms 37536 KB Output is correct
32 Correct 76 ms 38280 KB Output is correct
33 Correct 69 ms 37716 KB Output is correct
34 Correct 44 ms 35772 KB Output is correct
35 Correct 86 ms 38168 KB Output is correct
36 Correct 83 ms 38264 KB Output is correct
37 Correct 46 ms 35548 KB Output is correct
38 Correct 75 ms 37348 KB Output is correct
39 Correct 17 ms 33880 KB Output is correct
40 Correct 88 ms 37204 KB Output is correct
41 Correct 56 ms 36176 KB Output is correct
42 Correct 74 ms 37208 KB Output is correct
43 Correct 43 ms 34676 KB Output is correct
44 Correct 76 ms 37248 KB Output is correct
45 Correct 22 ms 34136 KB Output is correct
46 Correct 82 ms 37236 KB Output is correct
47 Correct 26 ms 34384 KB Output is correct
48 Correct 87 ms 37364 KB Output is correct
49 Correct 208 ms 41772 KB Output is correct
50 Correct 239 ms 42832 KB Output is correct
51 Correct 164 ms 40036 KB Output is correct
52 Correct 238 ms 42964 KB Output is correct
53 Correct 100 ms 37460 KB Output is correct
54 Correct 241 ms 42836 KB Output is correct
55 Correct 212 ms 41668 KB Output is correct
56 Correct 228 ms 43216 KB Output is correct
57 Correct 38 ms 34648 KB Output is correct
58 Correct 239 ms 42880 KB Output is correct
59 Correct 137 ms 39252 KB Output is correct
60 Correct 238 ms 42816 KB Output is correct
61 Correct 135 ms 40232 KB Output is correct
62 Correct 130 ms 40424 KB Output is correct
63 Correct 127 ms 40660 KB Output is correct
64 Correct 116 ms 41044 KB Output is correct
65 Correct 136 ms 40448 KB Output is correct
66 Correct 126 ms 41064 KB Output is correct
67 Correct 149 ms 40268 KB Output is correct
68 Correct 134 ms 40416 KB Output is correct
69 Correct 134 ms 40248 KB Output is correct
70 Correct 136 ms 40640 KB Output is correct
71 Correct 130 ms 40380 KB Output is correct
72 Correct 113 ms 40652 KB Output is correct
73 Correct 367 ms 47752 KB Output is correct
74 Correct 263 ms 43608 KB Output is correct
75 Correct 296 ms 47188 KB Output is correct
76 Correct 396 ms 51028 KB Output is correct
77 Correct 209 ms 42588 KB Output is correct
78 Correct 377 ms 48464 KB Output is correct
79 Correct 408 ms 49172 KB Output is correct
80 Correct 412 ms 50600 KB Output is correct
81 Correct 172 ms 40452 KB Output is correct
82 Correct 323 ms 47008 KB Output is correct
83 Correct 274 ms 46124 KB Output is correct
84 Correct 450 ms 50596 KB Output is correct
85 Correct 210 ms 44528 KB Output is correct
86 Correct 294 ms 47080 KB Output is correct
87 Correct 148 ms 41808 KB Output is correct
88 Correct 247 ms 47696 KB Output is correct
89 Correct 246 ms 45944 KB Output is correct
90 Correct 263 ms 47576 KB Output is correct
91 Correct 190 ms 43000 KB Output is correct
92 Correct 268 ms 46884 KB Output is correct
93 Correct 155 ms 41688 KB Output is correct
94 Correct 271 ms 47316 KB Output is correct
95 Correct 169 ms 42400 KB Output is correct
96 Correct 261 ms 47216 KB Output is correct