oj.uz

Submission #750046

# Submission time Handle Problem Language Result Execution time Memory
750046 2023-05-29T05:34:32 Z keta_tsimakuridze Two Antennas (JOI19_antennas) C++14
100 / 100
 460 ms 31956 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() {
    ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    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:92:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   92 |         for(int j = 0; j < add[i].size(); j++) {
      |                        ~~^~~~~~~~~~~~~~~
antennas.cpp:96:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   96 |         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 5 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 6 ms 9756 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 6 ms 9684 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 6 ms 9684 KB Output is correct
9 Correct 5 ms 9684 KB Output is correct
10 Correct 5 ms 9684 KB Output is correct
11 Correct 5 ms 9684 KB Output is correct
12 Correct 5 ms 9684 KB Output is correct
13 Correct 5 ms 9684 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 5 ms 9684 KB Output is correct
16 Correct 6 ms 9684 KB Output is correct
17 Correct 5 ms 9684 KB Output is correct
18 Correct 5 ms 9708 KB Output is correct
19 Correct 5 ms 9684 KB Output is correct
20 Correct 6 ms 9684 KB Output is correct
21 Correct 5 ms 9684 KB Output is correct
22 Correct 5 ms 9684 KB Output is correct
23 Correct 5 ms 9684 KB Output is correct
24 Correct 5 ms 9684 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 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 6 ms 9756 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 6 ms 9684 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 6 ms 9684 KB Output is correct
9 Correct 5 ms 9684 KB Output is correct
10 Correct 5 ms 9684 KB Output is correct
11 Correct 5 ms 9684 KB Output is correct
12 Correct 5 ms 9684 KB Output is correct
13 Correct 5 ms 9684 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 5 ms 9684 KB Output is correct
16 Correct 6 ms 9684 KB Output is correct
17 Correct 5 ms 9684 KB Output is correct
18 Correct 5 ms 9708 KB Output is correct
19 Correct 5 ms 9684 KB Output is correct
20 Correct 6 ms 9684 KB Output is correct
21 Correct 5 ms 9684 KB Output is correct
22 Correct 5 ms 9684 KB Output is correct
23 Correct 5 ms 9684 KB Output is correct
24 Correct 5 ms 9684 KB Output is correct
25 Correct 61 ms 13412 KB Output is correct
26 Correct 13 ms 10228 KB Output is correct
27 Correct 87 ms 14836 KB Output is correct
28 Correct 90 ms 14836 KB Output is correct
29 Correct 58 ms 13392 KB Output is correct
30 Correct 64 ms 13132 KB Output is correct
31 Correct 69 ms 14136 KB Output is correct
32 Correct 96 ms 14932 KB Output is correct
33 Correct 83 ms 14540 KB Output is correct
34 Correct 49 ms 12156 KB Output is correct
35 Correct 86 ms 14800 KB Output is correct
36 Correct 94 ms 14828 KB Output is correct
37 Correct 53 ms 12184 KB Output is correct
38 Correct 83 ms 13848 KB Output is correct
39 Correct 18 ms 10324 KB Output is correct
40 Correct 85 ms 13816 KB Output is correct
41 Correct 62 ms 12752 KB Output is correct
42 Correct 84 ms 13852 KB Output is correct
43 Correct 32 ms 11084 KB Output is correct
44 Correct 83 ms 13868 KB Output is correct
45 Correct 20 ms 10436 KB Output is correct
46 Correct 82 ms 13896 KB Output is correct
47 Correct 26 ms 10880 KB Output is correct
48 Correct 83 ms 13940 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 217 ms 24904 KB Output is correct
2 Correct 241 ms 25440 KB Output is correct
3 Correct 157 ms 23880 KB Output is correct
4 Correct 242 ms 25364 KB Output is correct
5 Correct 111 ms 17300 KB Output is correct
6 Correct 255 ms 25444 KB Output is correct
7 Correct 206 ms 24636 KB Output is correct
8 Correct 241 ms 25376 KB Output is correct
9 Correct 36 ms 11860 KB Output is correct
10 Correct 272 ms 25500 KB Output is correct
11 Correct 134 ms 18292 KB Output is correct
12 Correct 239 ms 25456 KB Output is correct
13 Correct 151 ms 23328 KB Output is correct
14 Correct 139 ms 23568 KB Output is correct
15 Correct 141 ms 23560 KB Output is correct
16 Correct 132 ms 23920 KB Output is correct
17 Correct 154 ms 23672 KB Output is correct
18 Correct 144 ms 23952 KB Output is correct
19 Correct 148 ms 23328 KB Output is correct
20 Correct 139 ms 23556 KB Output is correct
21 Correct 143 ms 23216 KB Output is correct
22 Correct 141 ms 23712 KB Output is correct
23 Correct 148 ms 23316 KB Output is correct
24 Correct 135 ms 23468 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 5 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 6 ms 9756 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 6 ms 9684 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 6 ms 9684 KB Output is correct
9 Correct 5 ms 9684 KB Output is correct
10 Correct 5 ms 9684 KB Output is correct
11 Correct 5 ms 9684 KB Output is correct
12 Correct 5 ms 9684 KB Output is correct
13 Correct 5 ms 9684 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 5 ms 9684 KB Output is correct
16 Correct 6 ms 9684 KB Output is correct
17 Correct 5 ms 9684 KB Output is correct
18 Correct 5 ms 9708 KB Output is correct
19 Correct 5 ms 9684 KB Output is correct
20 Correct 6 ms 9684 KB Output is correct
21 Correct 5 ms 9684 KB Output is correct
22 Correct 5 ms 9684 KB Output is correct
23 Correct 5 ms 9684 KB Output is correct
24 Correct 5 ms 9684 KB Output is correct
25 Correct 61 ms 13412 KB Output is correct
26 Correct 13 ms 10228 KB Output is correct
27 Correct 87 ms 14836 KB Output is correct
28 Correct 90 ms 14836 KB Output is correct
29 Correct 58 ms 13392 KB Output is correct
30 Correct 64 ms 13132 KB Output is correct
31 Correct 69 ms 14136 KB Output is correct
32 Correct 96 ms 14932 KB Output is correct
33 Correct 83 ms 14540 KB Output is correct
34 Correct 49 ms 12156 KB Output is correct
35 Correct 86 ms 14800 KB Output is correct
36 Correct 94 ms 14828 KB Output is correct
37 Correct 53 ms 12184 KB Output is correct
38 Correct 83 ms 13848 KB Output is correct
39 Correct 18 ms 10324 KB Output is correct
40 Correct 85 ms 13816 KB Output is correct
41 Correct 62 ms 12752 KB Output is correct
42 Correct 84 ms 13852 KB Output is correct
43 Correct 32 ms 11084 KB Output is correct
44 Correct 83 ms 13868 KB Output is correct
45 Correct 20 ms 10436 KB Output is correct
46 Correct 82 ms 13896 KB Output is correct
47 Correct 26 ms 10880 KB Output is correct
48 Correct 83 ms 13940 KB Output is correct
49 Correct 217 ms 24904 KB Output is correct
50 Correct 241 ms 25440 KB Output is correct
51 Correct 157 ms 23880 KB Output is correct
52 Correct 242 ms 25364 KB Output is correct
53 Correct 111 ms 17300 KB Output is correct
54 Correct 255 ms 25444 KB Output is correct
55 Correct 206 ms 24636 KB Output is correct
56 Correct 241 ms 25376 KB Output is correct
57 Correct 36 ms 11860 KB Output is correct
58 Correct 272 ms 25500 KB Output is correct
59 Correct 134 ms 18292 KB Output is correct
60 Correct 239 ms 25456 KB Output is correct
61 Correct 151 ms 23328 KB Output is correct
62 Correct 139 ms 23568 KB Output is correct
63 Correct 141 ms 23560 KB Output is correct
64 Correct 132 ms 23920 KB Output is correct
65 Correct 154 ms 23672 KB Output is correct
66 Correct 144 ms 23952 KB Output is correct
67 Correct 148 ms 23328 KB Output is correct
68 Correct 139 ms 23556 KB Output is correct
69 Correct 143 ms 23216 KB Output is correct
70 Correct 141 ms 23712 KB Output is correct
71 Correct 148 ms 23316 KB Output is correct
72 Correct 135 ms 23468 KB Output is correct
73 Correct 362 ms 29848 KB Output is correct
74 Correct 254 ms 26060 KB Output is correct
75 Correct 329 ms 29928 KB Output is correct
76 Correct 434 ms 31948 KB Output is correct
77 Correct 223 ms 21836 KB Output is correct
78 Correct 393 ms 29988 KB Output is correct
79 Correct 392 ms 31008 KB Output is correct
80 Correct 460 ms 31880 KB Output is correct
81 Correct 157 ms 17036 KB Output is correct
82 Correct 334 ms 28996 KB Output is correct
83 Correct 301 ms 24336 KB Output is correct
84 Correct 430 ms 31956 KB Output is correct
85 Correct 262 ms 26744 KB Output is correct
86 Correct 323 ms 28752 KB Output is correct
87 Correct 180 ms 24416 KB Output is correct
88 Correct 289 ms 29136 KB Output is correct
89 Correct 291 ms 27712 KB Output is correct
90 Correct 298 ms 29296 KB Output is correct
91 Correct 206 ms 25344 KB Output is correct
92 Correct 330 ms 28752 KB Output is correct
93 Correct 161 ms 24492 KB Output is correct
94 Correct 314 ms 28916 KB Output is correct
95 Correct 192 ms 25020 KB Output is correct
96 Correct 294 ms 28744 KB Output is correct