oj.uz

답안 #807691

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
807691 2023-08-04T21:32:22 Z dong_liu Two Antennas (JOI19_antennas) C++17
100 / 100
 510 ms 36920 KB 
#include <bits/stdc++.h>
using namespace std;

#define N 200000
#define N_ (1 << 18) /* N_ = pow2(ceil(log2(N)) */
#define Q 200000
#define INF 0x3f3f3f3f

int st[N_ * 2], mx[N_ * 2], lz[N_ * 2];

void put(int i, int x) {
  lz[i] = max(lz[i], x);
  mx[i] = max(mx[i], lz[i] - st[i]);
}

void pus(int i) {
  if (lz[i] != -INF) {
    put(i << 1 | 0, lz[i]);
    put(i << 1 | 1, lz[i]);
    lz[i] = -INF;
  }
}

void pul(int i) {
  int l = i << 1 | 0, r = i << 1 | 1;

  st[i] = min(st[l], st[r]);
  mx[i] = max(mx[l], mx[r]);
}

void update(int u, int l, int r, int ql, int qr, int x) {
  int m;

  if (qr < l || ql > r) assert(0);
  if (ql <= l && qr >= r) {
    put(u, x);
    return;
  }
  pus(u);
  m = (l + r) >> 1;
  if (ql <= m) update(u << 1 | 0, l, m, ql, qr, x);
  if (m < qr) update(u << 1 | 1, m + 1, r, ql, qr, x);
  pul(u);
}

void update_point(int u, int l, int r, int i, int x) {
  int m;

  if (l == r) {
    st[u] = x;
    lz[u] = -INF;
    return;
  }
  pus(u);
  m = (l + r) >> 1;
  if (i <= m)
    update_point(u << 1 | 0, l, m, i, x);
  else
    update_point(u << 1 | 1, m + 1, r, i, x);
  pul(u);
}

int query(int u, int l, int r, int ql, int qr) {
  int m, x;

  if (qr < l || ql > r) assert(0);
  if (ql <= l && qr >= r) return mx[u];
  pus(u);
  m = (l + r) >> 1, x = -1;
  if (ql <= m) x = max(x, query(u << 1 | 0, l, m, ql, qr));
  if (m < qr) x = max(x, query(u << 1 | 1, m + 1, r, ql, qr));
  return x;
}

vector<array<int, 2>> ev[N + 1], qq[N];
int hh[N], aa[N], bb[N], ans[Q], n, n_;

void solve() {
  memset(st, 0x3f, n_ * 2 * sizeof *st);
  memset(mx, -1, n_ * 2 * sizeof *mx);
  memset(lz, -0x3f, n_ * 2 * sizeof *lz);
  for (int i = 0; i < n; i++) {
    for (auto [j, t] : ev[i]) {
      if (t == +1)
        update_point(1, 0, n - 1, j, hh[j]);
      else
        update_point(1, 0, n - 1, j, INF);
    }
    if (i - aa[i] >= 0)
      update(1, 0, n - 1, max(0, i - bb[i]), i - aa[i], hh[i]);
    for (auto [j, h] : qq[i]) {
      int x = query(1, 0, n - 1, j, i);

      ans[h] = max(ans[h], x);
    }
  }
}

int main() {
  int q;

  scanf("%d", &n);
  n_ = 1;
  while (n_ < n) n_ <<= 1;
  for (int i = 0; i < n; i++) {
    scanf("%d%d%d", &hh[i], &aa[i], &bb[i]);
    ev[min(n, i + aa[i])].push_back({i, +1});
    ev[min(n, i + bb[i] + 1)].push_back({i, -1});
  }
  scanf("%d", &q);
  memset(ans, -1, q * sizeof *ans);
  for (int h = 0; h < q; h++) {
    int l, r;

    scanf("%d%d", &l, &r), l--, r--;
    qq[r].push_back({l, h});
  }
  solve();
  for (int i = 0; i < n; i++) hh[i] *= -1;
  solve();
  for (int h = 0; h < q; h++) printf("%d\n", ans[h]);
  return 0;
}

Compilation message

antennas.cpp: In function 'int main()':
antennas.cpp:102:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  102 |   scanf("%d", &n);
      |   ~~~~~^~~~~~~~~~
antennas.cpp:106:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  106 |     scanf("%d%d%d", &hh[i], &aa[i], &bb[i]);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
antennas.cpp:110:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  110 |   scanf("%d", &q);
      |   ~~~~~^~~~~~~~~~
antennas.cpp:115:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  115 |     scanf("%d%d", &l, &r), l--, r--;
      |     ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 6 ms 9684 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 5 ms 9716 KB Output is correct
