oj.uz

Submission #366223

# Submission time Handle Problem Language Result Execution time Memory
366223 2021-02-13T14:32:49 Z Kazalika Two Antennas (JOI19_antennas) C++14
100 / 100
 1027 ms 42660 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

const int inf = 1e9 + 9;

struct segment_tree {
  int size;
  vector<int> D, C, H;
  segment_tree() {}
  segment_tree(int sz) {
    size = sz;
    D.resize(4 * size, -inf);
    C.resize(4 * size, -inf);
    H.resize(4 * size, -inf);
  }
  void push(int t, int l, int r) {
    D[t] = max(D[t], C[t] + H[t]);
    if (l + 1 != r) {
      H[t * 2 + 1] = max(H[t * 2 + 1], H[t]);
      H[t * 2 + 2] = max(H[t * 2 + 2], H[t]);
    }
    H[t] = -inf;
  }
  void set_C(int t, int l, int r, int id, int vl) {
    push(t, l, r);
    if (l + 1 == r) {
      C[t] = vl;
      D[t] = max(D[t], C[t] + H[t]);
      return;
    }
    int md = r + l >> 1;
    if (md > id)
      set_C(t * 2 + 1, l, md, id, vl);
    else
      set_C(t * 2 + 2, md, r, id, vl);
    D[t] = max({D[t], D[t * 2 + 1], D[t * 2 + 2]});
    C[t] = max(C[t * 2 + 1], C[t * 2 + 2]);
  }
  int get(int t, int l, int r, int x, int y) {
    push(t, l, r);
    if (l >= y || r <= x)
      return -inf;
    if (l >= x && r <= y)
      return D[t];
    int md = r + l >> 1;
    return max(get(t * 2 + 1, l, md, x, y), get(t * 2 + 2, md, r, x, y));
  }
  void set_H(int t, int l, int r, int x, int y, int vl) {
    push(t, l, r);
    if (l >= y || r <= x)
      return;
    if (l >= x && r <= y) {
      H[t] = vl;
      push(t, l, r);
      return;
    }
    int md = r + l >> 1;
    set_H(t * 2 + 1, l, md, x, y, vl);
    set_H(t * 2 + 2, md, r, x, y, vl);
    D[t] = max({D[t], D[t * 2 + 1], D[t * 2 + 2]});
  }

  void set_C(int id, int vl) { set_C(0, 0, size, id, vl); }
  int get(int x, int y) { return get(0, 0, size, x, y + 1); }
  void set_H(int x, int y, int vl) { set_H(0, 0, size, x, y + 1, vl); }
};

const int N = 2e5 + 5;
int n, a[N], b[N], h[N];
int q, l[N], r[N], ans[N];

vector<int> qq[N], add[N], del[N];

void solve() {
  segment_tree sgt(n);
  for (int i = 0; i < n; ++i) {
    for (int id : add[i])
      sgt.set_C(id, -h[id]);
    int L = max(0, i - b[i]);
    int R = i - a[i];
    if (L <= R)
      sgt.set_H(L, R, h[i]);
    for (int id : qq[i])
      ans[id] = max(ans[id], sgt.get(l[id], r[id]));
    for (int id : del[i])
      sgt.set_C(id, -inf);
  }
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cin >> n;
  for (int i = 0; i < n; ++i) {
    cin >> h[i] >> a[i] >> b[i];
    if (i + a[i] < n)
      add[i + a[i]].push_back(i);
    if (i + b[i] < n)
      del[i + b[i]].push_back(i);
  }
  cin >> q;
  for (int i = 0; i < q; ++i) {
    cin >> l[i] >> r[i];
    l[i]--, r[i]--;
    qq[r[i]].push_back(i);
    ans[i] = -1;
  }
  solve();
  for (int i = 0; i < n; ++i)
    h[i] = -h[i];
  solve();
  for (int i = 0; i < q; ++i) {
    if (ans[i] < 0)
      cout << "-1\n";
    else
      cout << ans[i] << '\n';
  }
}

Compilation message

antennas.cpp: In member function 'void segment_tree::set_C(int, int, int, int, int)':
antennas.cpp:33:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   33 |     int md = r + l >> 1;
      |              ~~^~~
antennas.cpp: In member function 'int segment_tree::get(int, int, int, int, int)':
antennas.cpp:47:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   47 |     int md = r + l >> 1;
      |              ~~^~~
antennas.cpp: In member function 'void segment_tree::set_H(int, int, int, int, int, int)':
antennas.cpp:59:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   59 |     int md = r + l >> 1;
      |              ~~^~~

