oj.uz

Submission #879420

# Submission time Handle Problem Language Result Execution time Memory
879420 2023-11-27T10:38:12 Z NeroZein Two Antennas (JOI19_antennas) C++17
100 / 100
 509 ms 35692 KB 
#include "bits/stdc++.h"
using namespace std;

#ifdef Nero
#include "Deb.h"
#else
#define deb(...)
#endif

const int N = 2e5 + 5; 
const int INF = 1e9; 

int n;
int a[N], aa[N], bb[N], ans[N]; 
int d[N * 2], c[N * 2], lz[N * 2];
vector<pair<int, int>> ev[N], qs[N]; 

void push(int nd, int l, int r) {
  d[nd] = max(d[nd], lz[nd] - c[nd]); 
  if (l != r) {
    int mid = (l + r) >> 1;
    int rs = nd + ((mid - l + 1) << 1);
    lz[nd + 1] = max(lz[nd + 1], lz[nd]); 
    lz[rs] = max(lz[rs], lz[nd]); 
  }
  lz[nd] = -INF; 
}

void upd(int nd, int l, int r, int s, int e, int v) {
  push(nd, l, r); 
  if (l >= s && r <= e) {
    lz[nd] = max(lz[nd], v); 
    push(nd, l, r); 
    return; 
  }
  int mid = (l + r) >> 1;
  int rs = nd + ((mid - l + 1) << 1);
  if (s <= mid) {
    push(rs, mid + 1, r); 
    upd(nd + 1, l, mid, s, e, v); 
  }
  if (mid < e) {
    push(nd + 1, l, mid);
    upd(rs, mid + 1, r, s, e, v); 
  }
  d[nd] = max(d[nd + 1], d[rs]);  
}

void point_upd(int nd, int l, int r, int p, int v) {
  push(nd, l, r); 
  if (l == r) {
    c[nd] = v; 
    push(nd, l, r); 
    return;
  }
  int mid = (l + r) >> 1;
  int rs = nd + ((mid - l + 1) << 1);
  if (p <= mid) {
    push(rs, mid + 1, r); 
    point_upd(nd + 1, l, mid, p, v); 
  } else {
    push(nd + 1, l, mid); 
    point_upd(rs, mid + 1, r, p, v); 
  }
  d[nd] = max(d[nd + 1], d[rs]); 
  c[nd] = min(c[nd + 1], c[rs]); 
}

int qry(int nd, int l, int r, int s, int e) {
  push(nd, l, r); 
  if (l >= s && r <= e) {
    return d[nd];
  }
  int mid = (l + r) >> 1;
  int rs = nd + ((mid - l + 1) << 1);
  if (mid >= e) {
    return qry(nd + 1, l, mid, s, e); 
  } else {
    if (mid < s) {
      return qry(rs, mid + 1, r, s, e); 
    } else {
      return max(qry(nd + 1, l, mid, s, e), qry(rs, mid + 1, r, s, e)); 
    }
  }
}

void solve() {
  fill(c, c + N * 2, INF);
  fill(d, d + N * 2, -INF);
  fill(lz, lz + N * 2, -INF);
  for (int i = 1; i <= n; ++i) {
    for (auto [j, tp] : ev[i]) {
      if (tp == 1) {
        point_upd(0, 0, n + 1, j, a[j]);
      } else {
        point_upd(0, 0, n + 1, j, INF); 
      }
    }
    if (i - aa[i] > 0) {
      upd(0, 0, n + 1, max(0, i - bb[i]), i - aa[i], a[i]); 
    }
    for (auto [l, j] : qs[i]) {
      ans[j] = max(ans[j], qry(0, 0, n + 1, l, i)); 
    }
  }
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cin >> n;
  for (int i = 1; i <= n; ++i) {
    cin >> a[i] >> aa[i] >> bb[i];
    ev[min(n + 1, i + aa[i])].emplace_back(i, 1);
    ev[min(n + 1, i + bb[i] + 1)].emplace_back(i, -1);
  }
  int q;
  cin >> q;
  for (int i = 1; i <= q; ++i) {
    int l, r;
    cin >> l >> r; 
    qs[r].emplace_back(l, i); 
  }
  fill(ans + 1, ans + 1 + q, -1); 
  solve();
  for (int i = 1; i <= n; ++i) {
    a[i] *= -1; 
  }
  solve(); 
  for (int i = 1; i <= q; ++i) {
    cout << ans[i] << '\n';
  }
  return 0;
}

