oj.uz

Submission #750045

# Submission time Handle Problem Language Result Execution time Memory
750045 2023-05-29T05:33:41 Z keta_tsimakuridze Two Antennas (JOI19_antennas) C++14
100 / 100
 764 ms 54336 KB 
#include<iostream>
#include<vector>
#include<set>
#define f first
#define s second
#define int long long
#define pii pair<int,int>
using namespace std;
const int N = 2e5 + 5, inf = 2e9; // !
int h[N];
vector<int> add[N];
vector<pair<int,int>> qry[N];
struct node {
    int mx, mn, ans;
} t[4 * N];
struct lazy {
    int mn, mx;
} lz[4 * N];
node merge(node a, node b) {
    return {max(a.mx, b.mx), min(a.mn, b.mn), max(a.ans, b.ans)};
}
void build(int u, int l, int r) {
    lz[u] = {inf, 0};
    if(l == r) {
        t[u] = { 0, inf, -inf};
        return;
    }
    int mid = (l + r) / 2;
    build(2 * u, l, mid); build(2 * u + 1, mid + 1, r);
    t[u] = merge(t[2 * u], t[2 * u + 1]);
}
void push(int u, int l, int r) {

    t[u].ans = max(t[u].ans, lz[u].mx - t[u].mn);
    t[u].ans = max(t[u].ans, t[u].mx - lz[u].mn);
    if(l != r) {
        for(int t = 0; t <= 1; t++)
            lz[2 * u + t].mx = max(lz[2 * u + t].mx, lz[u].mx),
                    lz[2 * u + t].mn = min(lz[2 * u + t].mn, lz[u].mn);
    }
    lz[u] = {inf, 0};
}
void upd(int u, int id, int l, int r) {
    if(lz[u].mx) push(u, l, r);
    if(l > id || r < id) return;
    if(l == r) {
        if(t[u].mx) t[u].mx = 0, t[u].mn = inf;
        else t[u].mx = h[l], t[u].mn = h[r];
        return;
    }
    int mid = (l + r) / 2;
    upd(2 * u, id, l, mid); upd(2 * u + 1, id, mid + 1, r);
    t[u] = merge(t[2 * u], t[2 * u + 1]);
}
void upd(int u, int st, int en, int l, int r, int val) {
    if(lz[u].mx) push(u, l, r);
    if(l > en || r < st) return;
    if(st <= l && r <= en) {
        lz[u] = {val, val};
        push(u, l, r);
        return;
    }
    int mid = (l + r) / 2;
    upd(2 * u, st, en, l, mid, val);
    upd(2 * u + 1, st, en, mid + 1, r, val);
    t[u] = merge(t[2 * u], t[2 * u + 1]);
}
int get(int u, int st, int en, int l, int r) {
    if(lz[u].mx) push(u, l, r);
    if(l > en || r < st) return -inf;
    if(st <= l && r <= en) return t[u].ans;
    int mid = (l + r) / 2;
    return max(get(2 * u, st, en, l, mid), get(2 * u + 1, st, en, mid + 1, r));
}
signed main() {
    int n;
    cin >> n;
    vector<int> l(n + 2), r(n + 2);
    for(int i = 1; i <= n; i++) {
        cin >> h[i] >> l[i] >> r[i];
        if(i + l[i] <= n) add[i + l[i]].push_back(i), add[min(i + r[i] + 1, n + 1)].push_back(i);
    }
    build(1, 1, n);
    int q; cin >> q;
    for(int i = 1; i <= q; i++) {
        int l, r; cin >> l >> r;
        qry[r].push_back({l, i});
    }
    vector<int> ans(q + 1);
    for(int i = 1; i <= n; i++) {
        for(int j = 0; j < add[i].size(); j++) {
            upd(1, add[i][j], 1, n); 
        }
        upd(1, i - r[i], i - l[i], 1, n, h[i]);
        for(int j = 0; j < qry[i].size(); j++) ans[qry[i][j].s] = get(1, qry[i][j].f, i, 1, n);
    }
    for(int i = 1; i <= q; i++) cout << (ans[i] < 0 ? -1 : ans[i]) << "\n";
}

Compilation message

