oj.uz

답안 #585664

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
585664 2022-06-29T07:59:29 Z Shin 금 캐기 (IZhO14_divide) C++14
100 / 100
 52 ms 8628 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define all(x) x.begin(), x.end()

using namespace std;
template <class X, class Y> bool minimize(X &a, Y b) {
    if (a > b) return a = b, true;
    return false;
}
template <class X, class Y> bool maximize(X &a, Y b) {
    if (a < b) return a = b, true;
    return false;
}

struct items {
  int x;
  long long g, d;
  items() {
    d = g = x = 0;
  }
};

struct segment_tree {
  vector<long long> mx;
  int n;
  segment_tree(int _n) : n(_n) {
    mx.assign((n << 2) + 7, -(long long) 1e18);
  }
  void modify(int id, int l, int r, int p, long long v) {
    if (l > p || r < p) {
      return;
    }
    if (l == r) {
      mx[id] = v;
    } else {
      int mid = (l + r) >> 1;
      modify(id << 1, l, mid, p, v);
      modify(id << 1|1, mid + 1, r, p, v);
      mx[id] = max(mx[id << 1], mx[id << 1|1]);
    }
  }
  int get(int id, int l, int r, long long k) {
    if (l == r) {
      return (mx[id] < k ? -1: l);
    }
    int mid = (l + r) >> 1;
    if (mx[id << 1] >= k) {
      return get(id << 1, l, mid, k);
    }
    return get(id << 1|1, mid + 1, r, k);
  }
  void modify(int p, int v) {
    modify(1, 1, n, p, v);
  }
  int get(long long k) {
    return get(1, 1, n, k);
  }
};
const int N = 1e5 + 7;
int n;
items a[N];

signed main() {
  cin.tie(0)->sync_with_stdio(0);
  cin >> n;
  for (int i = 1; i <= n; i ++) {
    cin >> a[i].x >> a[i].g >> a[i].d;
    a[i].g += a[i - 1].g;
    a[i].d += a[i - 1].d;
  }
  long long res = 0;
  segment_tree st(n);
  for (int i = 1; i <= n; i ++) {
    st.modify(i, a[i].x - a[i - 1].d);
    int pos = st.get(a[i].x - a[i].d);
    if (pos != -1) {
      maximize(res, a[i].g - a[pos - 1].g);
    }
  }
  cout << res;
  return 0;
}

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct

Subtask #2
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 1 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2684 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 2 ms 2644 KB Output is correct
20 Correct 2 ms 2644 KB Output is correct
21 Correct 2 ms 2684 KB Output is correct
22 Correct 2 ms 2644 KB Output is correct
23 Correct 4 ms 2900 KB Output is correct
24 Correct 4 ms 2920 KB Output is correct

Subtask #3
52.0 / 52.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 1 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2684 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 2 ms 2644 KB Output is correct
20 Correct 2 ms 2644 KB Output is correct
21 Correct 2 ms 2684 KB Output is correct
22 Correct 2 ms 2644 KB Output is correct
23 Correct 4 ms 2900 KB Output is correct
24 Correct 4 ms 2920 KB Output is correct
25 Correct 4 ms 2900 KB Output is correct
26 Correct 5 ms 3028 KB Output is correct
27 Correct 5 ms 3156 KB Output is correct
28 Correct 21 ms 5208 KB Output is correct
29 Correct 21 ms 5492 KB Output is correct
30 Correct 43 ms 8628 KB Output is correct
31 Correct 35 ms 7520 KB Output is correct
32 Correct 35 ms 7548 KB Output is correct
33 Correct 35 ms 7384 KB Output is correct
34 Correct 40 ms 7396 KB Output is correct
35 Correct 52 ms 7984 KB Output is correct
36 Correct 41 ms 8012 KB Output is correct