Subtask #1
2.0 / 2.0

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 16988 KB Output is correct
2 Correct 4 ms 16988 KB Output is correct
3 Correct 4 ms 16988 KB Output is correct
4 Correct 5 ms 17052 KB Output is correct
5 Correct 4 ms 17048 KB Output is correct
6 Correct 4 ms 16988 KB Output is correct
7 Correct 4 ms 16988 KB Output is correct
8 Correct 4 ms 16988 KB Output is correct
9 Correct 5 ms 16988 KB Output is correct
10 Correct 4 ms 16988 KB Output is correct
11 Correct 4 ms 16988 KB Output is correct
12 Correct 4 ms 16988 KB Output is correct
13 Correct 7 ms 16988 KB Output is correct
14 Correct 6 ms 16988 KB Output is correct
15 Correct 4 ms 16984 KB Output is correct
16 Correct 5 ms 16988 KB Output is correct
17 Correct 4 ms 16984 KB Output is correct
18 Correct 4 ms 16988 KB Output is correct
19 Correct 4 ms 16988 KB Output is correct
20 Correct 4 ms 16988 KB Output is correct
21 Correct 5 ms 16988 KB Output is correct
22 Correct 4 ms 16988 KB Output is correct
23 Correct 4 ms 16988 KB Output is correct
24 Correct 4 ms 17048 KB Output is correct
25 Correct 79 ms 21108 KB Output is correct
26 Correct 13 ms 17500 KB Output is correct
27 Correct 109 ms 23084 KB Output is correct
28 Correct 110 ms 23124 KB Output is correct
29 Correct 75 ms 21232 KB Output is correct
30 Correct 84 ms 20980 KB Output is correct
31 Correct 97 ms 22016 KB Output is correct
32 Correct 110 ms 23116 KB Output is correct
33 Correct 106 ms 22708 KB Output is correct
34 Correct 61 ms 19956 KB Output is correct
35 Correct 111 ms 22944 KB Output is correct
36 Correct 115 ms 23124 KB Output is correct
37 Correct 65 ms 19848 KB Output is correct
38 Correct 118 ms 22188 KB Output is correct
39 Correct 21 ms 17752 KB Output is correct
40 Correct 109 ms 22172 KB Output is correct
41 Correct 85 ms 20752 KB Output is correct
42 Correct 110 ms 22096 KB Output is correct
43 Correct 40 ms 18772 KB Output is correct
44 Correct 109 ms 22200 KB Output is correct
45 Correct 26 ms 17864 KB Output is correct
46 Correct 110 ms 22096 KB Output is correct
47 Correct 38 ms 18268 KB Output is correct
48 Correct 128 ms 22220 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 259 ms 26132 KB Output is correct
2 Correct 318 ms 27316 KB Output is correct
3 Correct 199 ms 24000 KB Output is correct
4 Correct 277 ms 27216 KB Output is correct
5 Correct 135 ms 21356 KB Output is correct
6 Correct 287 ms 27100 KB Output is correct
7 Correct 256 ms 25932 KB Output is correct
8 Correct 275 ms 27080 KB Output is correct
9 Correct 39 ms 18388 KB Output is correct
10 Correct 315 ms 27088 KB Output is correct
11 Correct 193 ms 23252 KB Output is correct
12 Correct 269 ms 27076 KB Output is correct
13 Correct 267 ms 25924 KB Output is correct
14 Correct 225 ms 25620 KB Output is correct
15 Correct 231 ms 25576 KB Output is correct
16 Correct 219 ms 25900 KB Output is correct
17 Correct 257 ms 25904 KB Output is correct
18 Correct 227 ms 25912 KB Output is correct
19 Correct 219 ms 25396 KB Output is correct
20 Correct 207 ms 25488 KB Output is correct
21 Correct 220 ms 25204 KB Output is correct
22 Correct 214 ms 25612 KB Output is correct
23 Correct 223 ms 25792 KB Output is correct
24 Correct 204 ms 25504 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 16988 KB Output is correct
2 Correct 4 ms 16988 KB Output is correct
3 Correct 4 ms 16988 KB Output is correct
4 Correct 5 ms 17052 KB Output is correct
5 Correct 4 ms 17048 KB Output is correct
6 Correct 4 ms 16988 KB Output is correct
7 Correct 4 ms 16988 KB Output is correct
8 Correct 4 ms 16988 KB Output is correct
9 Correct 5 ms 16988 KB Output is correct
10 Correct 4 ms 16988 KB Output is correct
11 Correct 4 ms 16988 KB Output is correct
12 Correct 4 ms 16988 KB Output is correct
13 Correct 7 ms 16988 KB Output is correct
14 Correct 6 ms 16988 KB Output is correct
15 Correct 4 ms 16984 KB Output is correct
16 Correct 5 ms 16988 KB Output is correct
17 Correct 4 ms 16984 KB Output is correct
18 Correct 4 ms 16988 KB Output is correct
19 Correct 4 ms 16988 KB Output is correct
20 Correct 4 ms 16988 KB Output is correct
21 Correct 5 ms 16988 KB Output is correct
22 Correct 4 ms 16988 KB Output is correct
23 Correct 4 ms 16988 KB Output is correct
24 Correct 4 ms 17048 KB Output is correct
25 Correct 79 ms 21108 KB Output is correct
26 Correct 13 ms 17500 KB Output is correct
27 Correct 109 ms 23084 KB Output is correct
28 Correct 110 ms 23124 KB Output is correct
29 Correct 75 ms 21232 KB Output is correct
30 Correct 84 ms 20980 KB Output is correct
31 Correct 97 ms 22016 KB Output is correct
32 Correct 110 ms 23116 KB Output is correct
33 Correct 106 ms 22708 KB Output is correct
34 Correct 61 ms 19956 KB Output is correct
35 Correct 111 ms 22944 KB Output is correct
36 Correct 115 ms 23124 KB Output is correct
37 Correct 65 ms 19848 KB Output is correct
38 Correct 118 ms 22188 KB Output is correct
39 Correct 21 ms 17752 KB Output is correct
40 Correct 109 ms 22172 KB Output is correct
41 Correct 85 ms 20752 KB Output is correct
42 Correct 110 ms 22096 KB Output is correct
43 Correct 40 ms 18772 KB Output is correct
44 Correct 109 ms 22200 KB Output is correct
45 Correct 26 ms 17864 KB Output is correct
46 Correct 110 ms 22096 KB Output is correct
47 Correct 38 ms 18268 KB Output is correct
48 Correct 128 ms 22220 KB Output is correct
49 Correct 259 ms 26132 KB Output is correct
50 Correct 318 ms 27316 KB Output is correct
51 Correct 199 ms 24000 KB Output is correct
52 Correct 277 ms 27216 KB Output is correct
53 Correct 135 ms 21356 KB Output is correct
54 Correct 287 ms 27100 KB Output is correct
55 Correct 256 ms 25932 KB Output is correct
56 Correct 275 ms 27080 KB Output is correct
57 Correct 39 ms 18388 KB Output is correct
58 Correct 315 ms 27088 KB Output is correct
59 Correct 193 ms 23252 KB Output is correct
60 Correct 269 ms 27076 KB Output is correct
61 Correct 267 ms 25924 KB Output is correct
62 Correct 225 ms 25620 KB Output is correct
63 Correct 231 ms 25576 KB Output is correct
64 Correct 219 ms 25900 KB Output is correct
65 Correct 257 ms 25904 KB Output is correct
66 Correct 227 ms 25912 KB Output is correct
67 Correct 219 ms 25396 KB Output is correct
68 Correct 207 ms 25488 KB Output is correct
69 Correct 220 ms 25204 KB Output is correct
70 Correct 214 ms 25612 KB Output is correct
71 Correct 223 ms 25792 KB Output is correct
72 Correct 204 ms 25504 KB Output is correct
73 Correct 426 ms 32520 KB Output is correct
74 Correct 350 ms 27936 KB Output is correct
75 Correct 370 ms 31932 KB Output is correct
76 Correct 509 ms 35516 KB Output is correct
77 Correct 250 ms 27216 KB Output is correct
78 Correct 462 ms 33080 KB Output is correct
79 Correct 427 ms 34056 KB Output is correct
80 Correct 490 ms 35628 KB Output is correct
81 Correct 183 ms 25036 KB Output is correct
82 Correct 358 ms 31424 KB Output is correct
83 Correct 405 ms 30908 KB Output is correct
84 Correct 474 ms 35692 KB Output is correct
85 Correct 345 ms 29780 KB Output is correct
86 Correct 435 ms 32816 KB Output is correct
87 Correct 240 ms 26664 KB Output is correct
88 Correct 426 ms 33424 KB Output is correct
89 Correct 406 ms 31008 KB Output is correct
90 Correct 421 ms 33188 KB Output is correct
91 Correct 296 ms 28040 KB Output is correct
92 Correct 426 ms 32616 KB Output is correct
93 Correct 235 ms 26928 KB Output is correct
94 Correct 440 ms 32788 KB Output is correct
95 Correct 275 ms 27784 KB Output is correct
96 Correct 411 ms 32736 KB Output is correct