oj.uz

Submission #111910

# Submission time Handle Problem Language Result Execution time Memory
111910 2019-05-16T17:42:18 Z kuroni Two Antennas (JOI19_antennas) C++17
100 / 100
 1123 ms 50668 KB 
#include <iostream>
#include <cstdio>
#include <vector>
#define fi first
#define se second
using namespace std;

const int N = 200005, Q = 200005, INF = 1E9 + 7;

struct TNode
{
    int cur, per, mi, ma;

    TNode(int _cur = -INF, int _per = -INF, int _mi = INF)
    {
        cur = _cur;
        per = _per;
        mi = _mi;
        ma = -INF;
    }

    TNode operator+(const TNode &oth) const
    {
        return TNode(max(cur, oth.cur), max(per, oth.per), min(mi, oth.mi));
    }
};

struct TSegmentTree
{
#define m (l + r) / 2
#define lc i * 2
#define rc i * 2 + 1

    TNode tr[4 * N];

    void down(int i)
    {
        tr[lc].ma = max(tr[lc].ma, tr[i].ma);
        tr[lc].cur = max(tr[lc].cur, tr[lc].ma - tr[lc].mi);
        tr[rc].ma = max(tr[rc].ma, tr[i].ma);
        tr[rc].cur = max(tr[rc].cur, tr[rc].ma - tr[rc].mi);
        tr[i].ma = -INF;
    }

    void build(int l, int r, int i)
    {
        tr[i] = TNode();
        if (l == r)
            return;
        build(l, m, lc);
        build(m + 1, r, rc);
    }

    void update_range(int l, int r, int i, int L, int R, int v)
    {
        if (l > R || r < L || L > R)
            return;
        if (L <= l && r <= R)
        {
            tr[i].ma = max(tr[i].ma, v);
            tr[i].cur = max(tr[i].cur, v - tr[i].mi);
            return;
        }
        down(i);
        update_range(l, m, lc, L, R, v);
        update_range(m + 1, r, rc, L, R, v);
        tr[i] = tr[lc] + tr[rc];
    }

    void update_child(int l, int r, int i, int u, int v)
    {
        if (l == r)
        {
            tr[i].mi = v;
            if (v == INF)
                tr[i].per = tr[i].cur;
            else
                tr[i].ma = -INF;
            tr[i].cur = tr[i].ma - v;
            return;
        }
        down(i);
        if (u <= m)
            update_child(l, m, lc, u, v);
        else
            update_child(m + 1, r, rc, u, v);
        tr[i] = tr[lc] + tr[rc];
    }

    int query(int l, int r, int i, int L, int R)
    {
        if (l > R || r < L || L > R)
            return -INF;
        if (L <= l && r <= R)
            return max(tr[i].per, tr[i].cur);
        down(i);
        return max(query(l, m, lc, L, R), query(m + 1, r, rc, L, R));
    }

#undef m
#undef lc
#undef rc
} pos, neg;

