oj.uz

Submission #200066

# Submission time Handle Problem Language Result Execution time Memory
200066 2020-02-05T08:20:01 Z EntityIT Two Antennas (JOI19_antennas) C++14
100 / 100
 812 ms 37496 KB 
#include<bits/stdc++.h>

using namespace std;

#define all(x) (x).begin(), (x).end()
#define sz(x) ( (int)(x).size() )
using LL = long long;

template<class T>
inline bool asMn(T &a, const T &b) { return a > b ? a = b, true : false; }
template<class T>
inline bool asMx(T &a, const T &b) { return a < b ? a = b, true : false; }

const int inf = 1e9 + 7;
mt19937 rng( (uint32_t)chrono::steady_clock::now().time_since_epoch().count() );

int n;
vector<tuple<int, int, int> > antennas;

struct Node {
  int ans, mnH, mxH;
  Node(int _ans = -1, int _mnH = inf, int _mxH = -inf) : ans(_ans), mnH(_mnH), mxH(_mxH) {}

  Node operator + (const Node &_) const { return Node(max(ans, _.ans), min(mnH, _.mnH), max(mxH, _.mxH) );}
};

struct Lz {
  int mnH, mxH;
  Lz(int _mnH = inf, int _mxH = -inf) : mnH(_mnH), mxH(_mxH) {}

  bool operator == (const Lz &_) const { return mnH == _.mnH && mxH == _.mxH; }

  Lz& operator += (const Lz& _) { asMn(mnH, _.mnH); asMx(mxH, _.mxH); return *this; }
};

struct It {
  vector<Node> node;
  vector<Lz> lz;
  It(int nNode) {
    node.assign(nNode, Node() );
    lz.assign(nNode, Lz() );
  }

  void trueVal(int i, int Left, int Right) {
    if (lz[i] == Lz() ) return ;

    if (node[i].mnH < inf) {
      asMx(node[i].ans, abs(lz[i].mnH - node[i].mxH) );
      asMx(node[i].ans, abs(lz[i].mxH - node[i].mnH) );
    }

    if (Left != Right) {
      lz[i << 1] += lz[i];
      lz[i << 1 | 1] += lz[i];
    }

    lz[i] = Lz();
  }

  void ins(int pos, int i = 1, int Left = 0, int Right = n - 1) {
    trueVal(i, Left, Right);
    if (pos < Left || Right < pos) return ;
    if (Left == Right) {
      node[i].mnH = node[i].mxH = get<0>(antennas[pos]);
      return ;
    }
    int Mid = (Left + Right) >> 1;
    ins(pos, i << 1, Left, Mid);
    ins(pos, i << 1 | 1, Mid + 1, Right);

    node[i] = node[i << 1] + node[i << 1 | 1];
  }

  void era(int pos, int i = 1, int Left = 0, int Right = n - 1) {
    trueVal(i, Left, Right);
    if (pos < Left || Right < pos) return ;
    if (Left == Right) {
      node[i].mnH = inf; node[i].mxH = -inf;
      return ;
    }
    int Mid = (Left + Right) >> 1;
    era(pos, i << 1, Left, Mid);
    era(pos, i << 1 | 1, Mid + 1, Right);

    node[i] = node[i << 1] + node[i << 1 | 1];
  }

  void upd(int l, int r, int h, int i = 1, int Left = 0, int Right = n - 1) {
    trueVal(i, Left, Right);
    if (r < Left || Right < l) return ;
    if (l <= Left && Right <= r) {
      lz[i] = Lz(h, h); trueVal(i, Left, Right);
      return ;
    }
    int Mid = (Left + Right) >> 1;
    upd(l, r, h, i << 1, Left, Mid);
    upd(l, r, h, i << 1 | 1, Mid + 1, Right);

    node[i] = node[i << 1] + node[i << 1 | 1];
  }

  int getAns(int l, int r, int i = 1, int Left = 0, int Right = n - 1) {
    trueVal(i, Left, Right);
    if (r < Left || Right < l) return -1;
    if (l <= Left && Right <= r) return node[i].ans;
    int Mid = (Left + Right) >> 1;
    return max(getAns(l, r, i << 1, Left, Mid), getAns(l, r, i << 1 | 1, Mid + 1, Right) );
  }
};