6 Correct 5 ms 9700 KB Output is correct
7 Correct 5 ms 9684 KB Output is correct
8 Correct 6 ms 9800 KB Output is correct
9 Correct 5 ms 9684 KB Output is correct
10 Correct 5 ms 9788 KB Output is correct
11 Correct 4 ms 9684 KB Output is correct
12 Correct 5 ms 9720 KB Output is correct
13 Correct 4 ms 9684 KB Output is correct
14 Correct 5 ms 9708 KB Output is correct
15 Correct 5 ms 9684 KB Output is correct
16 Correct 5 ms 9684 KB Output is correct
17 Correct 5 ms 9684 KB Output is correct
18 Correct 5 ms 9644 KB Output is correct
19 Correct 5 ms 9712 KB Output is correct
20 Correct 5 ms 9684 KB Output is correct
21 Correct 5 ms 9684 KB Output is correct
22 Correct 6 ms 9712 KB Output is correct
23 Correct 4 ms 9684 KB Output is correct
24 Correct 5 ms 9716 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 6 ms 9684 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 5 ms 9716 KB Output is correct
6 Correct 5 ms 9700 KB Output is correct
7 Correct 5 ms 9684 KB Output is correct
8 Correct 6 ms 9800 KB Output is correct
9 Correct 5 ms 9684 KB Output is correct
10 Correct 5 ms 9788 KB Output is correct
11 Correct 4 ms 9684 KB Output is correct
12 Correct 5 ms 9720 KB Output is correct
13 Correct 4 ms 9684 KB Output is correct
14 Correct 5 ms 9708 KB Output is correct
15 Correct 5 ms 9684 KB Output is correct
16 Correct 5 ms 9684 KB Output is correct
17 Correct 5 ms 9684 KB Output is correct
18 Correct 5 ms 9644 KB Output is correct
19 Correct 5 ms 9712 KB Output is correct
20 Correct 5 ms 9684 KB Output is correct
21 Correct 5 ms 9684 KB Output is correct
22 Correct 6 ms 9712 KB Output is correct
23 Correct 4 ms 9684 KB Output is correct
24 Correct 5 ms 9716 KB Output is correct
25 Correct 77 ms 14516 KB Output is correct
26 Correct 14 ms 10324 KB Output is correct
27 Correct 107 ms 16588 KB Output is correct
28 Correct 110 ms 16656 KB Output is correct
29 Correct 73 ms 14532 KB Output is correct
30 Correct 79 ms 14372 KB Output is correct
31 Correct 81 ms 15632 KB Output is correct
32 Correct 108 ms 16704 KB Output is correct
33 Correct 99 ms 16204 KB Output is correct
34 Correct 61 ms 13084 KB Output is correct
35 Correct 106 ms 16496 KB Output is correct
36 Correct 109 ms 16660 KB Output is correct
37 Correct 64 ms 13244 KB Output is correct
38 Correct 109 ms 15732 KB Output is correct
39 Correct 20 ms 10608 KB Output is correct
40 Correct 106 ms 15736 KB Output is correct
41 Correct 78 ms 14028 KB Output is correct
42 Correct 105 ms 15736 KB Output is correct
43 Correct 40 ms 11724 KB Output is correct
44 Correct 111 ms 15672 KB Output is correct
45 Correct 24 ms 10828 KB Output is correct
46 Correct 103 ms 15692 KB Output is correct
47 Correct 33 ms 11300 KB Output is correct
48 Correct 106 ms 15692 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 220 ms 26656 KB Output is correct
2 Correct 233 ms 27832 KB Output is correct
3 Correct 160 ms 24148 KB Output is correct
4 Correct 243 ms 27856 KB Output is correct
5 Correct 98 ms 18232 KB Output is correct
6 Correct 235 ms 27836 KB Output is correct
7 Correct 203 ms 26308 KB Output is correct
8 Correct 229 ms 27760 KB Output is correct
9 Correct 33 ms 12360 KB Output is correct
10 Correct 230 ms 27784 KB Output is correct
11 Correct 144 ms 20360 KB Output is correct
12 Correct 228 ms 27860 KB Output is correct
13 Correct 165 ms 26400 KB Output is correct
14 Correct 149 ms 26248 KB Output is correct
15 Correct 148 ms 26188 KB Output is correct
16 Correct 132 ms 26596 KB Output is correct
17 Correct 164 ms 26552 KB Output is correct
18 Correct 148 ms 26560 KB Output is correct
19 Correct 157 ms 26084 KB Output is correct
20 Correct 153 ms 26232 KB Output is correct
21 Correct 141 ms 25856 KB Output is correct
22 Correct 149 ms 26120 KB Output is correct
23 Correct 151 ms 26408 KB Output is correct
24 Correct 131 ms 26228 KB Output is correct

