oj.uz

Submission #525752

# Submission time Handle Problem Language Result Execution time Memory
525752 2022-02-12T19:17:15 Z Alex_tz307 Two Antennas (JOI19_antennas) C++17
100 / 100
 729 ms 41880 KB 
#include <bits/stdc++.h>
#define INF 0x3f3f3f3f

using namespace std;

const int kN = 2e5;
int h[1 + kN], a[1 + kN], b[1 + kN], l[1 + kN], r[1 + kN], sol[1 + kN];

struct node {
  int mx, mn, best;
} NIL{-INF, INF, -INF};

void minSelf(int &x, int y) {
  if (y < x) {
    x = y;
  }
}

void maxSelf(int &x, int y) {
  if (x < y) {
    x = y;
  }
}

struct ST {
  int n;
  vector<node> t;

  ST(int N) : n(N) {
    int dim = 1;
    while (dim < n) {
      dim *= 2;
    }
    t.resize(dim * 2, NIL);
  }

  void updateNode(int x, int v) {
    minSelf(t[x].mn, v);
    maxSelf(t[x].best, t[x].mx - t[x].mn);
  }

  void push(int x) {
    if (t[x].mn == INF) {
      return;
    }
    for (int i = 0; i < 2; ++i) {
      updateNode(x * 2 + i, t[x].mn);
    }
    t[x].mn = INF;
  }

  void setMax(int x, int lx, int rx, int pos, int v) {
    if (lx == rx) {
      t[x].mx = v;
      t[x].mn = INF;
      return;
    }
    push(x);
    int mid = (lx + rx) / 2;
    if (pos <= mid) {
      setMax(x * 2, lx, mid, pos, v);
    } else {
      setMax(x * 2 + 1, mid + 1, rx, pos, v);
    }
    t[x].mx = max(t[x * 2].mx, t[x * 2 + 1].mx);
    t[x].best = max({t[x].best, t[x * 2].best, t[x * 2 + 1].best, t[x].mx - t[x].mn});
  }

  void setMax(int pos, int v) {
    setMax(1, 1, n, pos, v);
  }

  void updateMin(int x, int lx, int rx, int st, int dr, int v) {
    if (st <= lx && rx <= dr) {
      updateNode(x, v);
      return;
    }
    push(x);
    int mid = (lx + rx) / 2;
    if (st <= mid) {
      updateMin(x * 2, lx, mid, st, dr, v);
    }
    if (mid < dr) {
      updateMin(x * 2 + 1, mid + 1, rx, st, dr, v);
    }
    t[x].mx = max(t[x * 2].mx, t[x * 2 + 1].mx);
    t[x].best = max({t[x].best, t[x * 2].best, t[x * 2 + 1].best, t[x].mx - t[x].mn});
  }

  void updateMin(int st, int dr, int v) {
    updateMin(1, 1, n, st, dr, v);
  }

  int query(int x, int lx, int rx, int st, int dr) {
    if (st <= lx && rx <= dr) {
      return t[x].best;
    }
    push(x);
    int mid = (lx + rx) / 2, ans = -1;
    if (st <= mid) {
      maxSelf(ans, query(x * 2, lx, mid, st, dr));
    }
    if (mid < dr) {
      maxSelf(ans, query(x * 2 + 1, mid + 1, rx, st, dr));
    }
    return ans;
  }

  int query(int st, int dr) {
    return query(1, 1, n, st, dr);
  }
};

void solve(int n, int q) {
  vector<vector<int>> queries(n + 1);
  for (int i = 1; i <= q; ++i) {
    queries[r[i]].emplace_back(i);
  }
  vector<vector<int>> enable(n + 1), disable(n + 1);
  ST t(n);
  for (int i = 1; i <= n; ++i) {
    for (int x : enable[i]) {
      t.setMax(x, h[x]);
    }
    for (int x : disable[i]) {
      t.setMax(x, -INF);
    }
    if (i - a[i] >= 1) {
      t.updateMin(max(1, i - b[i]), i - a[i], h[i]);
    }
    for (int j : queries[i]) {
      maxSelf(sol[j], t.query(l[j], i));
    }
    if (i + a[i] <= n) {
      enable[i + a[i]].emplace_back(i);
    }
    if (i + b[i] + 1 <= n) {
      disable[i + b[i] + 1].emplace_back(i);
    }
  }
}