int main() {
  ios_base::sync_with_stdio(0); cin.tie(0);

  #ifdef FourLeafClover
  freopen("input", "r", stdin);
  #endif // FourLeafCLover

  cin >> n;
  antennas.assign(n, {} );
  vector<vector<pair<int, bool> > > change(n);
  for (int i = 0; i < n; ++i) {
    cin >> get<0>(antennas[i]) >> get<1>(antennas[i]) >> get<2>(antennas[i]);
    if (i + get<1>(antennas[i]) < n) change[i + get<1>(antennas[i])].emplace_back(i, true);
    if (i + get<2>(antennas[i]) + 1 < n) change[i + get<2>(antennas[i]) + 1].emplace_back(i, false);
  }

  int q; cin >> q;
  vector<vector<pair<int, int> > > que(n);
  for (int i = 0; i < q; ++i) {
    int l, r; cin >> l >> r; --l; --r;
    que[r].emplace_back(l, i);
  }

  It it( (n + 5) << 2);
  vector<int> ans(q);
  for (int r = 0; r < n; ++r) {
    for (auto _ : change[r]) {
      int pos = _.first; bool ins = _.second;
      if (ins) it.ins(pos);
      else it.era(pos);
    }

    it.upd(r - get<2>(antennas[r]), r - get<1>(antennas[r]), get<0>(antennas[r]) );

    for (auto _ : que[r]) {
      int l = _.first, id = _.second;
      ans[id] = it.getAns(l, r);
    }
  }

  for (auto i : ans) cout << i << '\n';

  return 0;
}

