oj.uz

Submission #266439

# Submission time Handle Problem Language Result Execution time Memory
266439 2020-08-15T09:37:22 Z dolphingarlic Two Antennas (JOI19_antennas) C++14
35 / 100
 3000 ms 38964 KB 
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

const int oo = 1e9;

int n, a[200001], b[200001], h[200001], mx[200001], ans[200001];
vector<int> ins[400001], rem[400001];
int segtree[800001];
vector<pair<int, int>> Q[200001];

void build(int node = 1, int l = 1, int r = n) {
    segtree[node] = -oo;
    if (l != r) {
        int mid = (l + r) / 2;
        build(node * 2, l, mid);
        build(node * 2 + 1, mid + 1, r);
    }
}

void update(int pos, int val, int node = 1, int l = 1, int r = n) {
    if (l == r) segtree[node] = val;
    else {
        int mid = (l + r) / 2;
        if (pos > mid) update(pos, val, node * 2 + 1, mid + 1, r);
        else update(pos, val, node * 2, l, mid);
        segtree[node] = max(segtree[node * 2], segtree[node * 2 + 1]);
    }
}

int query(int x, int y, int node = 1, int l = 1, int r = n) {
    if (l > y || r < x) return -oo;
    if (l >= x && r <= y) return segtree[node];
    int mid = (l + r) / 2;
    return max(query(x, y, node * 2, l, mid),
               query(x, y, node * 2 + 1, mid + 1, r));
}

void solve(int l, int r) {
    build();
    for (int i = l; i <= r; i++) {
        for (int j : ins[i]) update(j, h[j]);
        mx[i] = max(mx[i], query(i - b[i], i - a[i]) - h[i]);
        for (int j : rem[i]) update(j, -oo);
    }
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> h[i] >> a[i] >> b[i];
    int q;
    cin >> q;
    for (int i = 1; i <= q; i++) {
        int l, r;
        cin >> l >> r;
        Q[l].push_back({r, i});
    }
    for (int i = n; i; i--) {
        ins[i + a[i]].push_back(i);
        rem[i + b[i]].push_back(i);
        if (Q[i].size()) {
            sort(Q[i].begin(), Q[i].end());
            memset(mx, -1, sizeof mx);
            
            solve(i, n);
            for (int j = i; j <= n; j++) h[j] *= -1;
            solve(i, n);
            for (int j = i; j <= n; j++) h[j] *= -1;

            for (int j = 0; j < Q[i].size(); j++) {
                if (!j) ans[Q[i][j].second] = *max_element(mx + i, mx + Q[i][j].first + 1);
                else ans[Q[i][j].second] = max(ans[Q[i][j - 1].second], *max_element(mx + Q[i][j - 1].first, mx + Q[i][j].first + 1));
            }
        }
    }
    for (int i = 1; i <= q; i++) cout << ans[i] << '\n';
    return 0;
}

Compilation message

