oj.uz

Submission #957310

# Submission time Handle Problem Language Result Execution time Memory
957310 2024-04-03T13:18:43 Z Soumya1 Two Antennas (JOI19_antennas) C++17
100 / 100
 400 ms 50900 KB 
#include <bits/stdc++.h>
using namespace std;
const int mxN = 2e5 + 5;
vector<pair<int, int>> Q[mxN];
vector<int> in[mxN], out[mxN];
pair<int, int> t[4 * mxN];
int f[4 * mxN];
pair<int, int> lazy[4 * mxN];
pair<int, int> merge(pair<int, int> a, pair<int, int> b) {
  return {min(a.first, b.first), max(a.second, b.second)};
}
void apply(int x, pair<int, int> v) {
  f[x] = max({f[x], t[x].second - v.first, v.second - t[x].first});
  lazy[x].first = min(lazy[x].first, v.first);
  lazy[x].second = max(lazy[x].second, v.second);
}
void push(int x, int lx, int rx) {
  if (lx == rx) return;
  apply(x << 1, lazy[x]);
  apply(x << 1 | 1, lazy[x]);
  lazy[x] = {1e9, 0};
}
void update(int x, int lx, int rx, int i, pair<int, int> v) {
  if (lazy[x] != pair<int, int> {1e9, 0}) push(x, lx, rx);
  if (lx == rx) {
    t[x] = v;
    return;
  }
  int mx = (lx + rx) >> 1;
  if (i <= mx) update(x << 1, lx, mx, i, v);
  else update(x << 1 | 1, mx + 1, rx, i, v);
  t[x] = merge(t[x << 1], t[x << 1 | 1]);
}
void update2(int x, int lx, int rx, int l, int r, int v) {
  if (lazy[x] != pair<int, int> {1e9, 0}) push(x, lx, rx);
  if (l > rx || lx > r) return;
  if (l <= lx && r >= rx) {
    apply(x, {v, v});
    return;
  }
  int mx = (lx + rx) >> 1;
  update2(x << 1, lx, mx, l, r, v);
  update2(x << 1 | 1, mx + 1, rx, l, r, v);
  f[x] = max(f[x << 1], f[x << 1 | 1]);
}
int query(int x, int lx, int rx, int l, int r) {
  if (lazy[x] != pair<int, int> {1e9, 0}) push(x, lx, rx);
  if (l > rx || lx > r) return -1;
  if (l <= lx && r >= rx) return f[x];
  int mx = (lx + rx) >> 1;
  return max(query(x << 1, lx, mx, l, r), query(x << 1 | 1, mx + 1, rx, l, r));
}
void testCase() {
  int n;
  cin >> n;
  vector<int> h(n + 1), a(n + 1), b(n + 1);
  for (int i = 1; i <= n; i++) cin >> h[i] >> a[i] >> b[i];
  int q;
  cin >> q;
  for (int i = 0; i < q; i++) {
    int l, r;
    cin >> l >> r;
    Q[r].push_back({l, i});
  }
  for (int i = 1; i <= n; i++) {
    in[min(n + 1, i + a[i])].push_back(i);
    out[min(n + 1, i + b[i] + 1)].push_back(i);
  }
  vector<int> ans(q, -1);
  for (int i = 0; i <= 4 * n; i++) lazy[i] = {1e9, 0}, f[i] = -1;
  for (int i = 1; i <= n; i++) update(1, 1, n, i, {1e9, 0});
  for (int i = 1; i <= n; i++) {
    for (int j : in[i]) {
      update(1, 1, n, j, {h[j], h[j]});
    }
    for (int j : out[i]) {
      update(1, 1, n, j, {1e9, 0});
    }
    if (i - a[i] >= 1) {
      int l = i - b[i], r = i - a[i];
      update2(1, 1, n, l, r, h[i]);
    }
    for (auto [l, j] : Q[i]) {
      ans[j] = query(1, 1, n, l, i);
    }
  }
  for (int i = 0; i < q; i++) cout << ans[i] << "\n";
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  testCase();
  return 0;
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 19544 KB Output is correct
2 Correct 6 ms 19804 KB Output is correct
3 Correct 4 ms 19800 KB Output is correct
4 Correct 5 ms 19804 KB Output is correct
5 Correct 6 ms 19632 KB Output is correct
6 Correct 4 ms 19804 KB Output is correct
7 Correct 5 ms 19804 KB Output is correct
8 Correct 5 ms 19804 KB Output is correct
9 Correct 5 ms 19548 KB Output is correct
10 Correct 4 ms 19628 KB Output is correct
11 Correct 4 ms 19548 KB Output is correct
12 Correct 5 ms 19804 KB Output is correct
13 Correct 5 ms 19804 KB Output is correct
14 Correct 4 ms 19804 KB Output is correct
15 Correct 4 ms 19800 KB Output is correct
16 Correct 4 ms 19772 KB Output is correct
17 Correct 5 ms 19548 KB Output is correct
18 Correct 5 ms 19800 KB Output is correct
19 Correct 5 ms 19548 KB Output is correct
20 Correct 4 ms 19804 KB Output is correct
21 Correct 5 ms 19548 KB Output is correct
22 Correct 5 ms 19728 KB Output is correct
23 Correct 6 ms 19800 KB Output is correct
24 Correct 5 ms 19548 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 19544 KB Output is correct
2 Correct 6 ms 19804 KB Output is correct
3 Correct 4 ms 19800 KB Output is correct
4 Correct 5 ms 19804 KB Output is correct
5 Correct 6 ms 19632 KB Output is correct
6 Correct 4 ms 19804 KB Output is correct
7 Correct 5 ms 19804 KB Output is correct
8 Correct 5 ms 19804 KB Output is correct
9 Correct 5 ms 19548 KB Output is correct
10 Correct 4 ms 19628 KB Output is correct
11 Correct 4 ms 19548 KB Output is correct
12 Correct 5 ms 19804 KB Output is correct
13 Correct 5 ms 19804 KB Output is correct
14 Correct 4 ms 19804 KB Output is correct
15 Correct 4 ms 19800 KB Output is correct
16 Correct 4 ms 19772 KB Output is correct
17 Correct 5 ms 19548 KB Output is correct
18 Correct 5 ms 19800 KB Output is correct
19 Correct 5 ms 19548 KB Output is correct
20 Correct 4 ms 19804 KB Output is correct
21 Correct 5 ms 19548 KB Output is correct
22 Correct 5 ms 19728 KB Output is correct
23 Correct 6 ms 19800 KB Output is correct
24 Correct 5 ms 19548 KB Output is correct
25 Correct 67 ms 24400 KB Output is correct
26 Correct 12 ms 20312 KB Output is correct
27 Correct 78 ms 26452 KB Output is correct
28 Correct 81 ms 26704 KB Output is correct
29 Correct 53 ms 24444 KB Output is correct
30 Correct 55 ms 24300 KB Output is correct
31 Correct 60 ms 25500 KB Output is correct
32 Correct 79 ms 26692 KB Output is correct
33 Correct 70 ms 26192 KB Output is correct
34 Correct 44 ms 23096 KB Output is correct
35 Correct 75 ms 26432 KB Output is correct
36 Correct 80 ms 26708 KB Output is correct
37 Correct 46 ms 23124 KB Output is correct
38 Correct 81 ms 25812 KB Output is correct
39 Correct 19 ms 20540 KB Output is correct
40 Correct 76 ms 25684 KB Output is correct
41 Correct 57 ms 23936 KB Output is correct
42 Correct 75 ms 25936 KB Output is correct
43 Correct 34 ms 21936 KB Output is correct
44 Correct 77 ms 25680 KB Output is correct
45 Correct 18 ms 20828 KB Output is correct
46 Correct 78 ms 25680 KB Output is correct
47 Correct 24 ms 21328 KB Output is correct
48 Correct 82 ms 25780 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 186 ms 40648 KB Output is correct
2 Correct 208 ms 41668 KB Output is correct
3 Correct 148 ms 38284 KB Output is correct
4 Correct 213 ms 41828 KB Output is correct
5 Correct 84 ms 33196 KB Output is correct
6 Correct 221 ms 41672 KB Output is correct
7 Correct 216 ms 39880 KB Output is correct
8 Correct 215 ms 41804 KB Output is correct
9 Correct 29 ms 25788 KB Output is correct
10 Correct 234 ms 41832 KB Output is correct
11 Correct 116 ms 35264 KB Output is correct
12 Correct 243 ms 41824 KB Output is correct
13 Correct 141 ms 38948 KB Output is correct
14 Correct 129 ms 39100 KB Output is correct
15 Correct 128 ms 39120 KB Output is correct
16 Correct 126 ms 39364 KB Output is correct
17 Correct 142 ms 39216 KB Output is correct
18 Correct 131 ms 39364 KB Output is correct
19 Correct 130 ms 39240 KB Output is correct
20 Correct 126 ms 38920 KB Output is correct
21 Correct 124 ms 39216 KB Output is correct
22 Correct 134 ms 39116 KB Output is correct
23 Correct 129 ms 38992 KB Output is correct
24 Correct 125 ms 39372 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 19544 KB Output is correct
2 Correct 6 ms 19804 KB Output is correct
3 Correct 4 ms 19800 KB Output is correct
4 Correct 5 ms 19804 KB Output is correct
5 Correct 6 ms 19632 KB Output is correct
6 Correct 4 ms 19804 KB Output is correct
7 Correct 5 ms 19804 KB Output is correct
8 Correct 5 ms 19804 KB Output is correct
9 Correct 5 ms 19548 KB Output is correct
10 Correct 4 ms 19628 KB Output is correct
11 Correct 4 ms 19548 KB Output is correct
12 Correct 5 ms 19804 KB Output is correct
13 Correct 5 ms 19804 KB Output is correct
14 Correct 4 ms 19804 KB Output is correct
15 Correct 4 ms 19800 KB Output is correct
16 Correct 4 ms 19772 KB Output is correct
17 Correct 5 ms 19548 KB Output is correct
18 Correct 5 ms 19800 KB Output is correct
19 Correct 5 ms 19548 KB Output is correct
20 Correct 4 ms 19804 KB Output is correct
21 Correct 5 ms 19548 KB Output is correct
22 Correct 5 ms 19728 KB Output is correct
23 Correct 6 ms 19800 KB Output is correct
24 Correct 5 ms 19548 KB Output is correct
25 Correct 67 ms 24400 KB Output is correct
26 Correct 12 ms 20312 KB Output is correct
27 Correct 78 ms 26452 KB Output is correct
28 Correct 81 ms 26704 KB Output is correct
29 Correct 53 ms 24444 KB Output is correct
30 Correct 55 ms 24300 KB Output is correct
31 Correct 60 ms 25500 KB Output is correct
32 Correct 79 ms 26692 KB Output is correct
33 Correct 70 ms 26192 KB Output is correct
34 Correct 44 ms 23096 KB Output is correct
35 Correct 75 ms 26432 KB Output is correct
36 Correct 80 ms 26708 KB Output is correct
37 Correct 46 ms 23124 KB Output is correct
38 Correct 81 ms 25812 KB Output is correct
39 Correct 19 ms 20540 KB Output is correct
40 Correct 76 ms 25684 KB Output is correct
41 Correct 57 ms 23936 KB Output is correct
42 Correct 75 ms 25936 KB Output is correct
43 Correct 34 ms 21936 KB Output is correct
44 Correct 77 ms 25680 KB Output is correct
45 Correct 18 ms 20828 KB Output is correct
46 Correct 78 ms 25680 KB Output is correct
47 Correct 24 ms 21328 KB Output is correct
48 Correct 82 ms 25780 KB Output is correct
49 Correct 186 ms 40648 KB Output is correct
50 Correct 208 ms 41668 KB Output is correct
51 Correct 148 ms 38284 KB Output is correct
52 Correct 213 ms 41828 KB Output is correct
53 Correct 84 ms 33196 KB Output is correct
54 Correct 221 ms 41672 KB Output is correct
55 Correct 216 ms 39880 KB Output is correct
56 Correct 215 ms 41804 KB Output is correct
57 Correct 29 ms 25788 KB Output is correct
58 Correct 234 ms 41832 KB Output is correct
59 Correct 116 ms 35264 KB Output is correct
60 Correct 243 ms 41824 KB Output is correct
61 Correct 141 ms 38948 KB Output is correct
62 Correct 129 ms 39100 KB Output is correct
63 Correct 128 ms 39120 KB Output is correct
64 Correct 126 ms 39364 KB Output is correct
65 Correct 142 ms 39216 KB Output is correct
66 Correct 131 ms 39364 KB Output is correct
67 Correct 130 ms 39240 KB Output is correct
68 Correct 126 ms 38920 KB Output is correct
69 Correct 124 ms 39216 KB Output is correct
70 Correct 134 ms 39116 KB Output is correct
71 Correct 129 ms 38992 KB Output is correct
72 Correct 125 ms 39372 KB Output is correct
73 Correct 322 ms 47416 KB Output is correct
74 Correct 218 ms 42432 KB Output is correct
75 Correct 294 ms 46736 KB Output is correct
76 Correct 380 ms 50828 KB Output is correct
77 Correct 190 ms 39604 KB Output is correct
78 Correct 358 ms 48324 KB Output is correct
79 Correct 350 ms 48816 KB Output is correct
80 Correct 400 ms 50752 KB Output is correct
81 Correct 149 ms 33144 KB Output is correct
82 Correct 291 ms 46416 KB Output is correct
83 Correct 290 ms 43724 KB Output is correct
84 Correct 389 ms 50900 KB Output is correct
85 Correct 221 ms 43972 KB Output is correct
86 Correct 258 ms 47144 KB Output is correct
87 Correct 174 ms 40488 KB Output is correct
88 Correct 265 ms 47224 KB Output is correct
89 Correct 274 ms 45196 KB Output is correct
90 Correct 276 ms 47416 KB Output is correct
91 Correct 179 ms 41948 KB Output is correct
92 Correct 275 ms 47264 KB Output is correct
93 Correct 154 ms 40640 KB Output is correct
94 Correct 271 ms 46936 KB Output is correct
95 Correct 173 ms 41284 KB Output is correct
96 Correct 258 ms 47132 KB Output is correct