oj.uz

답안 #579281

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
579281 2022-06-18T18:50:31 Z lumibons Two Antennas (JOI19_antennas) C++17
100 / 100
 905 ms 42244 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

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 14548 KB Output is correct
2 Correct 8 ms 14492 KB Output is correct
3 Correct 8 ms 14548 KB Output is correct
4 Correct 8 ms 14540 KB Output is correct
5 Correct 8 ms 14516 KB Output is correct
6 Correct 9 ms 14532 KB Output is correct
7 Correct 9 ms 14544 KB Output is correct
8 Correct 9 ms 14548 KB Output is correct
9 Correct 10 ms 14548 KB Output is correct
10 Correct 9 ms 14496 KB Output is correct
11 Correct 9 ms 14536 KB Output is correct
12 Correct 8 ms 14540 KB Output is correct
13 Correct 9 ms 14548 KB Output is correct
14 Correct 8 ms 14548 KB Output is correct
15 Correct 8 ms 14548 KB Output is correct
16 Correct 8 ms 14540 KB Output is correct
17 Correct 9 ms 14544 KB Output is correct
18 Correct 8 ms 14560 KB Output is correct
19 Correct 8 ms 14548 KB Output is correct
20 Correct 11 ms 14548 KB Output is correct
21 Correct 9 ms 14508 KB Output is correct
22 Correct 8 ms 14528 KB Output is correct
23 Correct 9 ms 14548 KB Output is correct
24 Correct 11 ms 14520 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 14548 KB Output is correct
2 Correct 8 ms 14492 KB Output is correct
3 Correct 8 ms 14548 KB Output is correct
4 Correct 8 ms 14540 KB Output is correct
5 Correct 8 ms 14516 KB Output is correct
6 Correct 9 ms 14532 KB Output is correct
7 Correct 9 ms 14544 KB Output is correct
8 Correct 9 ms 14548 KB Output is correct
9 Correct 10 ms 14548 KB Output is correct
10 Correct 9 ms 14496 KB Output is correct
11 Correct 9 ms 14536 KB Output is correct
12 Correct 8 ms 14540 KB Output is correct
13 Correct 9 ms 14548 KB Output is correct
14 Correct 8 ms 14548 KB Output is correct
15 Correct 8 ms 14548 KB Output is correct
16 Correct 8 ms 14540 KB Output is correct
17 Correct 9 ms 14544 KB Output is correct
18 Correct 8 ms 14560 KB Output is correct
19 Correct 8 ms 14548 KB Output is correct
20 Correct 11 ms 14548 KB Output is correct
21 Correct 9 ms 14508 KB Output is correct
22 Correct 8 ms 14528 KB Output is correct
23 Correct 9 ms 14548 KB Output is correct
24 Correct 11 ms 14520 KB Output is correct
25 Correct 177 ms 19540 KB Output is correct
26 Correct 37 ms 15216 KB Output is correct
27 Correct 281 ms 21680 KB Output is correct
28 Correct 256 ms 21852 KB Output is correct
29 Correct 210 ms 19624 KB Output is correct
30 Correct 187 ms 19332 KB Output is correct
31 Correct 228 ms 20960 KB Output is correct
32 Correct 283 ms 21728 KB Output is correct
33 Correct 252 ms 21236 KB Output is correct
34 Correct 164 ms 18184 KB Output is correct
35 Correct 256 ms 21696 KB Output is correct
36 Correct 269 ms 21724 KB Output is correct
37 Correct 161 ms 18096 KB Output is correct
38 Correct 269 ms 20848 KB Output is correct
39 Correct 48 ms 15436 KB Output is correct
40 Correct 263 ms 20852 KB Output is correct
41 Correct 215 ms 19176 KB Output is correct
42 Correct 265 ms 20896 KB Output is correct
43 Correct 98 ms 16672 KB Output is correct
44 Correct 261 ms 20852 KB Output is correct
45 Correct 53 ms 15648 KB Output is correct
46 Correct 259 ms 20760 KB Output is correct
47 Correct 71 ms 16172 KB Output is correct
48 Correct 270 ms 20832 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 378 ms 30220 KB Output is correct
2 Correct 411 ms 32256 KB Output is correct
3 Correct 269 ms 26816 KB Output is correct
4 Correct 461 ms 32248 KB Output is correct
5 Correct 187 ms 22576 KB Output is correct
6 Correct 467 ms 32352 KB Output is correct
7 Correct 348 ms 29700 KB Output is correct
8 Correct 463 ms 32416 KB Output is correct
9 Correct 66 ms 17228 KB Output is correct
10 Correct 409 ms 32380 KB Output is correct
11 Correct 273 ms 25412 KB Output is correct
12 Correct 391 ms 32264 KB Output is correct
13 Correct 364 ms 26688 KB Output is correct
14 Correct 370 ms 26772 KB Output is correct
15 Correct 374 ms 26716 KB Output is correct
16 Correct 425 ms 27452 KB Output is correct
17 Correct 430 ms 26912 KB Output is correct
18 Correct 378 ms 27508 KB Output is correct
19 Correct 390 ms 26720 KB Output is correct
20 Correct 346 ms 26632 KB Output is correct
21 Correct 350 ms 26740 KB Output is correct
22 Correct 344 ms 26932 KB Output is correct
23 Correct 351 ms 26568 KB Output is correct
24 Correct 350 ms 26708 KB Output is correct

