oj.uz

Submission #718069

# Submission time Handle Problem Language Result Execution time Memory
718069 2023-04-03T09:37:30 Z Johann Two Antennas (JOI19_antennas) C++14
100 / 100
 817 ms 35380 KB 
#include <bits/stdc++.h>

using namespace std;

const int inf = 1e9 + 1;

struct sdata {
  int minhl = inf, maxhl = -inf, maxcost = -1;
};

struct operation {
  int minhr = inf, maxhr = -inf;
};

sdata combine(sdata dl, sdata dr) {
  return { min(dl.minhl, dr.minhl), max(dl.maxhl, dr.maxhl), max(dl.maxcost, dr.maxcost) };
}

sdata calculate(operation o, sdata d) {
  return { d.minhl, d.maxhl, max(d.maxcost, max(o.maxhr - d.minhl, d.maxhl - o.minhr)) };
}

operation merge(operation ot, operation ob) {
  return { min(ot.minhr, ob.minhr), max(ot.maxhr, ob.maxhr) };
}

const int sn = 1 << 18;
sdata s[2 * sn];
operation o[sn];

void apply(int x, operation op) {
  s[x] = calculate(op, s[x]);
  if (x < sn)
    o[x] = merge(op, o[x]);
}

void push(int x) {
  apply(x << 1, o[x]);
  apply(x << 1 | 1, o[x]);
  o[x] = operation();
}

sdata query(int a, int b, int l = 0, int r = sn, int x = 1) {
  if (b <= l || r <= a)
    return sdata();
  if (a <= l && r <= b)
    return s[x];
  push(x);
  return combine(query(a, b, l, (l + r) / 2, x << 1), query(a, b, (l + r) / 2, r, x << 1 | 1));
}

void apply(int a, int b, operation op, int l = 0, int r = sn, int x = 1) {
  if (b <= l || r <= a)
    return;
  if (a <= l && r <= b)
    return apply(x, op);
  push(x);
  apply(a, b, op, l, (l + r) / 2, x << 1);
  apply(a, b, op, (l + r) / 2, r, x << 1 | 1);
  s[x] = combine(s[x << 1], s[x << 1 | 1]);
}

void update(int x, int minhl, int maxhl) {
  apply(x, x + 1, operation());
  x += sn;
  s[x].minhl = minhl;
  s[x].maxhl = maxhl;
  while (x >>= 1)
    s[x] = combine(s[x << 1], s[x << 1 | 1]);
}

int n, q, h[200100], a[200100], b[200100], l[200100], r[200100], res[200100];
vector<int> actl[200100], deactl[200100], qur[200100];

