oj.uz

Submission #235661

# Submission time Handle Problem Language Result Execution time Memory
235661 2020-05-29T09:17:05 Z fedoseevtimofey Two Antennas (JOI19_antennas) C++14
24 / 100
 3000 ms 26612 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 {
  int t[4 * N];
  
  void modify(int id, int val, int l, int r, int v) {
    if (l == r) {
      t[v] = val;
    } else {
      int m = (l + r) >> 1;
      if (id <= m) modify(id, val, l, m, 2 * v + 1);
      else modify(id, val, m + 1, r, 2 * v + 2);
      t[v] = max(t[2 * v + 1], t[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 t[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);
  }
};

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;
  while (q--) {
    int ql, qr;
    cin >> ql >> qr;
    --ql, --qr;
    vector <vector <int>> add(n), del(n);
    for (int i = ql; i <= qr; ++i) {
      //add[max(0, i - b[i])].push_back(i);
      //del[max(0, i - a[i])].push_back(i);
      int l = i + a[i], r = i + b[i];
      r = min(r, qr);
      if (l <= r) {
        add[l].push_back(i);
        del[r].push_back(i);
      }
    }
    Tree pos, neg;
    int ans = -1;
    for (int i = ql; i <= qr; ++i) {
      for (int id : add[i]) {
        pos.modify(id, h[id], 0, n - 1, 0);
        neg.modify(id, -h[id], 0, n - 1, 0);
      }
      int l = max(ql, i - b[i]);
      int r = i - a[i];
      if (l <= r) {
        ans = max(ans, h[i] + neg.get(l, r, 0, n - 1, 0));
        ans = max(ans, -h[i] + pos.get(l, r, 0, n - 1, 0));
      }
      for (int id : del[i]) {
        pos.modify(id, -Inf, 0, n - 1, 0);
        neg.modify(id, -Inf, 0, n - 1, 0);
      }
    }
    cout << ans << '\n';
  }
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 6656 KB Output is correct
2 Correct 130 ms 6656 KB Output is correct
3 Correct 213 ms 6776 KB Output is correct
4 Correct 226 ms 6776 KB Output is correct
5 Correct 99 ms 6656 KB Output is correct
6 Correct 108 ms 6656 KB Output is correct
7 Correct 218 ms 6776 KB Output is correct
8 Correct 222 ms 6656 KB Output is correct
9 Correct 205 ms 6656 KB Output is correct
10 Correct 184 ms 6776 KB Output is correct
11 Correct 210 ms 6776 KB Output is correct
12 Correct 217 ms 6656 KB Output is correct
13 Correct 118 ms 6656 KB Output is correct
14 Correct 207 ms 6776 KB Output is correct
15 Correct 132 ms 6776 KB Output is correct
16 Correct 202 ms 6656 KB Output is correct
17 Correct 166 ms 6656 KB Output is correct
18 Correct 206 ms 6656 KB Output is correct
19 Correct 23 ms 6656 KB Output is correct
20 Correct 205 ms 6776 KB Output is correct
21 Correct 205 ms 6656 KB Output is correct
22 Correct 238 ms 6656 KB Output is correct
23 Correct 187 ms 6656 KB Output is correct
24 Correct 214 ms 6656 KB Output is correct

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 6656 KB Output is correct
2 Correct 130 ms 6656 KB Output is correct
3 Correct 213 ms 6776 KB Output is correct
4 Correct 226 ms 6776 KB Output is correct
5 Correct 99 ms 6656 KB Output is correct
6 Correct 108 ms 6656 KB Output is correct
7 Correct 218 ms 6776 KB Output is correct
8 Correct 222 ms 6656 KB Output is correct
9 Correct 205 ms 6656 KB Output is correct
10 Correct 184 ms 6776 KB Output is correct
11 Correct 210 ms 6776 KB Output is correct
12 Correct 217 ms 6656 KB Output is correct
13 Correct 118 ms 6656 KB Output is correct
14 Correct 207 ms 6776 KB Output is correct
15 Correct 132 ms 6776 KB Output is correct
16 Correct 202 ms 6656 KB Output is correct
17 Correct 166 ms 6656 KB Output is correct
18 Correct 206 ms 6656 KB Output is correct
19 Correct 23 ms 6656 KB Output is correct
20 Correct 205 ms 6776 KB Output is correct
21 Correct 205 ms 6656 KB Output is correct
22 Correct 238 ms 6656 KB Output is correct
23 Correct 187 ms 6656 KB Output is correct
24 Correct 214 ms 6656 KB Output is correct
25 Execution timed out 3070 ms 7180 KB Time limit exceeded
26 Halted 0 ms 0 KB -

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 230 ms 24564 KB Output is correct
2 Correct 269 ms 26612 KB Output is correct
3 Correct 162 ms 20600 KB Output is correct
4 Correct 234 ms 26612 KB Output is correct
5 Correct 103 ms 15836 KB Output is correct
6 Correct 230 ms 26612 KB Output is correct
7 Correct 209 ms 23924 KB Output is correct
8 Correct 253 ms 26612 KB Output is correct
9 Correct 38 ms 9720 KB Output is correct
10 Correct 235 ms 26612 KB Output is correct
11 Correct 145 ms 19192 KB Output is correct
12 Correct 249 ms 26612 KB Output is correct
13 Correct 152 ms 23924 KB Output is correct
14 Correct 148 ms 24096 KB Output is correct
15 Correct 153 ms 24056 KB Output is correct
16 Correct 139 ms 24700 KB Output is correct
17 Correct 159 ms 24180 KB Output is correct
18 Correct 148 ms 24696 KB Output is correct
19 Correct 152 ms 23760 KB Output is correct
20 Correct 150 ms 24132 KB Output is correct
21 Correct 158 ms 23768 KB Output is correct
22 Correct 161 ms 24228 KB Output is correct
23 Correct 153 ms 23924 KB Output is correct
24 Correct 138 ms 24052 KB Output is correct

Subtask #4
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 6656 KB Output is correct
2 Correct 130 ms 6656 KB Output is correct
3 Correct 213 ms 6776 KB Output is correct
4 Correct 226 ms 6776 KB Output is correct
5 Correct 99 ms 6656 KB Output is correct
6 Correct 108 ms 6656 KB Output is correct
7 Correct 218 ms 6776 KB Output is correct
8 Correct 222 ms 6656 KB Output is correct
9 Correct 205 ms 6656 KB Output is correct
10 Correct 184 ms 6776 KB Output is correct
11 Correct 210 ms 6776 KB Output is correct
12 Correct 217 ms 6656 KB Output is correct
13 Correct 118 ms 6656 KB Output is correct
14 Correct 207 ms 6776 KB Output is correct
15 Correct 132 ms 6776 KB Output is correct
16 Correct 202 ms 6656 KB Output is correct
17 Correct 166 ms 6656 KB Output is correct
18 Correct 206 ms 6656 KB Output is correct
19 Correct 23 ms 6656 KB Output is correct
20 Correct 205 ms 6776 KB Output is correct
21 Correct 205 ms 6656 KB Output is correct
22 Correct 238 ms 6656 KB Output is correct
23 Correct 187 ms 6656 KB Output is correct
24 Correct 214 ms 6656 KB Output is correct
25 Execution timed out 3070 ms 7180 KB Time limit exceeded
26 Halted 0 ms 0 KB -