oj.uz

Submission #235666

# Submission time Handle Problem Language Result Execution time Memory
235666 2020-05-29T09:35:43 Z fedoseevtimofey Two Antennas (JOI19_antennas) C++14
13 / 100
 3000 ms 21928 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;

struct Tree {
  vector <int> t, mx;
  //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) {
      update(2 * v + 1, mod[v]);
      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]);
    }*/
    for (int i = ql; i <= qr; ++i) mx[i] = max(mx[i], t[i] + val);
  }


  void set_(int id, int val, int l, int r, int v) {
    /*if (l == r) {
      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]);
    }*/
    t[id] = val;
  }

  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));*/
    int ret = -Inf;
    for (int i = ql; i <= qr; ++i) ret = max(ret, mx[i]);
    return ret;
  }
  
  Tree() {
    /*fill(t, t + 4 * N, -Inf);
    fill(mx, mx + 4 * N, -Inf);
    fill(mod, mod + 4 * N, -Inf);*/
    t.resize(N, -Inf);
    mx.resize(N, -Inf);
  }
};

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 <vector <pair <int, int>>> who(n);
  vector <int> ans(q, -1);
  for (int i = 0; i < q; ++i) {
    int ql, qr;
    cin >> ql >> qr;
    --ql, --qr;
    who[qr].emplace_back(ql, 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 pos, neg;

  for (int i = 0; i < n; ++i) {
    for (int id : add[i]) {
      pos.set_(id, h[id], 0, n - 1, 0);
      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);
      pos.modify(l, r, -h[i], 0, n - 1, 0);
    }
    for (auto p : who[i]) {
      ans[p.second] = max(ans[p.second], pos.get(p.first, i, 0, n - 1, 0));
      ans[p.second] = max(ans[p.second], neg.get(p.first, i, 0, n - 1, 0));
    }
    for (int id : del[i]) {
      pos.set_(id, -Inf, 0, n - 1, 0);
      neg.set_(id, -Inf, 0, n - 1, 0);
    }
  }
  for (int i = 0; i < q; ++i) {
    cout << ans[i] << '\n';
  }
}

Subtask #1
2.0 / 2.0

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 3456 KB Output is correct
2 Correct 7 ms 3712 KB Output is correct
3 Correct 6 ms 3584 KB Output is correct
4 Correct 7 ms 3584 KB Output is correct
5 Correct 6 ms 3584 KB Output is correct
6 Correct 7 ms 3508 KB Output is correct
7 Correct 7 ms 3584 KB Output is correct
8 Correct 6 ms 3584 KB Output is correct
9 Correct 6 ms 3456 KB Output is correct
10 Correct 7 ms 3584 KB Output is correct
11 Correct 6 ms 3456 KB Output is correct
12 Correct 7 ms 3584 KB Output is correct
13 Correct 6 ms 3456 KB Output is correct
14 Correct 8 ms 3584 KB Output is correct
15 Correct 7 ms 3584 KB Output is correct
16 Correct 6 ms 3584 KB Output is correct
17 Correct 7 ms 3636 KB Output is correct
18 Correct 7 ms 3456 KB Output is correct
19 Correct 6 ms 3456 KB Output is correct
20 Correct 7 ms 3584 KB Output is correct
21 Correct 7 ms 3456 KB Output is correct
22 Correct 7 ms 3456 KB Output is correct
23 Correct 6 ms 3456 KB Output is correct
24 Correct 7 ms 3456 KB Output is correct
25 Correct 125 ms 7800 KB Output is correct
26 Correct 30 ms 4216 KB Output is correct
27 Correct 259 ms 10360 KB Output is correct
28 Correct 298 ms 10416 KB Output is correct
29 Correct 130 ms 8312 KB Output is correct
30 Correct 199 ms 8184 KB Output is correct
31 Correct 92 ms 9464 KB Output is correct
32 Correct 301 ms 10360 KB Output is correct
33 Correct 195 ms 9852 KB Output is correct
34 Correct 147 ms 6904 KB Output is correct
35 Correct 237 ms 10232 KB Output is correct
36 Correct 303 ms 10488 KB Output is correct
37 Correct 170 ms 7032 KB Output is correct
38 Correct 299 ms 9592 KB Output is correct
39 Correct 46 ms 4472 KB Output is correct
40 Correct 294 ms 9476 KB Output is correct
41 Correct 210 ms 7928 KB Output is correct
42 Correct 288 ms 9464 KB Output is correct
43 Correct 100 ms 5624 KB Output is correct
44 Correct 297 ms 9592 KB Output is correct
45 Correct 55 ms 4728 KB Output is correct
46 Correct 292 ms 9592 KB Output is correct
47 Correct 78 ms 5240 KB Output is correct
48 Correct 292 ms 9636 KB Output is correct

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3060 ms 21928 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 3456 KB Output is correct
2 Correct 7 ms 3712 KB Output is correct
3 Correct 6 ms 3584 KB Output is correct
4 Correct 7 ms 3584 KB Output is correct
5 Correct 6 ms 3584 KB Output is correct
6 Correct 7 ms 3508 KB Output is correct
7 Correct 7 ms 3584 KB Output is correct
8 Correct 6 ms 3584 KB Output is correct
9 Correct 6 ms 3456 KB Output is correct
10 Correct 7 ms 3584 KB Output is correct
11 Correct 6 ms 3456 KB Output is correct
12 Correct 7 ms 3584 KB Output is correct
13 Correct 6 ms 3456 KB Output is correct
14 Correct 8 ms 3584 KB Output is correct
15 Correct 7 ms 3584 KB Output is correct
16 Correct 6 ms 3584 KB Output is correct
17 Correct 7 ms 3636 KB Output is correct
18 Correct 7 ms 3456 KB Output is correct
19 Correct 6 ms 3456 KB Output is correct
20 Correct 7 ms 3584 KB Output is correct
21 Correct 7 ms 3456 KB Output is correct
22 Correct 7 ms 3456 KB Output is correct
23 Correct 6 ms 3456 KB Output is correct
24 Correct 7 ms 3456 KB Output is correct
25 Correct 125 ms 7800 KB Output is correct
26 Correct 30 ms 4216 KB Output is correct
27 Correct 259 ms 10360 KB Output is correct
28 Correct 298 ms 10416 KB Output is correct
29 Correct 130 ms 8312 KB Output is correct
30 Correct 199 ms 8184 KB Output is correct
31 Correct 92 ms 9464 KB Output is correct
32 Correct 301 ms 10360 KB Output is correct
33 Correct 195 ms 9852 KB Output is correct
34 Correct 147 ms 6904 KB Output is correct
35 Correct 237 ms 10232 KB Output is correct
36 Correct 303 ms 10488 KB Output is correct
37 Correct 170 ms 7032 KB Output is correct
38 Correct 299 ms 9592 KB Output is correct
39 Correct 46 ms 4472 KB Output is correct
40 Correct 294 ms 9476 KB Output is correct
41 Correct 210 ms 7928 KB Output is correct
42 Correct 288 ms 9464 KB Output is correct
43 Correct 100 ms 5624 KB Output is correct
44 Correct 297 ms 9592 KB Output is correct
45 Correct 55 ms 4728 KB Output is correct
46 Correct 292 ms 9592 KB Output is correct
47 Correct 78 ms 5240 KB Output is correct
48 Correct 292 ms 9636 KB Output is correct
49 Execution timed out 3060 ms 21928 KB Time limit exceeded
50 Halted 0 ms 0 KB -