Subtask #4
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 14548 KB Output is correct
2 Correct 8 ms 14492 KB Output is correct
3 Correct 8 ms 14548 KB Output is correct
4 Correct 8 ms 14540 KB Output is correct
5 Correct 8 ms 14516 KB Output is correct
6 Correct 9 ms 14532 KB Output is correct
7 Correct 9 ms 14544 KB Output is correct
8 Correct 9 ms 14548 KB Output is correct
9 Correct 10 ms 14548 KB Output is correct
10 Correct 9 ms 14496 KB Output is correct
11 Correct 9 ms 14536 KB Output is correct
12 Correct 8 ms 14540 KB Output is correct
13 Correct 9 ms 14548 KB Output is correct
14 Correct 8 ms 14548 KB Output is correct
15 Correct 8 ms 14548 KB Output is correct
16 Correct 8 ms 14540 KB Output is correct
17 Correct 9 ms 14544 KB Output is correct
18 Correct 8 ms 14560 KB Output is correct
19 Correct 8 ms 14548 KB Output is correct
20 Correct 11 ms 14548 KB Output is correct
21 Correct 9 ms 14508 KB Output is correct
22 Correct 8 ms 14528 KB Output is correct
23 Correct 9 ms 14548 KB Output is correct
24 Correct 11 ms 14520 KB Output is correct
25 Correct 177 ms 19540 KB Output is correct
26 Correct 37 ms 15216 KB Output is correct
27 Correct 281 ms 21680 KB Output is correct
28 Correct 256 ms 21852 KB Output is correct
29 Correct 210 ms 19624 KB Output is correct
30 Correct 187 ms 19332 KB Output is correct
31 Correct 228 ms 20960 KB Output is correct
32 Correct 283 ms 21728 KB Output is correct
33 Correct 252 ms 21236 KB Output is correct
34 Correct 164 ms 18184 KB Output is correct
35 Correct 256 ms 21696 KB Output is correct
36 Correct 269 ms 21724 KB Output is correct
37 Correct 161 ms 18096 KB Output is correct
38 Correct 269 ms 20848 KB Output is correct
39 Correct 48 ms 15436 KB Output is correct
40 Correct 263 ms 20852 KB Output is correct
41 Correct 215 ms 19176 KB Output is correct
42 Correct 265 ms 20896 KB Output is correct
43 Correct 98 ms 16672 KB Output is correct
44 Correct 261 ms 20852 KB Output is correct
45 Correct 53 ms 15648 KB Output is correct
46 Correct 259 ms 20760 KB Output is correct
47 Correct 71 ms 16172 KB Output is correct
48 Correct 270 ms 20832 KB Output is correct
49 Correct 378 ms 30220 KB Output is correct
50 Correct 411 ms 32256 KB Output is correct
51 Correct 269 ms 26816 KB Output is correct
52 Correct 461 ms 32248 KB Output is correct
53 Correct 187 ms 22576 KB Output is correct
54 Correct 467 ms 32352 KB Output is correct
55 Correct 348 ms 29700 KB Output is correct
56 Correct 463 ms 32416 KB Output is correct
57 Correct 66 ms 17228 KB Output is correct
58 Correct 409 ms 32380 KB Output is correct
59 Correct 273 ms 25412 KB Output is correct
60 Correct 391 ms 32264 KB Output is correct
61 Correct 364 ms 26688 KB Output is correct
62 Correct 370 ms 26772 KB Output is correct
63 Correct 374 ms 26716 KB Output is correct
64 Correct 425 ms 27452 KB Output is correct
65 Correct 430 ms 26912 KB Output is correct
66 Correct 378 ms 27508 KB Output is correct
67 Correct 390 ms 26720 KB Output is correct
68 Correct 346 ms 26632 KB Output is correct
69 Correct 350 ms 26740 KB Output is correct
70 Correct 344 ms 26932 KB Output is correct
71 Correct 351 ms 26568 KB Output is correct
72 Correct 350 ms 26708 KB Output is correct
73 Correct 681 ms 37976 KB Output is correct
74 Correct 462 ms 32968 KB Output is correct
75 Correct 688 ms 36380 KB Output is correct
76 Correct 905 ms 42244 KB Output is correct
77 Correct 466 ms 29252 KB Output is correct
78 Correct 714 ms 39228 KB Output is correct
79 Correct 736 ms 39808 KB Output is correct
80 Correct 786 ms 42216 KB Output is correct
81 Correct 339 ms 25180 KB Output is correct
82 Correct 611 ms 37552 KB Output is correct
83 Correct 669 ms 34904 KB Output is correct
84 Correct 805 ms 42240 KB Output is correct
85 Correct 595 ms 34928 KB Output is correct
86 Correct 751 ms 38468 KB Output is correct
87 Correct 407 ms 31072 KB Output is correct
88 Correct 763 ms 38920 KB Output is correct
89 Correct 708 ms 36448 KB Output is correct
90 Correct 817 ms 38888 KB Output is correct
91 Correct 508 ms 32708 KB Output is correct
92 Correct 742 ms 38308 KB Output is correct
93 Correct 410 ms 31132 KB Output is correct
94 Correct 767 ms 38540 KB Output is correct
95 Correct 496 ms 32048 KB Output is correct
96 Correct 709 ms 38468 KB Output is correct