oj.uz

Submission #361827

# Submission time Handle Problem Language Result Execution time Memory
361827 2021-01-31T17:34:19 Z Vanjanja Two Antennas (JOI19_antennas) C++14
100 / 100
 1127 ms 33696 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 2 * 1e5, inf = 1e9 + 7;
int a[N];
pair<int, int> b[N];
vector<pair<int, int>> que[N];
int resenje[N];
int segDP[4 * N], segM[4 * N][2];
pair<int, int> lazy[4 * N];

void build(int u, int l, int r) {
    segDP[u] = -1, lazy[u].second = inf;
    segM[u][0] = -inf, segM[u][1] = inf;
    if (l == r)
        return;
    int mid = l + r >> 1;
    build(u*2+1,l,mid);
    build(u*2+2,mid+1,r);
}

void update1(int u, int x) {
    if (segM[u][0] == -inf)
        return;
    segDP[u] = max(segDP[u], max(abs(x - segM[u][0]), abs(x - segM[u][1])));
    lazy[u].first = max(lazy[u].first, x);
    lazy[u].second = min(lazy[u].second, x);
}

void shift(int u) {
    if (lazy[u].first) {
        update1(u*2+1,lazy[u].first);
        update1(u*2+2,lazy[u].first);
        lazy[u].first = 0;
    }
    if (lazy[u].second != inf) {
        update1(u*2+1,lazy[u].second);
        update1(u*2+2,lazy[u].second);
        lazy[u].second = inf;
    }
}

void update(int u, int l, int r, int L, int R, int x) {
    if (l > R || r < L)
        return;
    if (l >= L && r <= R) {
        update1(u, x);
        return;
    }
    shift(u);
    int mid = l + r >> 1;
    update(u*2+1,l,mid,L,R,x);
    update(u*2+2,mid+1,r,L,R,x);
    segDP[u] = max(segDP[u*2+1],segDP[u*2+2]);
}

void add(int u, int l, int r, int i, bool p) {
    if (l == r) {
        if (p) {
            segM[u][0] = a[i];
            segM[u][1] = a[i];
            return;
        }
        segM[u][0] = -inf;
        segM[u][1] = inf;
        return;
    }
    shift(u);
    int mid = l + r >> 1;
    if (l <= i && i <= mid)
        add(u*2+1, l, mid, i, p);
    else
        add(u*2+2, mid+1, r, i, p);
    segM[u][0] = max(segM[u*2+1][0], segM[u*2+2][0]);
    segM[u][1] = min(segM[u*2+1][1], segM[u*2+2][1]);
}

int out(int u, int l, int r, int L, int R) {
    if (l > R || r < L)
        return -1;
    if (l >= L && r <= R) {
        return segDP[u] == -inf? -1:segDP[u];
    }
    shift(u);
    int mid = l + r >> 1;
    return max(out(u*2+1,l,mid,L,R), out(u*2+2,mid+1,r,L,R));
}

void solve() {
    int n, q;
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> a[i] >> b[i].first >> b[i].second;
    }
    cin >> q;
    for (int i = 0; i < q; i++) {
        int l, r;
        cin >> l >> r;
        que[l - 1].push_back({r - 1, i});
    }
    build(0, 0, n - 1);
    priority_queue<pair<int, int>> d;
    priority_queue<pair<int, int>> l;
    for (int i = n - 1; i >= 0; i--) {
        while (d.size() && d.top().first >= i) {
            add(0, 0, n - 1, d.top().second, 1);
            l.push({d.top().second - b[d.top().second].second, d.top().second});
            d.pop();
        }
        while (l.size() && l.top().first > i) {
            add(0, 0, n - 1, l.top().second, 0);
            l.pop();
        }
        update(0, 0, n - 1, i + b[i].first, min(i + b[i].second, n - 1), a[i]);
        d.push({i - b[i].first, i});
        for (auto j = que[i].begin(); j != que[i].end(); j++) {
            resenje[(*j).second] = out(0, 0, n - 1, i, (*j).first);
        }
    }
    for (int i = 0; i < q; i++)
        cout << resenje[i] << endl;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    solve();
    return 0;
}

Compilation message

antennas.cpp: In function 'void build(int, int, int)':
antennas.cpp:17:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   17 |     int mid = l + r >> 1;
      |               ~~^~~
antennas.cpp: In function 'void update(int, int, int, int, int, int)':
antennas.cpp:51:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   51 |     int mid = l + r >> 1;
      |               ~~^~~
antennas.cpp: In function 'void add(int, int, int, int, bool)':
antennas.cpp:69:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   69 |     int mid = l + r >> 1;
      |               ~~^~~
antennas.cpp: In function 'int out(int, int, int, int, int)':
antennas.cpp:85:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   85 |     int mid = l + r >> 1;
      |               ~~^~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5100 KB Output is correct