void testCase() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; ++i) {
    cin >> h[i] >> a[i] >> b[i];
  }
  int q;
  cin >> q;
  for (int i = 1; i <= q; ++i) {
    cin >> l[i] >> r[i];
    sol[i] = -1;
  }
  solve(n, q);
  reverse(h + 1, h + n + 1);
  reverse(a + 1, a + n + 1);
  reverse(b + 1, b + n + 1);
  for (int i = 1; i <= q; ++i) {
    swap(l[i], r[i]);
    l[i] = n - l[i] + 1;
    r[i] = n - r[i] + 1;
  }
  solve(n, q);
  for (int i = 1; i <= q; ++i) {
    cout << sol[i] << '\n';
  }
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int tests = 1;
  for (int tc = 0; tc < tests; ++tc) {
    testCase();
  }
  return 0;
}

Subtask #1
2.0 / 2.0

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 316 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 320 KB Output is correct
19 Correct 1 ms 368 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 324 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 78 ms 5496 KB Output is correct
26 Correct 17 ms 1156 KB Output is correct
27 Correct 114 ms 7584 KB Output is correct
28 Correct 118 ms 7684 KB Output is correct
29 Correct 74 ms 5580 KB Output is correct
30 Correct 80 ms 5272 KB Output is correct
31 Correct 91 ms 6032 KB Output is correct
32 Correct 114 ms 7804 KB Output is correct
33 Correct 101 ms 7324 KB Output is correct
34 Correct 63 ms 4004 KB Output is correct
35 Correct 112 ms 7772 KB Output is correct
36 Correct 125 ms 7440 KB Output is correct
37 Correct 61 ms 4292 KB Output is correct
38 Correct 105 ms 6684 KB Output is correct
39 Correct 20 ms 1456 KB Output is correct
40 Correct 105 ms 6696 KB Output is correct
41 Correct 78 ms 5132 KB Output is correct
42 Correct 116 ms 6732 KB Output is correct
43 Correct 37 ms 2724 KB Output is correct
44 Correct 104 ms 6824 KB Output is correct
45 Correct 24 ms 1716 KB Output is correct
46 Correct 104 ms 6700 KB Output is correct
47 Correct 29 ms 2228 KB Output is correct
48 Correct 103 ms 6764 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 351 ms 24540 KB Output is correct
2 Correct 387 ms 26404 KB Output is correct
3 Correct 260 ms 20580 KB Output is correct
4 Correct 391 ms 26456 KB Output is correct
5 Correct 174 ms 12604 KB Output is correct
6 Correct 382 ms 26384 KB Output is correct
7 Correct 325 ms 23780 KB Output is correct
8 Correct 381 ms 26568 KB Output is correct
9 Correct 45 ms 4252 KB Output is correct
10 Correct 394 ms 26564 KB Output is correct
11 Correct 214 ms 15940 KB Output is correct
12 Correct 387 ms 26428 KB Output is correct
13 Correct 216 ms 25468 KB Output is correct
14 Correct 189 ms 25088 KB Output is correct
15 Correct 189 ms 24320 KB Output is correct
16 Correct 182 ms 24760 KB Output is correct
17 Correct 210 ms 25564 KB Output is correct
18 Correct 193 ms 24520 KB Output is correct
19 Correct 201 ms 24868 KB Output is correct
20 Correct 197 ms 24896 KB Output is correct
21 Correct 181 ms 25396 KB Output is correct
22 Correct 196 ms 24908 KB Output is correct
23 Correct 207 ms 25056 KB Output is correct
24 Correct 171 ms 24188 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 316 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 320 KB Output is correct
19 Correct 1 ms 368 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 324 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 78 ms 5496 KB Output is correct
26 Correct 17 ms 1156 KB Output is correct
27 Correct 114 ms 7584 KB Output is correct
28 Correct 118 ms 7684 KB Output is correct
29 Correct 74 ms 5580 KB Output is correct
30 Correct 80 ms 5272 KB Output is correct
31 Correct 91 ms 6032 KB Output is correct
32 Correct 114 ms 7804 KB Output is correct
33 Correct 101 ms 7324 KB Output is correct
34 Correct 63 ms 4004 KB Output is correct
35 Correct 112 ms 7772 KB Output is correct
36 Correct 125 ms 7440 KB Output is correct
37 Correct 61 ms 4292 KB Output is correct
38 Correct 105 ms 6684 KB Output is correct
39 Correct 20 ms 1456 KB Output is correct
40 Correct 105 ms 6696 KB Output is correct
41 Correct 78 ms 5132 KB Output is correct
42 Correct 116 ms 6732 KB Output is correct
43 Correct 37 ms 2724 KB Output is correct
44 Correct 104 ms 6824 KB Output is correct
45 Correct 24 ms 1716 KB Output is correct
46 Correct 104 ms 6700 KB Output is correct
47 Correct 29 ms 2228 KB Output is correct
48 Correct 103 ms 6764 KB Output is correct
49 Correct 351 ms 24540 KB Output is correct
50 Correct 387 ms 26404 KB Output is correct
51 Correct 260 ms 20580 KB Output is correct
52 Correct 391 ms 26456 KB Output is correct
53 Correct 174 ms 12604 KB Output is correct
54 Correct 382 ms 26384 KB Output is correct
55 Correct 325 ms 23780 KB Output is correct
56 Correct 381 ms 26568 KB Output is correct
57 Correct 45 ms 4252 KB Output is correct
58 Correct 394 ms 26564 KB Output is correct
59 Correct 214 ms 15940 KB Output is correct
60 Correct 387 ms 26428 KB Output is correct
61 Correct 216 ms 25468 KB Output is correct
62 Correct 189 ms 25088 KB Output is correct
63 Correct 189 ms 24320 KB Output is correct
64 Correct 182 ms 24760 KB Output is correct
65 Correct 210 ms 25564 KB Output is correct
66 Correct 193 ms 24520 KB Output is correct
67 Correct 201 ms 24868 KB Output is correct
68 Correct 197 ms 24896 KB Output is correct
69 Correct 181 ms 25396 KB Output is correct
70 Correct 196 ms 24908 KB Output is correct
71 Correct 207 ms 25056 KB Output is correct
72 Correct 171 ms 24188 KB Output is correct
73 Correct 590 ms 36768 KB Output is correct
74 Correct 415 ms 31984 KB Output is correct
75 Correct 555 ms 33824 KB Output is correct
76 Correct 712 ms 41872 KB Output is correct
77 Correct 354 ms 21796 KB Output is correct
78 Correct 651 ms 38600 KB Output is correct
79 Correct 651 ms 38312 KB Output is correct
80 Correct 729 ms 41880 KB Output is correct
81 Correct 227 ms 10888 KB Output is correct
82 Correct 563 ms 36760 KB Output is correct
83 Correct 489 ms 28528 KB Output is correct
84 Correct 699 ms 41840 KB Output is correct
85 Correct 349 ms 35860 KB Output is correct
86 Correct 458 ms 39064 KB Output is correct
87 Correct 224 ms 30348 KB Output is correct
88 Correct 420 ms 38020 KB Output is correct
89 Correct 404 ms 37580 KB Output is correct
90 Correct 432 ms 38508 KB Output is correct
91 Correct 291 ms 32812 KB Output is correct
92 Correct 461 ms 39120 KB Output is correct
93 Correct 227 ms 31744 KB Output is correct
94 Correct 443 ms 38960 KB Output is correct
95 Correct 264 ms 32312 KB Output is correct
96 Correct 420 ms 38068 KB Output is correct