oj.uz

Submission #235676

# Submission time Handle Problem Language Result Execution time Memory
235676 2020-05-29T09:55:50 Z fedoseevtimofey Two Antennas (JOI19_antennas) C++14
100 / 100
 788 ms 48520 KB 
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <random>
#include <iomanip>
#include <functional>
#include <cassert>
#include <bitset>
 
using namespace std;
 
typedef long long ll;

const int N = 2e5 + 7;
const int Inf = 1e9 + 7;

struct Tree {
  int mx[4 * N], t[4 * N], mod[4 * N];

  void update(int v, int x) {
    mod[v] = max(mod[v], x);
    mx[v] = max(mx[v], t[v] + mod[v]);
  }

  void push(int v) {
    if (mod[v] != -Inf) {
      if (2 * v + 1 < 4 * N) update(2 * v + 1, mod[v]);
      if (2 * v + 2 < 4 * N) update(2 * v + 2, mod[v]);
      mod[v] = -Inf;
    }
  }

  void modify(int ql, int qr, int val, int l, int r, int v) {
    if (qr < l || r < ql) return;
    if (ql <= l && r <= qr) {
      update(v, val);
    } else {
      push(v);
      int m = (l + r) >> 1;
      modify(ql, qr, val, l, m, 2 * v + 1);
      modify(ql, qr, val, m + 1, r, 2 * v + 2);
      t[v] = max(t[2 * v + 1], t[2 * v + 2]);
      mx[v] = max(mx[2 * v + 1], mx[2 * v + 2]);
    }
  }


  void set_(int id, int val, int l, int r, int v) {
    if (l == r) {
      push(v);
      t[v] = val;
    } else {
      push(v);
      int m = (l + r) >> 1;
      if (id <= m) set_(id, val, l, m, 2 * v + 1);
      else set_(id, val, m + 1, r, 2 * v + 2);
      t[v] = max(t[2 * v + 1], t[2 * v + 2]);
      mx[v] = max(mx[2 * v + 1], mx[2 * v + 2]);
    }
  }

  int get(int ql, int qr, int l, int r, int v) {
    if (qr < l || r < ql) return -Inf;
    if (ql <= l && r <= qr) return mx[v];
    push(v);
    int m = (l + r) >> 1;
    return max(get(ql, qr, l, m, 2 * v + 1), get(ql, qr, m + 1, r, 2 * v + 2));
  }
  
  Tree() {
    fill(t, t + 4 * N, -Inf);
    fill(mx, mx + 4 * N, -Inf);
    fill(mod, mod + 4 * N, -Inf);
  }
};


vector <int> solve(int n, vector <int> h, vector <int> a, vector <int> b, int q, vector <int> ql, vector <int> qr) {
  vector <vector <pair <int, int>>> who(n);
  vector <int> ans(q, -1);

  for (int i = 0; i < q; ++i) {
    who[qr[i]].emplace_back(ql[i], i);
  }

  vector <vector <int>> add(n), del(n);
  for (int i = 0; i < n; ++i) {
    int l = i + a[i], r = i + b[i];
    r = min(r, n - 1);
    if (l <= r) {
      add[l].push_back(i);
      del[r].push_back(i);
    }
  }

  Tree neg;

  for (int i = 0; i < n; ++i) {
    for (int id : add[i]) {
      neg.set_(id, -h[id], 0, n - 1, 0);
    }
    int l = max(0, i - b[i]);
    int r = i - a[i];
    if (l <= r) {
      neg.modify(l, r, h[i], 0, n - 1, 0);
    }
    for (auto p : who[i]) {
      ans[p.second] = max(ans[p.second], neg.get(p.first, i, 0, n - 1, 0));
    }
    for (int id : del[i]) {
      neg.set_(id, -Inf, 0, n - 1, 0);
    }
  }
  return ans;
}

int main() {
  ios_base::sync_with_stdio(false); cin.tie(0);
#ifdef LOCAL
  freopen("input.txt", "r", stdin);
#endif
  int n;
  cin >> n;
  vector <int> h(n), a(n), b(n);
  for (int i = 0; i < n; ++i) {
    cin >> h[i] >> a[i] >> b[i];
  }
  int q;
  cin >> q;
  vector <int> ql(q), qr(q);
  for (int i = 0; i < q; ++i) {
    cin >> ql[i] >> qr[i];
    --ql[i], --qr[i];
  }
  vector <int> ans = solve(n, h, a, b, q, ql, qr);
  reverse(h.begin(), h.end());
  reverse(a.begin(), a.end());
  reverse(b.begin(), b.end());
  for (int i = 0; i < q; ++i) {
    ql[i] = n - ql[i] - 1;
    qr[i] = n - qr[i] - 1;
    swap(ql[i], qr[i]);
  }
  vector <int> rans = solve(n, h, a, b, q, ql, qr);
  for (int i = 0; i < q; ++i) {
    cout << max(ans[i], rans[i]) << '\n';
  }
}