int n, q, u, v, a[N], l[N], r[N], ans[Q];
vector<int> eve[N];
vector<pair<int, int>> que[N];

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> n;
    pos.build(1, n, 1); neg.build(1, n, 1);
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i] >> u >> v;
        l[i] = max(1, i - v); r[i] = i - u;
        eve[min(i + u, n + 1)].push_back(i); eve[min(i + v + 1, n + 1)].push_back(-i);
    }
    cin >> q;
    for (int i = 1; i <= q; i++)
    {
        cin >> u >> v;
        ans[i] = -INF;
        que[v].push_back({u, i});
    }
    for (int i = 1; i <= n; i++)
    {
        for (int &v : eve[i])
        {
            bool add = v > 0;
            v = (add ? v : -v);
            pos.update_child(1, n, 1, v, add ? a[v] : INF);
            neg.update_child(1, n, 1, v, add ? -a[v] : INF);
        }
        pos.update_range(1, n, 1, l[i], r[i], a[i]);
        neg.update_range(1, n, 1, l[i], r[i], -a[i]);
        for (pair<int, int> &v : que[i])
            ans[v.se] = max(ans[v.se], max(pos.query(1, n, 1, v.fi, i), neg.query(1, n, 1, v.fi, i)));
    }
    for (int i = 1; i <= q; i++)
        cout << (ans[i] < 0 ? -1 : ans[i]) << '\n';
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 34816 KB Output is correct
2 Correct 25 ms 34816 KB Output is correct
3 Correct 25 ms 34808 KB Output is correct
4 Correct 26 ms 34816 KB Output is correct
5 Correct 24 ms 34788 KB Output is correct
6 Correct 30 ms 34808 KB Output is correct
7 Correct 31 ms 34812 KB Output is correct
8 Correct 33 ms 34808 KB Output is correct
9 Correct 29 ms 34944 KB Output is correct
10 Correct 26 ms 34808 KB Output is correct
11 Correct 26 ms 34808 KB Output is correct
12 Correct 33 ms 34808 KB Output is correct
13 Correct 27 ms 34808 KB Output is correct
14 Correct 30 ms 34808 KB Output is correct
15 Correct 30 ms 34808 KB Output is correct
16 Correct 32 ms 34808 KB Output is correct
17 Correct 31 ms 34808 KB Output is correct
18 Correct 30 ms 34808 KB Output is correct
19 Correct 32 ms 34816 KB Output is correct
20 Correct 32 ms 34816 KB Output is correct
21 Correct 31 ms 34892 KB Output is correct
22 Correct 29 ms 34860 KB Output is correct
23 Correct 39 ms 34808 KB Output is correct
24 Correct 33 ms 34764 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 34816 KB Output is correct
2 Correct 25 ms 34816 KB Output is correct
3 Correct 25 ms 34808 KB Output is correct
4 Correct 26 ms 34816 KB Output is correct
5 Correct 24 ms 34788 KB Output is correct
6 Correct 30 ms 34808 KB Output is correct
7 Correct 31 ms 34812 KB Output is correct
8 Correct 33 ms 34808 KB Output is correct
9 Correct 29 ms 34944 KB Output is correct
10 Correct 26 ms 34808 KB Output is correct
11 Correct 26 ms 34808 KB Output is correct
12 Correct 33 ms 34808 KB Output is correct
13 Correct 27 ms 34808 KB Output is correct
14 Correct 30 ms 34808 KB Output is correct
15 Correct 30 ms 34808 KB Output is correct
16 Correct 32 ms 34808 KB Output is correct
17 Correct 31 ms 34808 KB Output is correct
18 Correct 30 ms 34808 KB Output is correct
19 Correct 32 ms 34816 KB Output is correct
20 Correct 32 ms 34816 KB Output is correct
21 Correct 31 ms 34892 KB Output is correct
22 Correct 29 ms 34860 KB Output is correct
23 Correct 39 ms 34808 KB Output is correct
24 Correct 33 ms 34764 KB Output is correct
25 Correct 148 ms 39672 KB Output is correct
26 Correct 46 ms 35448 KB Output is correct
27 Correct 195 ms 41556 KB Output is correct
28 Correct 239 ms 41720 KB Output is correct
29 Correct 147 ms 39628 KB Output is correct
30 Correct 119 ms 39288 KB Output is correct
31 Correct 129 ms 40572 KB Output is correct
32 Correct 168 ms 41600 KB Output is correct
33 Correct 170 ms 41080 KB Output is correct
34 Correct 113 ms 38136 KB Output is correct
35 Correct 197 ms 41460 KB Output is correct
36 Correct 189 ms 41592 KB Output is correct
37 Correct 135 ms 38264 KB Output is correct
38 Correct 225 ms 40708 KB Output is correct
39 Correct 69 ms 35832 KB Output is correct
40 Correct 205 ms 40668 KB Output is correct
41 Correct 153 ms 39088 KB Output is correct
42 Correct 196 ms 40652 KB Output is correct
43 Correct 70 ms 36856 KB Output is correct
44 Correct 197 ms 40644 KB Output is correct
45 Correct 66 ms 35832 KB Output is correct
46 Correct 202 ms 40696 KB Output is correct
47 Correct 73 ms 36344 KB Output is correct
48 Correct 174 ms 40716 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 421 ms 41824 KB Output is correct
2 Correct 490 ms 44156 KB Output is correct
3 Correct 304 ms 42348 KB Output is correct
4 Correct 502 ms 44156 KB Output is correct
5 Correct 246 ms 39668 KB Output is correct
6 Correct 611 ms 44236 KB Output is correct
7 Correct 521 ms 43372 KB Output is correct
8 Correct 440 ms 44140 KB Output is correct
9 Correct 90 ms 36600 KB Output is correct
10 Correct 619 ms 44268 KB Output is correct
11 Correct 363 ms 41584 KB Output is correct
12 Correct 597 ms 44140 KB Output is correct
13 Correct 415 ms 42180 KB Output is correct
14 Correct 277 ms 42220 KB Output is correct
15 Correct 235 ms 42352 KB Output is correct
16 Correct 315 ms 42728 KB Output is correct
17 Correct 264 ms 42448 KB Output is correct
18 Correct 231 ms 42608 KB Output is correct
19 Correct 256 ms 42116 KB Output is correct
20 Correct 240 ms 42280 KB Output is correct
21 Correct 238 ms 42068 KB Output is correct
22 Correct 245 ms 42216 KB Output is correct
23 Correct 262 ms 42224 KB Output is correct
24 Correct 260 ms 42192 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 34816 KB Output is correct
2 Correct 25 ms 34816 KB Output is correct
3 Correct 25 ms 34808 KB Output is correct
4 Correct 26 ms 34816 KB Output is correct
5 Correct 24 ms 34788 KB Output is correct
6 Correct 30 ms 34808 KB Output is correct
7 Correct 31 ms 34812 KB Output is correct
8 Correct 33 ms 34808 KB Output is correct
9 Correct 29 ms 34944 KB Output is correct
10 Correct 26 ms 34808 KB Output is correct
11 Correct 26 ms 34808 KB Output is correct
12 Correct 33 ms 34808 KB Output is correct
13 Correct 27 ms 34808 KB Output is correct
14 Correct 30 ms 34808 KB Output is correct
15 Correct 30 ms 34808 KB Output is correct
16 Correct 32 ms 34808 KB Output is correct
17 Correct 31 ms 34808 KB Output is correct
18 Correct 30 ms 34808 KB Output is correct
19 Correct 32 ms 34816 KB Output is correct
20 Correct 32 ms 34816 KB Output is correct
21 Correct 31 ms 34892 KB Output is correct
22 Correct 29 ms 34860 KB Output is correct
23 Correct 39 ms 34808 KB Output is correct
24 Correct 33 ms 34764 KB Output is correct
25 Correct 148 ms 39672 KB Output is correct
26 Correct 46 ms 35448 KB Output is correct
27 Correct 195 ms 41556 KB Output is correct
28 Correct 239 ms 41720 KB Output is correct
29 Correct 147 ms 39628 KB Output is correct
30 Correct 119 ms 39288 KB Output is correct
31 Correct 129 ms 40572 KB Output is correct
32 Correct 168 ms 41600 KB Output is correct
33 Correct 170 ms 41080 KB Output is correct
34 Correct 113 ms 38136 KB Output is correct
35 Correct 197 ms 41460 KB Output is correct
36 Correct 189 ms 41592 KB Output is correct
37 Correct 135 ms 38264 KB Output is correct
38 Correct 225 ms 40708 KB Output is correct
39 Correct 69 ms 35832 KB Output is correct
40 Correct 205 ms 40668 KB Output is correct
41 Correct 153 ms 39088 KB Output is correct
42 Correct 196 ms 40652 KB Output is correct
43 Correct 70 ms 36856 KB Output is correct
44 Correct 197 ms 40644 KB Output is correct
45 Correct 66 ms 35832 KB Output is correct
46 Correct 202 ms 40696 KB Output is correct
47 Correct 73 ms 36344 KB Output is correct
48 Correct 174 ms 40716 KB Output is correct
49 Correct 421 ms 41824 KB Output is correct
50 Correct 490 ms 44156 KB Output is correct
51 Correct 304 ms 42348 KB Output is correct
52 Correct 502 ms 44156 KB Output is correct
53 Correct 246 ms 39668 KB Output is correct
54 Correct 611 ms 44236 KB Output is correct
55 Correct 521 ms 43372 KB Output is correct
56 Correct 440 ms 44140 KB Output is correct
57 Correct 90 ms 36600 KB Output is correct
58 Correct 619 ms 44268 KB Output is correct
59 Correct 363 ms 41584 KB Output is correct
60 Correct 597 ms 44140 KB Output is correct
61 Correct 415 ms 42180 KB Output is correct
62 Correct 277 ms 42220 KB Output is correct
63 Correct 235 ms 42352 KB Output is correct
64 Correct 315 ms 42728 KB Output is correct
65 Correct 264 ms 42448 KB Output is correct
66 Correct 231 ms 42608 KB Output is correct
67 Correct 256 ms 42116 KB Output is correct
68 Correct 240 ms 42280 KB Output is correct
69 Correct 238 ms 42068 KB Output is correct
70 Correct 245 ms 42216 KB Output is correct
71 Correct 262 ms 42224 KB Output is correct
72 Correct 260 ms 42192 KB Output is correct
73 Correct 887 ms 48524 KB Output is correct
74 Correct 572 ms 44908 KB Output is correct
75 Correct 809 ms 48492 KB Output is correct
76 Correct 909 ms 50668 KB Output is correct
77 Correct 527 ms 45424 KB Output is correct
78 Correct 835 ms 48756 KB Output is correct
79 Correct 753 ms 49804 KB Output is correct
80 Correct 1035 ms 50628 KB Output is correct
81 Correct 336 ms 43896 KB Output is correct
82 Correct 864 ms 47796 KB Output is correct
83 Correct 772 ms 47904 KB Output is correct
84 Correct 1123 ms 50588 KB Output is correct
85 Correct 573 ms 45504 KB Output is correct
86 Correct 735 ms 47472 KB Output is correct
87 Correct 369 ms 43120 KB Output is correct
88 Correct 544 ms 47884 KB Output is correct
89 Correct 752 ms 46372 KB Output is correct
90 Correct 711 ms 47824 KB Output is correct
91 Correct 406 ms 44276 KB Output is correct
92 Correct 684 ms 47360 KB Output is correct
93 Correct 375 ms 43220 KB Output is correct
94 Correct 666 ms 47560 KB Output is correct
95 Correct 448 ms 43944 KB Output is correct
96 Correct 642 ms 47596 KB Output is correct