2 Correct 5 ms 5100 KB Output is correct
3 Correct 5 ms 5100 KB Output is correct
4 Correct 5 ms 5100 KB Output is correct
5 Correct 4 ms 5100 KB Output is correct
6 Correct 6 ms 5100 KB Output is correct
7 Correct 5 ms 5100 KB Output is correct
8 Correct 5 ms 5100 KB Output is correct
9 Correct 4 ms 5100 KB Output is correct
10 Correct 4 ms 5100 KB Output is correct
11 Correct 5 ms 5100 KB Output is correct
12 Correct 5 ms 5100 KB Output is correct
13 Correct 4 ms 5100 KB Output is correct
14 Correct 5 ms 5100 KB Output is correct
15 Correct 5 ms 5120 KB Output is correct
16 Correct 5 ms 5100 KB Output is correct
17 Correct 4 ms 5100 KB Output is correct
18 Correct 5 ms 5100 KB Output is correct
19 Correct 5 ms 5100 KB Output is correct
20 Correct 5 ms 5100 KB Output is correct
21 Correct 5 ms 5100 KB Output is correct
22 Correct 5 ms 5100 KB Output is correct
23 Correct 4 ms 5100 KB Output is correct
24 Correct 4 ms 5100 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5100 KB Output is correct
2 Correct 5 ms 5100 KB Output is correct
3 Correct 5 ms 5100 KB Output is correct
4 Correct 5 ms 5100 KB Output is correct
5 Correct 4 ms 5100 KB Output is correct
6 Correct 6 ms 5100 KB Output is correct
7 Correct 5 ms 5100 KB Output is correct
8 Correct 5 ms 5100 KB Output is correct
9 Correct 4 ms 5100 KB Output is correct
10 Correct 4 ms 5100 KB Output is correct
11 Correct 5 ms 5100 KB Output is correct
12 Correct 5 ms 5100 KB Output is correct
13 Correct 4 ms 5100 KB Output is correct
14 Correct 5 ms 5100 KB Output is correct
15 Correct 5 ms 5120 KB Output is correct
16 Correct 5 ms 5100 KB Output is correct
17 Correct 4 ms 5100 KB Output is correct
18 Correct 5 ms 5100 KB Output is correct
19 Correct 5 ms 5100 KB Output is correct
20 Correct 5 ms 5100 KB Output is correct
21 Correct 5 ms 5100 KB Output is correct
22 Correct 5 ms 5100 KB Output is correct
23 Correct 4 ms 5100 KB Output is correct
24 Correct 4 ms 5100 KB Output is correct
25 Correct 392 ms 10060 KB Output is correct
26 Correct 50 ms 5868 KB Output is correct
27 Correct 542 ms 12012 KB Output is correct
28 Correct 544 ms 11884 KB Output is correct
29 Correct 394 ms 10348 KB Output is correct
30 Correct 363 ms 9964 KB Output is correct
31 Correct 512 ms 11368 KB Output is correct
32 Correct 538 ms 12012 KB Output is correct
33 Correct 515 ms 11884 KB Output is correct
34 Correct 273 ms 8428 KB Output is correct
35 Correct 533 ms 12652 KB Output is correct
36 Correct 547 ms 11952 KB Output is correct
37 Correct 308 ms 8556 KB Output is correct
38 Correct 528 ms 10988 KB Output is correct
39 Correct 77 ms 6124 KB Output is correct
40 Correct 529 ms 10996 KB Output is correct
41 Correct 397 ms 9836 KB Output is correct
42 Correct 550 ms 10836 KB Output is correct
43 Correct 175 ms 7404 KB Output is correct
44 Correct 533 ms 10860 KB Output is correct
45 Correct 99 ms 6380 KB Output is correct
46 Correct 533 ms 11116 KB Output is correct
47 Correct 135 ms 6764 KB Output is correct
48 Correct 528 ms 10860 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 339 ms 23028 KB Output is correct
2 Correct 408 ms 23924 KB Output is correct
3 Correct 265 ms 21640 KB Output is correct
4 Correct 364 ms 23924 KB Output is correct
5 Correct 141 ms 13936 KB Output is correct
6 Correct 363 ms 24052 KB Output is correct
7 Correct 314 ms 22776 KB Output is correct
8 Correct 364 ms 23924 KB Output is correct
9 Correct 42 ms 7660 KB Output is correct
10 Correct 363 ms 24052 KB Output is correct
11 Correct 218 ms 15496 KB Output is correct
12 Correct 364 ms 24052 KB Output is correct
13 Correct 201 ms 24040 KB Output is correct
14 Correct 194 ms 24040 KB Output is correct
15 Correct 184 ms 23784 KB Output is correct
16 Correct 178 ms 23912 KB Output is correct
17 Correct 210 ms 23912 KB Output is correct
18 Correct 199 ms 23784 KB Output is correct
19 Correct 198 ms 23536 KB Output is correct
20 Correct 202 ms 23656 KB Output is correct
21 Correct 186 ms 23784 KB Output is correct
22 Correct 229 ms 23784 KB Output is correct
23 Correct 196 ms 23656 KB Output is correct
24 Correct 182 ms 23876 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5100 KB Output is correct
2 Correct 5 ms 5100 KB Output is correct
3 Correct 5 ms 5100 KB Output is correct
4 Correct 5 ms 5100 KB Output is correct
5 Correct 4 ms 5100 KB Output is correct
6 Correct 6 ms 5100 KB Output is correct
7 Correct 5 ms 5100 KB Output is correct
8 Correct 5 ms 5100 KB Output is correct
9 Correct 4 ms 5100 KB Output is correct
10 Correct 4 ms 5100 KB Output is correct
11 Correct 5 ms 5100 KB Output is correct
12 Correct 5 ms 5100 KB Output is correct
13 Correct 4 ms 5100 KB Output is correct
14 Correct 5 ms 5100 KB Output is correct
15 Correct 5 ms 5120 KB Output is correct
16 Correct 5 ms 5100 KB Output is correct
17 Correct 4 ms 5100 KB Output is correct
18 Correct 5 ms 5100 KB Output is correct
19 Correct 5 ms 5100 KB Output is correct
20 Correct 5 ms 5100 KB Output is correct
21 Correct 5 ms 5100 KB Output is correct
22 Correct 5 ms 5100 KB Output is correct
23 Correct 4 ms 5100 KB Output is correct
24 Correct 4 ms 5100 KB Output is correct
25 Correct 392 ms 10060 KB Output is correct
26 Correct 50 ms 5868 KB Output is correct
27 Correct 542 ms 12012 KB Output is correct
28 Correct 544 ms 11884 KB Output is correct
29 Correct 394 ms 10348 KB Output is correct
30 Correct 363 ms 9964 KB Output is correct
31 Correct 512 ms 11368 KB Output is correct
32 Correct 538 ms 12012 KB Output is correct
33 Correct 515 ms 11884 KB Output is correct
34 Correct 273 ms 8428 KB Output is correct
35 Correct 533 ms 12652 KB Output is correct
36 Correct 547 ms 11952 KB Output is correct
37 Correct 308 ms 8556 KB Output is correct
38 Correct 528 ms 10988 KB Output is correct
39 Correct 77 ms 6124 KB Output is correct
40 Correct 529 ms 10996 KB Output is correct
41 Correct 397 ms 9836 KB Output is correct
42 Correct 550 ms 10836 KB Output is correct
43 Correct 175 ms 7404 KB Output is correct
44 Correct 533 ms 10860 KB Output is correct
45 Correct 99 ms 6380 KB Output is correct
46 Correct 533 ms 11116 KB Output is correct
47 Correct 135 ms 6764 KB Output is correct
48 Correct 528 ms 10860 KB Output is correct
49 Correct 339 ms 23028 KB Output is correct
50 Correct 408 ms 23924 KB Output is correct
51 Correct 265 ms 21640 KB Output is correct
52 Correct 364 ms 23924 KB Output is correct
53 Correct 141 ms 13936 KB Output is correct
54 Correct 363 ms 24052 KB Output is correct
55 Correct 314 ms 22776 KB Output is correct
56 Correct 364 ms 23924 KB Output is correct
57 Correct 42 ms 7660 KB Output is correct
58 Correct 363 ms 24052 KB Output is correct
59 Correct 218 ms 15496 KB Output is correct
60 Correct 364 ms 24052 KB Output is correct
61 Correct 201 ms 24040 KB Output is correct
62 Correct 194 ms 24040 KB Output is correct
63 Correct 184 ms 23784 KB Output is correct
64 Correct 178 ms 23912 KB Output is correct
65 Correct 210 ms 23912 KB Output is correct
66 Correct 199 ms 23784 KB Output is correct
67 Correct 198 ms 23536 KB Output is correct
68 Correct 202 ms 23656 KB Output is correct
69 Correct 186 ms 23784 KB Output is correct
70 Correct 229 ms 23784 KB Output is correct
71 Correct 196 ms 23656 KB Output is correct
72 Correct 182 ms 23876 KB Output is correct
73 Correct 901 ms 30576 KB Output is correct
74 Correct 435 ms 24996 KB Output is correct
75 Correct 971 ms 30560 KB Output is correct
76 Correct 1091 ms 33560 KB Output is correct
77 Correct 631 ms 20580 KB Output is correct
78 Correct 858 ms 30560 KB Output is correct
79 Correct 1053 ms 32240 KB Output is correct
80 Correct 1102 ms 33696 KB Output is correct
81 Correct 634 ms 15340 KB Output is correct
82 Correct 741 ms 29004 KB Output is correct
83 Correct 928 ms 24508 KB Output is correct
84 Correct 1127 ms 33560 KB Output is correct
85 Correct 594 ms 29104 KB Output is correct
86 Correct 890 ms 32360 KB Output is correct
87 Correct 285 ms 25320 KB Output is correct
88 Correct 848 ms 32376 KB Output is correct
89 Correct 691 ms 30432 KB Output is correct
90 Correct 888 ms 32304 KB Output is correct
91 Correct 422 ms 26632 KB Output is correct
92 Correct 860 ms 32184 KB Output is correct
93 Correct 325 ms 25440 KB Output is correct
94 Correct 855 ms 32104 KB Output is correct
95 Correct 384 ms 26232 KB Output is correct
96 Correct 862 ms 32360 KB Output is correct