Subtask #1
2.0 / 2.0

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 9728 KB Output is correct
2 Correct 11 ms 9728 KB Output is correct
3 Correct 11 ms 9728 KB Output is correct
4 Correct 12 ms 9728 KB Output is correct
5 Correct 11 ms 9856 KB Output is correct
6 Correct 12 ms 9856 KB Output is correct
7 Correct 14 ms 9856 KB Output is correct
8 Correct 11 ms 9728 KB Output is correct
9 Correct 13 ms 9728 KB Output is correct
10 Correct 12 ms 9728 KB Output is correct
11 Correct 11 ms 9728 KB Output is correct
12 Correct 12 ms 9856 KB Output is correct
13 Correct 12 ms 9728 KB Output is correct
14 Correct 11 ms 9856 KB Output is correct
15 Correct 11 ms 9728 KB Output is correct
16 Correct 12 ms 9728 KB Output is correct
17 Correct 11 ms 9728 KB Output is correct
18 Correct 12 ms 9856 KB Output is correct
19 Correct 11 ms 9728 KB Output is correct
20 Correct 11 ms 9728 KB Output is correct
21 Correct 11 ms 9728 KB Output is correct
22 Correct 11 ms 9728 KB Output is correct
23 Correct 11 ms 9728 KB Output is correct
24 Correct 11 ms 9728 KB Output is correct
25 Correct 103 ms 15692 KB Output is correct
26 Correct 25 ms 10624 KB Output is correct
27 Correct 145 ms 17444 KB Output is correct
28 Correct 151 ms 17120 KB Output is correct
29 Correct 108 ms 15676 KB Output is correct
30 Correct 105 ms 15112 KB Output is correct
31 Correct 116 ms 17120 KB Output is correct
32 Correct 149 ms 17120 KB Output is correct
33 Correct 142 ms 17336 KB Output is correct
34 Correct 82 ms 13532 KB Output is correct
35 Correct 148 ms 17820 KB Output is correct
36 Correct 152 ms 17100 KB Output is correct
37 Correct 94 ms 14312 KB Output is correct
38 Correct 147 ms 17148 KB Output is correct
39 Correct 32 ms 11192 KB Output is correct
40 Correct 151 ms 17136 KB Output is correct
41 Correct 110 ms 15636 KB Output is correct
42 Correct 144 ms 17012 KB Output is correct
43 Correct 58 ms 12596 KB Output is correct
44 Correct 149 ms 17132 KB Output is correct
45 Correct 37 ms 11436 KB Output is correct
46 Correct 144 ms 17116 KB Output is correct
47 Correct 48 ms 11988 KB Output is correct
48 Correct 148 ms 17112 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 394 ms 30076 KB Output is correct
2 Correct 433 ms 32496 KB Output is correct
3 Correct 296 ms 25832 KB Output is correct
4 Correct 430 ms 32264 KB Output is correct
5 Correct 196 ms 20228 KB Output is correct
6 Correct 430 ms 32372 KB Output is correct
7 Correct 358 ms 29448 KB Output is correct
8 Correct 416 ms 32372 KB Output is correct
9 Correct 55 ms 13312 KB Output is correct
10 Correct 426 ms 32624 KB Output is correct
11 Correct 243 ms 23988 KB Output is correct
12 Correct 425 ms 32368 KB Output is correct
13 Correct 227 ms 31252 KB Output is correct
14 Correct 227 ms 31320 KB Output is correct
15 Correct 216 ms 30400 KB Output is correct
16 Correct 207 ms 30712 KB Output is correct
17 Correct 238 ms 31884 KB Output is correct
18 Correct 226 ms 30776 KB Output is correct
19 Correct 231 ms 31000 KB Output is correct
20 Correct 231 ms 31120 KB Output is correct
21 Correct 221 ms 31776 KB Output is correct
22 Correct 219 ms 31208 KB Output is correct
23 Correct 223 ms 31412 KB Output is correct
24 Correct 206 ms 30272 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 9728 KB Output is correct
2 Correct 11 ms 9728 KB Output is correct
3 Correct 11 ms 9728 KB Output is correct
4 Correct 12 ms 9728 KB Output is correct
5 Correct 11 ms 9856 KB Output is correct
6 Correct 12 ms 9856 KB Output is correct
7 Correct 14 ms 9856 KB Output is correct
8 Correct 11 ms 9728 KB Output is correct
9 Correct 13 ms 9728 KB Output is correct
10 Correct 12 ms 9728 KB Output is correct
11 Correct 11 ms 9728 KB Output is correct
12 Correct 12 ms 9856 KB Output is correct
13 Correct 12 ms 9728 KB Output is correct
14 Correct 11 ms 9856 KB Output is correct
15 Correct 11 ms 9728 KB Output is correct
16 Correct 12 ms 9728 KB Output is correct
17 Correct 11 ms 9728 KB Output is correct
18 Correct 12 ms 9856 KB Output is correct
19 Correct 11 ms 9728 KB Output is correct
20 Correct 11 ms 9728 KB Output is correct
21 Correct 11 ms 9728 KB Output is correct
22 Correct 11 ms 9728 KB Output is correct
23 Correct 11 ms 9728 KB Output is correct
24 Correct 11 ms 9728 KB Output is correct
25 Correct 103 ms 15692 KB Output is correct
26 Correct 25 ms 10624 KB Output is correct
27 Correct 145 ms 17444 KB Output is correct
28 Correct 151 ms 17120 KB Output is correct
29 Correct 108 ms 15676 KB Output is correct
30 Correct 105 ms 15112 KB Output is correct
31 Correct 116 ms 17120 KB Output is correct
32 Correct 149 ms 17120 KB Output is correct
33 Correct 142 ms 17336 KB Output is correct
34 Correct 82 ms 13532 KB Output is correct
35 Correct 148 ms 17820 KB Output is correct
36 Correct 152 ms 17100 KB Output is correct
37 Correct 94 ms 14312 KB Output is correct
38 Correct 147 ms 17148 KB Output is correct
39 Correct 32 ms 11192 KB Output is correct
40 Correct 151 ms 17136 KB Output is correct
41 Correct 110 ms 15636 KB Output is correct
42 Correct 144 ms 17012 KB Output is correct
43 Correct 58 ms 12596 KB Output is correct
44 Correct 149 ms 17132 KB Output is correct
45 Correct 37 ms 11436 KB Output is correct
46 Correct 144 ms 17116 KB Output is correct
47 Correct 48 ms 11988 KB Output is correct
48 Correct 148 ms 17112 KB Output is correct
49 Correct 394 ms 30076 KB Output is correct
50 Correct 433 ms 32496 KB Output is correct
51 Correct 296 ms 25832 KB Output is correct
52 Correct 430 ms 32264 KB Output is correct
53 Correct 196 ms 20228 KB Output is correct
54 Correct 430 ms 32372 KB Output is correct
55 Correct 358 ms 29448 KB Output is correct
56 Correct 416 ms 32372 KB Output is correct
57 Correct 55 ms 13312 KB Output is correct
58 Correct 426 ms 32624 KB Output is correct
59 Correct 243 ms 23988 KB Output is correct
60 Correct 425 ms 32368 KB Output is correct
61 Correct 227 ms 31252 KB Output is correct
62 Correct 227 ms 31320 KB Output is correct
63 Correct 216 ms 30400 KB Output is correct
64 Correct 207 ms 30712 KB Output is correct
65 Correct 238 ms 31884 KB Output is correct
66 Correct 226 ms 30776 KB Output is correct
67 Correct 231 ms 31000 KB Output is correct
68 Correct 231 ms 31120 KB Output is correct
69 Correct 221 ms 31776 KB Output is correct
70 Correct 219 ms 31208 KB Output is correct
71 Correct 223 ms 31412 KB Output is correct
72 Correct 206 ms 30272 KB Output is correct
73 Correct 655 ms 42964 KB Output is correct
74 Correct 469 ms 37872 KB Output is correct
75 Correct 603 ms 39836 KB Output is correct
76 Correct 788 ms 48520 KB Output is correct
77 Correct 384 ms 30040 KB Output is correct
78 Correct 659 ms 44900 KB Output is correct
79 Correct 684 ms 44520 KB Output is correct
80 Correct 748 ms 48464 KB Output is correct
81 Correct 279 ms 23244 KB Output is correct
82 Correct 589 ms 42752 KB Output is correct
83 Correct 522 ms 37376 KB Output is correct
84 Correct 751 ms 48460 KB Output is correct
85 Correct 427 ms 42740 KB Output is correct
86 Correct 521 ms 46852 KB Output is correct
87 Correct 272 ms 36232 KB Output is correct
88 Correct 524 ms 45644 KB Output is correct
89 Correct 468 ms 44692 KB Output is correct
90 Correct 545 ms 46248 KB Output is correct
91 Correct 340 ms 39188 KB Output is correct
92 Correct 534 ms 46800 KB Output is correct
93 Correct 275 ms 37764 KB Output is correct
94 Correct 514 ms 46748 KB Output is correct
95 Correct 294 ms 38692 KB Output is correct
96 Correct 480 ms 45836 KB Output is correct