Subtask #1
2.0 / 2.0

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 6 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 6 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 380 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 6 ms 376 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 81 ms 4088 KB Output is correct
26 Correct 18 ms 1016 KB Output is correct
27 Correct 115 ms 5496 KB Output is correct
28 Correct 120 ms 5624 KB Output is correct
29 Correct 78 ms 4088 KB Output is correct
30 Correct 88 ms 3960 KB Output is correct
31 Correct 91 ms 4856 KB Output is correct
32 Correct 120 ms 5624 KB Output is correct
33 Correct 103 ms 5240 KB Output is correct
34 Correct 66 ms 3064 KB Output is correct
35 Correct 117 ms 5496 KB Output is correct
36 Correct 135 ms 5624 KB Output is correct
37 Correct 69 ms 2936 KB Output is correct
38 Correct 124 ms 4728 KB Output is correct
39 Correct 21 ms 1144 KB Output is correct
40 Correct 111 ms 4600 KB Output is correct
41 Correct 84 ms 3576 KB Output is correct
42 Correct 116 ms 4600 KB Output is correct
43 Correct 44 ms 2040 KB Output is correct
44 Correct 112 ms 4600 KB Output is correct
45 Correct 26 ms 1276 KB Output is correct
46 Correct 111 ms 4652 KB Output is correct
47 Correct 33 ms 1656 KB Output is correct
48 Correct 115 ms 4600 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 369 ms 27900 KB Output is correct
2 Correct 413 ms 31100 KB Output is correct
3 Correct 271 ms 21880 KB Output is correct
4 Correct 426 ms 31048 KB Output is correct
5 Correct 170 ms 14460 KB Output is correct
6 Correct 414 ms 30968 KB Output is correct
7 Correct 361 ms 26872 KB Output is correct
8 Correct 415 ms 30956 KB Output is correct
9 Correct 55 ms 5240 KB Output is correct
10 Correct 402 ms 30840 KB Output is correct
11 Correct 234 ms 19448 KB Output is correct
12 Correct 418 ms 30840 KB Output is correct
13 Correct 199 ms 29676 KB Output is correct
14 Correct 193 ms 29620 KB Output is correct
15 Correct 179 ms 29684 KB Output is correct
16 Correct 173 ms 30220 KB Output is correct
17 Correct 196 ms 29868 KB Output is correct
18 Correct 188 ms 30280 KB Output is correct
19 Correct 194 ms 29620 KB Output is correct
20 Correct 190 ms 29736 KB Output is correct
21 Correct 172 ms 29036 KB Output is correct
22 Correct 188 ms 29544 KB Output is correct
23 Correct 191 ms 29552 KB Output is correct
24 Correct 173 ms 29680 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 6 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 6 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 380 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 6 ms 376 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 81 ms 4088 KB Output is correct
26 Correct 18 ms 1016 KB Output is correct
27 Correct 115 ms 5496 KB Output is correct
28 Correct 120 ms 5624 KB Output is correct
29 Correct 78 ms 4088 KB Output is correct
30 Correct 88 ms 3960 KB Output is correct
31 Correct 91 ms 4856 KB Output is correct
32 Correct 120 ms 5624 KB Output is correct
33 Correct 103 ms 5240 KB Output is correct
34 Correct 66 ms 3064 KB Output is correct
35 Correct 117 ms 5496 KB Output is correct
36 Correct 135 ms 5624 KB Output is correct
37 Correct 69 ms 2936 KB Output is correct
38 Correct 124 ms 4728 KB Output is correct
39 Correct 21 ms 1144 KB Output is correct
40 Correct 111 ms 4600 KB Output is correct
41 Correct 84 ms 3576 KB Output is correct
42 Correct 116 ms 4600 KB Output is correct
43 Correct 44 ms 2040 KB Output is correct
44 Correct 112 ms 4600 KB Output is correct
45 Correct 26 ms 1276 KB Output is correct
46 Correct 111 ms 4652 KB Output is correct
47 Correct 33 ms 1656 KB Output is correct
48 Correct 115 ms 4600 KB Output is correct
49 Correct 369 ms 27900 KB Output is correct
50 Correct 413 ms 31100 KB Output is correct
51 Correct 271 ms 21880 KB Output is correct
52 Correct 426 ms 31048 KB Output is correct
53 Correct 170 ms 14460 KB Output is correct
54 Correct 414 ms 30968 KB Output is correct
55 Correct 361 ms 26872 KB Output is correct
56 Correct 415 ms 30956 KB Output is correct
57 Correct 55 ms 5240 KB Output is correct
58 Correct 402 ms 30840 KB Output is correct
59 Correct 234 ms 19448 KB Output is correct
60 Correct 418 ms 30840 KB Output is correct
61 Correct 199 ms 29676 KB Output is correct
62 Correct 193 ms 29620 KB Output is correct
63 Correct 179 ms 29684 KB Output is correct
64 Correct 173 ms 30220 KB Output is correct
65 Correct 196 ms 29868 KB Output is correct
66 Correct 188 ms 30280 KB Output is correct
67 Correct 194 ms 29620 KB Output is correct
68 Correct 190 ms 29736 KB Output is correct
69 Correct 172 ms 29036 KB Output is correct
70 Correct 188 ms 29544 KB Output is correct
71 Correct 191 ms 29552 KB Output is correct
72 Correct 173 ms 29680 KB Output is correct
73 Correct 652 ms 32812 KB Output is correct
74 Correct 449 ms 31608 KB Output is correct
75 Correct 625 ms 27988 KB Output is correct
76 Correct 794 ms 37368 KB Output is correct
77 Correct 409 ms 19064 KB Output is correct
78 Correct 689 ms 35556 KB Output is correct
79 Correct 721 ms 33272 KB Output is correct
80 Correct 812 ms 37496 KB Output is correct
81 Correct 271 ms 10488 KB Output is correct
82 Correct 614 ms 34424 KB Output is correct
83 Correct 586 ms 25592 KB Output is correct
84 Correct 790 ms 37368 KB Output is correct
85 Correct 330 ms 33004 KB Output is correct
86 Correct 430 ms 34868 KB Output is correct
87 Correct 223 ms 30708 KB Output is correct
88 Correct 420 ms 35652 KB Output is correct
89 Correct 381 ms 33964 KB Output is correct
90 Correct 438 ms 35540 KB Output is correct
91 Correct 269 ms 31724 KB Output is correct
92 Correct 439 ms 35048 KB Output is correct
93 Correct 227 ms 30316 KB Output is correct
94 Correct 436 ms 34928 KB Output is correct
95 Correct 256 ms 31216 KB Output is correct
96 Correct 433 ms 35184 KB Output is correct