Subtask #1
2.0 / 2.0

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 14572 KB Output is correct
2 Correct 11 ms 14444 KB Output is correct
3 Correct 11 ms 14444 KB Output is correct
4 Correct 11 ms 14444 KB Output is correct
5 Correct 11 ms 14444 KB Output is correct
6 Correct 10 ms 14444 KB Output is correct
7 Correct 11 ms 14444 KB Output is correct
8 Correct 11 ms 14464 KB Output is correct
9 Correct 10 ms 14444 KB Output is correct
10 Correct 11 ms 14444 KB Output is correct
11 Correct 10 ms 14444 KB Output is correct
12 Correct 11 ms 14444 KB Output is correct
13 Correct 12 ms 14444 KB Output is correct
14 Correct 12 ms 14444 KB Output is correct
15 Correct 10 ms 14444 KB Output is correct
16 Correct 10 ms 14444 KB Output is correct
17 Correct 12 ms 14444 KB Output is correct
18 Correct 11 ms 14444 KB Output is correct
19 Correct 11 ms 14444 KB Output is correct
20 Correct 11 ms 14444 KB Output is correct
21 Correct 10 ms 14444 KB Output is correct
22 Correct 11 ms 14444 KB Output is correct
23 Correct 11 ms 14444 KB Output is correct
24 Correct 11 ms 14444 KB Output is correct
25 Correct 192 ms 19564 KB Output is correct
26 Correct 27 ms 15212 KB Output is correct
27 Correct 209 ms 21736 KB Output is correct
28 Correct 210 ms 21868 KB Output is correct
29 Correct 135 ms 19564 KB Output is correct
30 Correct 177 ms 19436 KB Output is correct
31 Correct 151 ms 21100 KB Output is correct
32 Correct 215 ms 21868 KB Output is correct
33 Correct 257 ms 21356 KB Output is correct
34 Correct 103 ms 18208 KB Output is correct
35 Correct 204 ms 21740 KB Output is correct
36 Correct 217 ms 21912 KB Output is correct
37 Correct 117 ms 18156 KB Output is correct
38 Correct 214 ms 20844 KB Output is correct
39 Correct 40 ms 15596 KB Output is correct
40 Correct 208 ms 20972 KB Output is correct
41 Correct 171 ms 19180 KB Output is correct
42 Correct 230 ms 21100 KB Output is correct
43 Correct 71 ms 16748 KB Output is correct
44 Correct 205 ms 20844 KB Output is correct
45 Correct 42 ms 15724 KB Output is correct
46 Correct 204 ms 20972 KB Output is correct
47 Correct 59 ms 16236 KB Output is correct
48 Correct 213 ms 20920 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 430 ms 32360 KB Output is correct
2 Correct 556 ms 34356 KB Output is correct
3 Correct 316 ms 28396 KB Output is correct
4 Correct 506 ms 34540 KB Output is correct
5 Correct 190 ms 23552 KB Output is correct
6 Correct 506 ms 34412 KB Output is correct
7 Correct 401 ms 31652 KB Output is correct
8 Correct 475 ms 34416 KB Output is correct
9 Correct 60 ms 17564 KB Output is correct
10 Correct 515 ms 34472 KB Output is correct
11 Correct 260 ms 26868 KB Output is correct
12 Correct 532 ms 34540 KB Output is correct
13 Correct 390 ms 31808 KB Output is correct
14 Correct 375 ms 31892 KB Output is correct
15 Correct 353 ms 31980 KB Output is correct
16 Correct 288 ms 32492 KB Output is correct
17 Correct 386 ms 32028 KB Output is correct
18 Correct 354 ms 32432 KB Output is correct
19 Correct 377 ms 31860 KB Output is correct
20 Correct 352 ms 32080 KB Output is correct
21 Correct 372 ms 31764 KB Output is correct
22 Correct 387 ms 32116 KB Output is correct
23 Correct 368 ms 31916 KB Output is correct
24 Correct 307 ms 31976 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 14572 KB Output is correct
2 Correct 11 ms 14444 KB Output is correct
3 Correct 11 ms 14444 KB Output is correct
4 Correct 11 ms 14444 KB Output is correct
5 Correct 11 ms 14444 KB Output is correct
6 Correct 10 ms 14444 KB Output is correct
7 Correct 11 ms 14444 KB Output is correct
8 Correct 11 ms 14464 KB Output is correct
9 Correct 10 ms 14444 KB Output is correct
10 Correct 11 ms 14444 KB Output is correct
11 Correct 10 ms 14444 KB Output is correct
12 Correct 11 ms 14444 KB Output is correct
13 Correct 12 ms 14444 KB Output is correct
14 Correct 12 ms 14444 KB Output is correct
15 Correct 10 ms 14444 KB Output is correct
16 Correct 10 ms 14444 KB Output is correct
17 Correct 12 ms 14444 KB Output is correct
18 Correct 11 ms 14444 KB Output is correct
19 Correct 11 ms 14444 KB Output is correct
20 Correct 11 ms 14444 KB Output is correct
21 Correct 10 ms 14444 KB Output is correct
22 Correct 11 ms 14444 KB Output is correct
23 Correct 11 ms 14444 KB Output is correct
24 Correct 11 ms 14444 KB Output is correct
25 Correct 192 ms 19564 KB Output is correct
26 Correct 27 ms 15212 KB Output is correct
27 Correct 209 ms 21736 KB Output is correct
28 Correct 210 ms 21868 KB Output is correct
29 Correct 135 ms 19564 KB Output is correct
30 Correct 177 ms 19436 KB Output is correct
31 Correct 151 ms 21100 KB Output is correct
32 Correct 215 ms 21868 KB Output is correct
33 Correct 257 ms 21356 KB Output is correct
34 Correct 103 ms 18208 KB Output is correct
35 Correct 204 ms 21740 KB Output is correct
36 Correct 217 ms 21912 KB Output is correct
37 Correct 117 ms 18156 KB Output is correct
38 Correct 214 ms 20844 KB Output is correct
39 Correct 40 ms 15596 KB Output is correct
40 Correct 208 ms 20972 KB Output is correct
41 Correct 171 ms 19180 KB Output is correct
42 Correct 230 ms 21100 KB Output is correct
43 Correct 71 ms 16748 KB Output is correct
44 Correct 205 ms 20844 KB Output is correct
45 Correct 42 ms 15724 KB Output is correct
46 Correct 204 ms 20972 KB Output is correct
47 Correct 59 ms 16236 KB Output is correct
48 Correct 213 ms 20920 KB Output is correct
49 Correct 430 ms 32360 KB Output is correct
50 Correct 556 ms 34356 KB Output is correct
51 Correct 316 ms 28396 KB Output is correct
52 Correct 506 ms 34540 KB Output is correct
53 Correct 190 ms 23552 KB Output is correct
54 Correct 506 ms 34412 KB Output is correct
55 Correct 401 ms 31652 KB Output is correct
56 Correct 475 ms 34416 KB Output is correct
57 Correct 60 ms 17564 KB Output is correct
58 Correct 515 ms 34472 KB Output is correct
59 Correct 260 ms 26868 KB Output is correct
60 Correct 532 ms 34540 KB Output is correct
61 Correct 390 ms 31808 KB Output is correct
62 Correct 375 ms 31892 KB Output is correct
63 Correct 353 ms 31980 KB Output is correct
64 Correct 288 ms 32492 KB Output is correct
65 Correct 386 ms 32028 KB Output is correct
66 Correct 354 ms 32432 KB Output is correct
67 Correct 377 ms 31860 KB Output is correct
68 Correct 352 ms 32080 KB Output is correct
69 Correct 372 ms 31764 KB Output is correct
70 Correct 387 ms 32116 KB Output is correct
71 Correct 368 ms 31916 KB Output is correct
72 Correct 307 ms 31976 KB Output is correct
73 Correct 814 ms 38520 KB Output is correct
74 Correct 622 ms 35300 KB Output is correct
75 Correct 786 ms 36092 KB Output is correct
76 Correct 1027 ms 42560 KB Output is correct
77 Correct 512 ms 28928 KB Output is correct
78 Correct 868 ms 40244 KB Output is correct
79 Correct 937 ms 39636 KB Output is correct
80 Correct 1020 ms 42660 KB Output is correct
81 Correct 361 ms 24784 KB Output is correct
82 Correct 765 ms 38724 KB Output is correct
83 Correct 732 ms 34408 KB Output is correct
84 Correct 1016 ms 42612 KB Output is correct
85 Correct 717 ms 37152 KB Output is correct
86 Correct 898 ms 40172 KB Output is correct
87 Correct 451 ms 33388 KB Output is correct
88 Correct 798 ms 40924 KB Output is correct
89 Correct 787 ms 38260 KB Output is correct
90 Correct 856 ms 40556 KB Output is correct
91 Correct 541 ms 34876 KB Output is correct
92 Correct 875 ms 39952 KB Output is correct
93 Correct 466 ms 33760 KB Output is correct
94 Correct 882 ms 40296 KB Output is correct
95 Correct 526 ms 34668 KB Output is correct
96 Correct 808 ms 40168 KB Output is correct