antennas.cpp: In function 'int main()':
antennas.cpp:72:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |             for (int j = 0; j < Q[i].size(); j++) {
      |                             ~~^~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 24576 KB Output is correct
2 Correct 25 ms 24704 KB Output is correct
3 Correct 25 ms 24704 KB Output is correct
4 Correct 30 ms 24824 KB Output is correct
5 Correct 22 ms 24704 KB Output is correct
6 Correct 24 ms 24696 KB Output is correct
7 Correct 27 ms 24704 KB Output is correct
8 Correct 30 ms 24704 KB Output is correct
9 Correct 21 ms 24736 KB Output is correct
10 Correct 28 ms 24704 KB Output is correct
11 Correct 20 ms 24704 KB Output is correct
12 Correct 32 ms 24704 KB Output is correct
13 Correct 26 ms 24704 KB Output is correct
14 Correct 26 ms 24704 KB Output is correct
15 Correct 23 ms 24704 KB Output is correct
16 Correct 29 ms 24696 KB Output is correct
17 Correct 26 ms 24704 KB Output is correct
18 Correct 26 ms 24704 KB Output is correct
19 Correct 20 ms 24704 KB Output is correct
20 Correct 26 ms 24668 KB Output is correct
21 Correct 30 ms 24696 KB Output is correct
22 Correct 25 ms 24704 KB Output is correct
23 Correct 25 ms 24608 KB Output is correct
24 Correct 29 ms 24704 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 24576 KB Output is correct
2 Correct 25 ms 24704 KB Output is correct
3 Correct 25 ms 24704 KB Output is correct
4 Correct 30 ms 24824 KB Output is correct
5 Correct 22 ms 24704 KB Output is correct
6 Correct 24 ms 24696 KB Output is correct
7 Correct 27 ms 24704 KB Output is correct
8 Correct 30 ms 24704 KB Output is correct
9 Correct 21 ms 24736 KB Output is correct
10 Correct 28 ms 24704 KB Output is correct
11 Correct 20 ms 24704 KB Output is correct
12 Correct 32 ms 24704 KB Output is correct
13 Correct 26 ms 24704 KB Output is correct
14 Correct 26 ms 24704 KB Output is correct
15 Correct 23 ms 24704 KB Output is correct
16 Correct 29 ms 24696 KB Output is correct
17 Correct 26 ms 24704 KB Output is correct
18 Correct 26 ms 24704 KB Output is correct
19 Correct 20 ms 24704 KB Output is correct
20 Correct 26 ms 24668 KB Output is correct
21 Correct 30 ms 24696 KB Output is correct
22 Correct 25 ms 24704 KB Output is correct
23 Correct 25 ms 24608 KB Output is correct
24 Correct 29 ms 24704 KB Output is correct
25 Correct 210 ms 29532 KB Output is correct
26 Correct 814 ms 25464 KB Output is correct
27 Correct 618 ms 31480 KB Output is correct
28 Correct 896 ms 31352 KB Output is correct
29 Correct 234 ms 29688 KB Output is correct
30 Correct 883 ms 29564 KB Output is correct
31 Correct 102 ms 30712 KB Output is correct
32 Correct 912 ms 31352 KB Output is correct
33 Correct 364 ms 31352 KB Output is correct
34 Correct 866 ms 27928 KB Output is correct
35 Correct 494 ms 31864 KB Output is correct
36 Correct 891 ms 31284 KB Output is correct
37 Correct 584 ms 28056 KB Output is correct
38 Correct 534 ms 30316 KB Output is correct
39 Correct 694 ms 25592 KB Output is correct
40 Correct 713 ms 30328 KB Output is correct
41 Correct 811 ms 29256 KB Output is correct
42 Correct 769 ms 30328 KB Output is correct
43 Correct 720 ms 26712 KB Output is correct
44 Correct 808 ms 30328 KB Output is correct
45 Correct 522 ms 25848 KB Output is correct
46 Correct 760 ms 30456 KB Output is correct
47 Correct 724 ms 26184 KB Output is correct
48 Correct 733 ms 30320 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 401 ms 36988 KB Output is correct
2 Correct 437 ms 38120 KB Output is correct
3 Correct 252 ms 34768 KB Output is correct
4 Correct 365 ms 38120 KB Output is correct
5 Correct 171 ms 30952 KB Output is correct
6 Correct 415 ms 38012 KB Output is correct
7 Correct 426 ms 36600 KB Output is correct
8 Correct 508 ms 38008 KB Output is correct
9 Correct 56 ms 26684 KB Output is correct
10 Correct 351 ms 38008 KB Output is correct
11 Correct 256 ms 32888 KB Output is correct
12 Correct 385 ms 38052 KB Output is correct
13 Correct 251 ms 34672 KB Output is correct
14 Correct 262 ms 34036 KB Output is correct
15 Correct 254 ms 34812 KB Output is correct
16 Correct 194 ms 35448 KB Output is correct
17 Correct 235 ms 34464 KB Output is correct
18 Correct 238 ms 34296 KB Output is correct
19 Correct 219 ms 34288 KB Output is correct
20 Correct 230 ms 34548 KB Output is correct
21 Correct 248 ms 34340 KB Output is correct
22 Correct 236 ms 34796 KB Output is correct
23 Correct 231 ms 34424 KB Output is correct
24 Correct 227 ms 35060 KB Output is correct

Subtask #4
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 24576 KB Output is correct
2 Correct 25 ms 24704 KB Output is correct
3 Correct 25 ms 24704 KB Output is correct
4 Correct 30 ms 24824 KB Output is correct
5 Correct 22 ms 24704 KB Output is correct
6 Correct 24 ms 24696 KB Output is correct
7 Correct 27 ms 24704 KB Output is correct
8 Correct 30 ms 24704 KB Output is correct
9 Correct 21 ms 24736 KB Output is correct
10 Correct 28 ms 24704 KB Output is correct
11 Correct 20 ms 24704 KB Output is correct
12 Correct 32 ms 24704 KB Output is correct
13 Correct 26 ms 24704 KB Output is correct
14 Correct 26 ms 24704 KB Output is correct
15 Correct 23 ms 24704 KB Output is correct
16 Correct 29 ms 24696 KB Output is correct
17 Correct 26 ms 24704 KB Output is correct
18 Correct 26 ms 24704 KB Output is correct
19 Correct 20 ms 24704 KB Output is correct
20 Correct 26 ms 24668 KB Output is correct
21 Correct 30 ms 24696 KB Output is correct
22 Correct 25 ms 24704 KB Output is correct
23 Correct 25 ms 24608 KB Output is correct
24 Correct 29 ms 24704 KB Output is correct
25 Correct 210 ms 29532 KB Output is correct
26 Correct 814 ms 25464 KB Output is correct
27 Correct 618 ms 31480 KB Output is correct
28 Correct 896 ms 31352 KB Output is correct
29 Correct 234 ms 29688 KB Output is correct
30 Correct 883 ms 29564 KB Output is correct
31 Correct 102 ms 30712 KB Output is correct
32 Correct 912 ms 31352 KB Output is correct
33 Correct 364 ms 31352 KB Output is correct
34 Correct 866 ms 27928 KB Output is correct
35 Correct 494 ms 31864 KB Output is correct
36 Correct 891 ms 31284 KB Output is correct
37 Correct 584 ms 28056 KB Output is correct
38 Correct 534 ms 30316 KB Output is correct
39 Correct 694 ms 25592 KB Output is correct
40 Correct 713 ms 30328 KB Output is correct
41 Correct 811 ms 29256 KB Output is correct
42 Correct 769 ms 30328 KB Output is correct
43 Correct 720 ms 26712 KB Output is correct
44 Correct 808 ms 30328 KB Output is correct
45 Correct 522 ms 25848 KB Output is correct
46 Correct 760 ms 30456 KB Output is correct
47 Correct 724 ms 26184 KB Output is correct
48 Correct 733 ms 30320 KB Output is correct
49 Correct 401 ms 36988 KB Output is correct
50 Correct 437 ms 38120 KB Output is correct
51 Correct 252 ms 34768 KB Output is correct
52 Correct 365 ms 38120 KB Output is correct
53 Correct 171 ms 30952 KB Output is correct
54 Correct 415 ms 38012 KB Output is correct
55 Correct 426 ms 36600 KB Output is correct
56 Correct 508 ms 38008 KB Output is correct
57 Correct 56 ms 26684 KB Output is correct
58 Correct 351 ms 38008 KB Output is correct
59 Correct 256 ms 32888 KB Output is correct
60 Correct 385 ms 38052 KB Output is correct
61 Correct 251 ms 34672 KB Output is correct
62 Correct 262 ms 34036 KB Output is correct
63 Correct 254 ms 34812 KB Output is correct
64 Correct 194 ms 35448 KB Output is correct
65 Correct 235 ms 34464 KB Output is correct
66 Correct 238 ms 34296 KB Output is correct
67 Correct 219 ms 34288 KB Output is correct
68 Correct 230 ms 34548 KB Output is correct
69 Correct 248 ms 34340 KB Output is correct
70 Correct 236 ms 34796 KB Output is correct
71 Correct 231 ms 34424 KB Output is correct
72 Correct 227 ms 35060 KB Output is correct
73 Execution timed out 3012 ms 38964 KB Time limit exceeded
74 Halted 0 ms 0 KB -