int main() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> h[i] >> a[i] >> b[i];
    actl[min(i + a[i], n)].push_back(i);
    deactl[min(i + b[i] + 1, n)].push_back(i);
  }
  cin >> q;
  for (int i = 0; i < q; i++) {
    cin >> l[i] >> r[i], l[i]--, r[i]--;
    qur[r[i]].push_back(i);
  }
  for (int i = 0; i < n; i++) {
    for (int j : actl[i])
      update(j, h[j], h[j]);
    for (int j : deactl[i])
      update(j, inf, -inf);
    apply(max(0, i - b[i]), max(0, i - a[i] + 1), { h[i], h[i] });
    for (int j : qur[i])
      res[j] = query(l[j], i).maxcost;
  }
  for (int i = 0; i < q; i++)
    cout << res[i] << "\n";
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14420 KB Output is correct
2 Correct 8 ms 14532 KB Output is correct
3 Correct 8 ms 14548 KB Output is correct
4 Correct 10 ms 14544 KB Output is correct
5 Correct 8 ms 14548 KB Output is correct
6 Correct 11 ms 14508 KB Output is correct
7 Correct 12 ms 14548 KB Output is correct
8 Correct 9 ms 14540 KB Output is correct
9 Correct 8 ms 14548 KB Output is correct
10 Correct 8 ms 14548 KB Output is correct
11 Correct 8 ms 14544 KB Output is correct
12 Correct 10 ms 14548 KB Output is correct
13 Correct 9 ms 14548 KB Output is correct
14 Correct 8 ms 14544 KB Output is correct
15 Correct 9 ms 14548 KB Output is correct
16 Correct 9 ms 14548 KB Output is correct
17 Correct 10 ms 14548 KB Output is correct
18 Correct 9 ms 14532 KB Output is correct
19 Correct 9 ms 14548 KB Output is correct
20 Correct 8 ms 14548 KB Output is correct
21 Correct 8 ms 14548 KB Output is correct
22 Correct 8 ms 14544 KB Output is correct
23 Correct 8 ms 14548 KB Output is correct
24 Correct 10 ms 14460 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14420 KB Output is correct
2 Correct 8 ms 14532 KB Output is correct
3 Correct 8 ms 14548 KB Output is correct
4 Correct 10 ms 14544 KB Output is correct
5 Correct 8 ms 14548 KB Output is correct
6 Correct 11 ms 14508 KB Output is correct
7 Correct 12 ms 14548 KB Output is correct
8 Correct 9 ms 14540 KB Output is correct
9 Correct 8 ms 14548 KB Output is correct
10 Correct 8 ms 14548 KB Output is correct
11 Correct 8 ms 14544 KB Output is correct
12 Correct 10 ms 14548 KB Output is correct
13 Correct 9 ms 14548 KB Output is correct
14 Correct 8 ms 14544 KB Output is correct
15 Correct 9 ms 14548 KB Output is correct
16 Correct 9 ms 14548 KB Output is correct
17 Correct 10 ms 14548 KB Output is correct
18 Correct 9 ms 14532 KB Output is correct
19 Correct 9 ms 14548 KB Output is correct
20 Correct 8 ms 14548 KB Output is correct
21 Correct 8 ms 14548 KB Output is correct
22 Correct 8 ms 14544 KB Output is correct
23 Correct 8 ms 14548 KB Output is correct
24 Correct 10 ms 14460 KB Output is correct
25 Correct 216 ms 18648 KB Output is correct
26 Correct 29 ms 15188 KB Output is correct
27 Correct 247 ms 20084 KB Output is correct
28 Correct 272 ms 20144 KB Output is correct
29 Correct 178 ms 18736 KB Output is correct
30 Correct 189 ms 18420 KB Output is correct
31 Correct 211 ms 19784 KB Output is correct
32 Correct 252 ms 20172 KB Output is correct
33 Correct 237 ms 19876 KB Output is correct
34 Correct 133 ms 17368 KB Output is correct
35 Correct 248 ms 20100 KB Output is correct
36 Correct 259 ms 20132 KB Output is correct
37 Correct 146 ms 17396 KB Output is correct
38 Correct 246 ms 19220 KB Output is correct
39 Correct 49 ms 15520 KB Output is correct
40 Correct 263 ms 19120 KB Output is correct
41 Correct 183 ms 18008 KB Output is correct
42 Correct 256 ms 19208 KB Output is correct
43 Correct 87 ms 16312 KB Output is correct
44 Correct 256 ms 19216 KB Output is correct
45 Correct 53 ms 15564 KB Output is correct
46 Correct 259 ms 19228 KB Output is correct
47 Correct 77 ms 15928 KB Output is correct
48 Correct 242 ms 19240 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 366 ms 26556 KB Output is correct
2 Correct 384 ms 27940 KB Output is correct
3 Correct 302 ms 23904 KB Output is correct
4 Correct 379 ms 28028 KB Output is correct
5 Correct 184 ms 20812 KB Output is correct
6 Correct 394 ms 28076 KB Output is correct
7 Correct 331 ms 26124 KB Output is correct
8 Correct 399 ms 28064 KB Output is correct
9 Correct 59 ms 16844 KB Output is correct
10 Correct 375 ms 28180 KB Output is correct
11 Correct 254 ms 22912 KB Output is correct
12 Correct 415 ms 27952 KB Output is correct
13 Correct 372 ms 22584 KB Output is correct
14 Correct 340 ms 22760 KB Output is correct
15 Correct 342 ms 22748 KB Output is correct
16 Correct 339 ms 23180 KB Output is correct
17 Correct 412 ms 22948 KB Output is correct
18 Correct 357 ms 23476 KB Output is correct
19 Correct 361 ms 22648 KB Output is correct
20 Correct 345 ms 22512 KB Output is correct
21 Correct 326 ms 22724 KB Output is correct
22 Correct 330 ms 22740 KB Output is correct
23 Correct 335 ms 22452 KB Output is correct
24 Correct 353 ms 22520 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14420 KB Output is correct
2 Correct 8 ms 14532 KB Output is correct
3 Correct 8 ms 14548 KB Output is correct
4 Correct 10 ms 14544 KB Output is correct
5 Correct 8 ms 14548 KB Output is correct
6 Correct 11 ms 14508 KB Output is correct
7 Correct 12 ms 14548 KB Output is correct
8 Correct 9 ms 14540 KB Output is correct
9 Correct 8 ms 14548 KB Output is correct
10 Correct 8 ms 14548 KB Output is correct
11 Correct 8 ms 14544 KB Output is correct
12 Correct 10 ms 14548 KB Output is correct
13 Correct 9 ms 14548 KB Output is correct
14 Correct 8 ms 14544 KB Output is correct
15 Correct 9 ms 14548 KB Output is correct
16 Correct 9 ms 14548 KB Output is correct
17 Correct 10 ms 14548 KB Output is correct
18 Correct 9 ms 14532 KB Output is correct
19 Correct 9 ms 14548 KB Output is correct
20 Correct 8 ms 14548 KB Output is correct
21 Correct 8 ms 14548 KB Output is correct
22 Correct 8 ms 14544 KB Output is correct
23 Correct 8 ms 14548 KB Output is correct
24 Correct 10 ms 14460 KB Output is correct
25 Correct 216 ms 18648 KB Output is correct
26 Correct 29 ms 15188 KB Output is correct
27 Correct 247 ms 20084 KB Output is correct
28 Correct 272 ms 20144 KB Output is correct
29 Correct 178 ms 18736 KB Output is correct
30 Correct 189 ms 18420 KB Output is correct
31 Correct 211 ms 19784 KB Output is correct
32 Correct 252 ms 20172 KB Output is correct
33 Correct 237 ms 19876 KB Output is correct
34 Correct 133 ms 17368 KB Output is correct
35 Correct 248 ms 20100 KB Output is correct
36 Correct 259 ms 20132 KB Output is correct
37 Correct 146 ms 17396 KB Output is correct
38 Correct 246 ms 19220 KB Output is correct
39 Correct 49 ms 15520 KB Output is correct
40 Correct 263 ms 19120 KB Output is correct
41 Correct 183 ms 18008 KB Output is correct
42 Correct 256 ms 19208 KB Output is correct
43 Correct 87 ms 16312 KB Output is correct
44 Correct 256 ms 19216 KB Output is correct
45 Correct 53 ms 15564 KB Output is correct
46 Correct 259 ms 19228 KB Output is correct
47 Correct 77 ms 15928 KB Output is correct
48 Correct 242 ms 19240 KB Output is correct
49 Correct 366 ms 26556 KB Output is correct
50 Correct 384 ms 27940 KB Output is correct
51 Correct 302 ms 23904 KB Output is correct
52 Correct 379 ms 28028 KB Output is correct
53 Correct 184 ms 20812 KB Output is correct
54 Correct 394 ms 28076 KB Output is correct
55 Correct 331 ms 26124 KB Output is correct
56 Correct 399 ms 28064 KB Output is correct
57 Correct 59 ms 16844 KB Output is correct
58 Correct 375 ms 28180 KB Output is correct
59 Correct 254 ms 22912 KB Output is correct
60 Correct 415 ms 27952 KB Output is correct
61 Correct 372 ms 22584 KB Output is correct
62 Correct 340 ms 22760 KB Output is correct
63 Correct 342 ms 22748 KB Output is correct
64 Correct 339 ms 23180 KB Output is correct
65 Correct 412 ms 22948 KB Output is correct
66 Correct 357 ms 23476 KB Output is correct
67 Correct 361 ms 22648 KB Output is correct
68 Correct 345 ms 22512 KB Output is correct
69 Correct 326 ms 22724 KB Output is correct
70 Correct 330 ms 22740 KB Output is correct
71 Correct 335 ms 22452 KB Output is correct
72 Correct 353 ms 22520 KB Output is correct
73 Correct 649 ms 32436 KB Output is correct
74 Correct 417 ms 28560 KB Output is correct
75 Correct 619 ms 31028 KB Output is correct
76 Correct 758 ms 35300 KB Output is correct
77 Correct 418 ms 25884 KB Output is correct
78 Correct 633 ms 33248 KB Output is correct
79 Correct 706 ms 33544 KB Output is correct
80 Correct 817 ms 35380 KB Output is correct
81 Correct 337 ms 22604 KB Output is correct
82 Correct 590 ms 31868 KB Output is correct
83 Correct 639 ms 29616 KB Output is correct
84 Correct 773 ms 35264 KB Output is correct
85 Correct 558 ms 29136 KB Output is correct
86 Correct 708 ms 31472 KB Output is correct
87 Correct 377 ms 26300 KB Output is correct
88 Correct 755 ms 31808 KB Output is correct
89 Correct 631 ms 30104 KB Output is correct
90 Correct 729 ms 31812 KB Output is correct
91 Correct 500 ms 27392 KB Output is correct
92 Correct 700 ms 31368 KB Output is correct
93 Correct 370 ms 26324 KB Output is correct
94 Correct 717 ms 31480 KB Output is correct
95 Correct 435 ms 26944 KB Output is correct
96 Correct 719 ms 31384 KB Output is correct