antennas.cpp: In function 'int main()':
antennas.cpp:91:26: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |         for(int j = 0; j < add[i].size(); j++) {
      |                        ~~^~~~~~~~~~~~~~~
antennas.cpp:95:26: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   95 |         for(int j = 0; j < qry[i].size(); j++) ans[qry[i][j].s] = get(1, qry[i][j].f, i, 1, n);
      |                        ~~^~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9684 KB Output is correct
2 Correct 6 ms 9684 KB Output is correct
3 Correct 6 ms 9684 KB Output is correct
4 Correct 7 ms 9684 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 6 ms 9684 KB Output is correct
7 Correct 7 ms 9684 KB Output is correct
8 Correct 6 ms 9736 KB Output is correct
9 Correct 6 ms 9684 KB Output is correct
10 Correct 7 ms 9716 KB Output is correct
11 Correct 5 ms 9708 KB Output is correct
12 Correct 6 ms 9684 KB Output is correct
13 Correct 6 ms 9708 KB Output is correct
14 Correct 6 ms 9704 KB Output is correct
15 Correct 6 ms 9712 KB Output is correct
16 Correct 6 ms 9684 KB Output is correct
17 Correct 5 ms 9712 KB Output is correct
18 Correct 6 ms 9684 KB Output is correct
19 Correct 6 ms 9700 KB Output is correct
20 Correct 5 ms 9684 KB Output is correct
21 Correct 6 ms 9712 KB Output is correct
22 Correct 6 ms 9712 KB Output is correct
23 Correct 6 ms 9660 KB Output is correct
24 Correct 6 ms 9720 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9684 KB Output is correct
2 Correct 6 ms 9684 KB Output is correct
3 Correct 6 ms 9684 KB Output is correct
4 Correct 7 ms 9684 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 6 ms 9684 KB Output is correct
7 Correct 7 ms 9684 KB Output is correct
8 Correct 6 ms 9736 KB Output is correct
9 Correct 6 ms 9684 KB Output is correct
10 Correct 7 ms 9716 KB Output is correct
11 Correct 5 ms 9708 KB Output is correct
12 Correct 6 ms 9684 KB Output is correct
13 Correct 6 ms 9708 KB Output is correct
14 Correct 6 ms 9704 KB Output is correct
15 Correct 6 ms 9712 KB Output is correct
16 Correct 6 ms 9684 KB Output is correct
17 Correct 5 ms 9712 KB Output is correct
18 Correct 6 ms 9684 KB Output is correct
19 Correct 6 ms 9700 KB Output is correct
20 Correct 5 ms 9684 KB Output is correct
21 Correct 6 ms 9712 KB Output is correct
22 Correct 6 ms 9712 KB Output is correct
23 Correct 6 ms 9660 KB Output is correct
24 Correct 6 ms 9720 KB Output is correct
25 Correct 116 ms 16844 KB Output is correct
26 Correct 21 ms 10736 KB Output is correct
27 Correct 148 ms 19784 KB Output is correct
28 Correct 165 ms 19916 KB Output is correct
29 Correct 108 ms 16912 KB Output is correct
30 Correct 107 ms 16572 KB Output is correct
31 Correct 134 ms 18504 KB Output is correct
32 Correct 152 ms 19872 KB Output is correct
33 Correct 140 ms 19296 KB Output is correct
34 Correct 79 ms 14692 KB Output is correct
35 Correct 145 ms 19736 KB Output is correct
36 Correct 157 ms 20000 KB Output is correct
37 Correct 89 ms 15148 KB Output is correct
38 Correct 147 ms 18932 KB Output is correct
39 Correct 31 ms 11244 KB Output is correct
40 Correct 153 ms 18916 KB Output is correct
41 Correct 109 ms 16568 KB Output is correct
42 Correct 151 ms 19008 KB Output is correct
43 Correct 60 ms 12908 KB Output is correct
44 Correct 153 ms 18924 KB Output is correct
45 Correct 31 ms 11432 KB Output is correct
46 Correct 147 ms 18980 KB Output is correct
47 Correct 49 ms 12268 KB Output is correct
48 Correct 150 ms 19004 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 360 ms 37560 KB Output is correct
2 Correct 415 ms 43064 KB Output is correct
3 Correct 276 ms 39160 KB Output is correct
4 Correct 416 ms 43256 KB Output is correct
5 Correct 169 ms 25672 KB Output is correct
6 Correct 411 ms 43048 KB Output is correct
7 Correct 344 ms 41196 KB Output is correct
8 Correct 409 ms 43004 KB Output is correct
9 Correct 53 ms 14252 KB Output is correct
10 Correct 406 ms 42972 KB Output is correct
11 Correct 246 ms 27904 KB Output is correct
12 Correct 405 ms 43004 KB Output is correct
13 Correct 279 ms 41412 KB Output is correct
14 Correct 267 ms 41340 KB Output is correct
15 Correct 257 ms 41284 KB Output is correct
16 Correct 257 ms 41924 KB Output is correct
17 Correct 267 ms 41488 KB Output is correct
18 Correct 259 ms 41900 KB Output is correct
19 Correct 269 ms 41104 KB Output is correct
20 Correct 257 ms 41564 KB Output is correct
21 Correct 264 ms 41140 KB Output is correct
22 Correct 260 ms 41408 KB Output is correct
23 Correct 259 ms 41324 KB Output is correct
24 Correct 254 ms 41520 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9684 KB Output is correct
2 Correct 6 ms 9684 KB Output is correct
3 Correct 6 ms 9684 KB Output is correct
4 Correct 7 ms 9684 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 6 ms 9684 KB Output is correct
7 Correct 7 ms 9684 KB Output is correct
8 Correct 6 ms 9736 KB Output is correct
9 Correct 6 ms 9684 KB Output is correct
10 Correct 7 ms 9716 KB Output is correct
11 Correct 5 ms 9708 KB Output is correct
12 Correct 6 ms 9684 KB Output is correct
13 Correct 6 ms 9708 KB Output is correct
14 Correct 6 ms 9704 KB Output is correct
15 Correct 6 ms 9712 KB Output is correct
16 Correct 6 ms 9684 KB Output is correct
17 Correct 5 ms 9712 KB Output is correct
18 Correct 6 ms 9684 KB Output is correct
19 Correct 6 ms 9700 KB Output is correct
20 Correct 5 ms 9684 KB Output is correct
21 Correct 6 ms 9712 KB Output is correct
22 Correct 6 ms 9712 KB Output is correct
23 Correct 6 ms 9660 KB Output is correct
24 Correct 6 ms 9720 KB Output is correct
25 Correct 116 ms 16844 KB Output is correct
26 Correct 21 ms 10736 KB Output is correct
27 Correct 148 ms 19784 KB Output is correct
28 Correct 165 ms 19916 KB Output is correct
29 Correct 108 ms 16912 KB Output is correct
30 Correct 107 ms 16572 KB Output is correct
31 Correct 134 ms 18504 KB Output is correct
32 Correct 152 ms 19872 KB Output is correct
33 Correct 140 ms 19296 KB Output is correct
34 Correct 79 ms 14692 KB Output is correct
35 Correct 145 ms 19736 KB Output is correct
36 Correct 157 ms 20000 KB Output is correct
37 Correct 89 ms 15148 KB Output is correct
38 Correct 147 ms 18932 KB Output is correct
39 Correct 31 ms 11244 KB Output is correct
40 Correct 153 ms 18916 KB Output is correct
41 Correct 109 ms 16568 KB Output is correct
42 Correct 151 ms 19008 KB Output is correct
43 Correct 60 ms 12908 KB Output is correct
44 Correct 153 ms 18924 KB Output is correct
45 Correct 31 ms 11432 KB Output is correct
46 Correct 147 ms 18980 KB Output is correct
47 Correct 49 ms 12268 KB Output is correct
48 Correct 150 ms 19004 KB Output is correct
49 Correct 360 ms 37560 KB Output is correct
50 Correct 415 ms 43064 KB Output is correct
51 Correct 276 ms 39160 KB Output is correct
52 Correct 416 ms 43256 KB Output is correct
53 Correct 169 ms 25672 KB Output is correct
54 Correct 411 ms 43048 KB Output is correct
55 Correct 344 ms 41196 KB Output is correct
56 Correct 409 ms 43004 KB Output is correct
57 Correct 53 ms 14252 KB Output is correct
58 Correct 406 ms 42972 KB Output is correct
59 Correct 246 ms 27904 KB Output is correct
60 Correct 405 ms 43004 KB Output is correct
61 Correct 279 ms 41412 KB Output is correct
62 Correct 267 ms 41340 KB Output is correct
63 Correct 257 ms 41284 KB Output is correct
64 Correct 257 ms 41924 KB Output is correct
65 Correct 267 ms 41488 KB Output is correct
66 Correct 259 ms 41900 KB Output is correct
67 Correct 269 ms 41104 KB Output is correct
68 Correct 257 ms 41564 KB Output is correct
69 Correct 264 ms 41140 KB Output is correct
70 Correct 260 ms 41408 KB Output is correct
71 Correct 259 ms 41324 KB Output is correct
72 Correct 254 ms 41520 KB Output is correct
73 Correct 612 ms 50108 KB Output is correct
74 Correct 427 ms 43768 KB Output is correct
75 Correct 582 ms 50348 KB Output is correct
76 Correct 756 ms 54328 KB Output is correct
77 Correct 358 ms 33756 KB Output is correct
78 Correct 595 ms 50628 KB Output is correct
79 Correct 668 ms 52548 KB Output is correct
80 Correct 709 ms 54288 KB Output is correct
81 Correct 252 ms 24416 KB Output is correct
82 Correct 560 ms 48500 KB Output is correct
83 Correct 515 ms 38816 KB Output is correct
84 Correct 764 ms 54336 KB Output is correct
85 Correct 522 ms 47172 KB Output is correct
86 Correct 530 ms 51432 KB Output is correct
87 Correct 293 ms 42888 KB Output is correct
88 Correct 510 ms 52048 KB Output is correct
89 Correct 458 ms 48892 KB Output is correct
90 Correct 522 ms 52132 KB Output is correct
91 Correct 343 ms 44604 KB Output is correct
92 Correct 519 ms 51388 KB Output is correct
93 Correct 299 ms 42936 KB Output is correct
94 Correct 520 ms 51632 KB Output is correct
95 Correct 334 ms 43972 KB Output is correct
96 Correct 595 ms 51476 KB Output is correct