Subtask #4
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 6 ms 9684 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 5 ms 9716 KB Output is correct
6 Correct 5 ms 9700 KB Output is correct
7 Correct 5 ms 9684 KB Output is correct
8 Correct 6 ms 9800 KB Output is correct
9 Correct 5 ms 9684 KB Output is correct
10 Correct 5 ms 9788 KB Output is correct
11 Correct 4 ms 9684 KB Output is correct
12 Correct 5 ms 9720 KB Output is correct
13 Correct 4 ms 9684 KB Output is correct
14 Correct 5 ms 9708 KB Output is correct
15 Correct 5 ms 9684 KB Output is correct
16 Correct 5 ms 9684 KB Output is correct
17 Correct 5 ms 9684 KB Output is correct
18 Correct 5 ms 9644 KB Output is correct
19 Correct 5 ms 9712 KB Output is correct
20 Correct 5 ms 9684 KB Output is correct
21 Correct 5 ms 9684 KB Output is correct
22 Correct 6 ms 9712 KB Output is correct
23 Correct 4 ms 9684 KB Output is correct
24 Correct 5 ms 9716 KB Output is correct
25 Correct 77 ms 14516 KB Output is correct
26 Correct 14 ms 10324 KB Output is correct
27 Correct 107 ms 16588 KB Output is correct
28 Correct 110 ms 16656 KB Output is correct
29 Correct 73 ms 14532 KB Output is correct
30 Correct 79 ms 14372 KB Output is correct
31 Correct 81 ms 15632 KB Output is correct
32 Correct 108 ms 16704 KB Output is correct
33 Correct 99 ms 16204 KB Output is correct
34 Correct 61 ms 13084 KB Output is correct
35 Correct 106 ms 16496 KB Output is correct
36 Correct 109 ms 16660 KB Output is correct
37 Correct 64 ms 13244 KB Output is correct
38 Correct 109 ms 15732 KB Output is correct
39 Correct 20 ms 10608 KB Output is correct
40 Correct 106 ms 15736 KB Output is correct
41 Correct 78 ms 14028 KB Output is correct
42 Correct 105 ms 15736 KB Output is correct
43 Correct 40 ms 11724 KB Output is correct
44 Correct 111 ms 15672 KB Output is correct
45 Correct 24 ms 10828 KB Output is correct
46 Correct 103 ms 15692 KB Output is correct
47 Correct 33 ms 11300 KB Output is correct
48 Correct 106 ms 15692 KB Output is correct
49 Correct 220 ms 26656 KB Output is correct
50 Correct 233 ms 27832 KB Output is correct
51 Correct 160 ms 24148 KB Output is correct
52 Correct 243 ms 27856 KB Output is correct
53 Correct 98 ms 18232 KB Output is correct
54 Correct 235 ms 27836 KB Output is correct
55 Correct 203 ms 26308 KB Output is correct
56 Correct 229 ms 27760 KB Output is correct
57 Correct 33 ms 12360 KB Output is correct
58 Correct 230 ms 27784 KB Output is correct
59 Correct 144 ms 20360 KB Output is correct
60 Correct 228 ms 27860 KB Output is correct
61 Correct 165 ms 26400 KB Output is correct
62 Correct 149 ms 26248 KB Output is correct
63 Correct 148 ms 26188 KB Output is correct
64 Correct 132 ms 26596 KB Output is correct
65 Correct 164 ms 26552 KB Output is correct
66 Correct 148 ms 26560 KB Output is correct
67 Correct 157 ms 26084 KB Output is correct
68 Correct 153 ms 26232 KB Output is correct
69 Correct 141 ms 25856 KB Output is correct
70 Correct 149 ms 26120 KB Output is correct
71 Correct 151 ms 26408 KB Output is correct
72 Correct 131 ms 26228 KB Output is correct
73 Correct 398 ms 33488 KB Output is correct
74 Correct 255 ms 28588 KB Output is correct
75 Correct 359 ms 32812 KB Output is correct
76 Correct 463 ms 36892 KB Output is correct
77 Correct 234 ms 24344 KB Output is correct
78 Correct 389 ms 34108 KB Output is correct
79 Correct 432 ms 35140 KB Output is correct
80 Correct 510 ms 36920 KB Output is correct
81 Correct 188 ms 19720 KB Output is correct
82 Correct 353 ms 32504 KB Output is correct
83 Correct 343 ms 28684 KB Output is correct
84 Correct 461 ms 36888 KB Output is correct
85 Correct 277 ms 30888 KB Output is correct
86 Correct 352 ms 34128 KB Output is correct
87 Correct 186 ms 27444 KB Output is correct
88 Correct 330 ms 34484 KB Output is correct
89 Correct 317 ms 32116 KB Output is correct
90 Correct 348 ms 34444 KB Output is correct
91 Correct 218 ms 28888 KB Output is correct
92 Correct 343 ms 33912 KB Output is correct
93 Correct 180 ms 27580 KB Output is correct
94 Correct 352 ms 34100 KB Output is correct
95 Correct 202 ms 28436 KB Output is correct
96 Correct 325 ms 34068 KB Output is correct