oj.uz

답안 #523240

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
523240 2022-02-07T09:09:40 Z boykut 금 캐기 (IZhO14_divide) C++14
100 / 100
 206 ms 149828 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef tree<int, null_type, less<int>,
rb_tree_tag, tree_order_statistics_node_update> ordered_set;

const long long INF = 1e18, Lim = 1e14;

struct segment_tree {
	long long v, vl, vr;
	segment_tree * left, * right;
	segment_tree(long long l, long long r) {
		vl = l, vr = r;
		v = INF;
		left = right = NULL;
	}
	void update(long long i, long long x) {
		if (vl == vr) {
			v = min(v, x);
		} else {
			long long vm = vl + (vr - vl) / 2;
			if (i <= vm) {
				if (left == NULL) left = new segment_tree(vl, vm);
				left->update(i, x);
			} else {
				if (right == NULL) right = new segment_tree(vm + 1, vr);
				right->update(i, x);
			}
			v = min((left != NULL ? left->v : INF), (right != NULL ? right->v : INF));
		}
	}
	long long query(long long l, long long r) {
		if (l > vr || vl > r) return INF;
		if (l <= vl && vr <= r) return v;
		long long vm = vl + (vr - vl) / 2;
		auto L = (left != NULL ? left->query(l, r) : INF);
		auto R = (right != NULL ? right->query(l, r) : INF);
		return min(L, R);
	}
};

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

	segment_tree st(-Lim, Lim);

	int n;
	cin >> n;
	vector<int> x(1 + n), g(1 + n), d(1 + n);
	for (int i = 1; i <= n; i++) {
		cin >> x[i] >> g[i] >> d[i];
	}
	vector<long long> pd(1 + n, 0), pg(1 + n, 0), PG(1 + n, 0);
	for (int i = 1; i <= n; i++) {
		pd[i] = d[i] + pd[i - 1];
		pg[i] = g[i] + pg[i - 1];
	}

	long long ans = 0;
	for (int r = 1; r <= n; r++) {
		st.update(pd[r - 1] - x[r], pg[r - 1]);
		ans = max(ans, pg[r] - st.query(-Lim, pd[r] - x[r]));
	}
	cout << ans << '\n';

	return 0;
}

Compilation message

divide.cpp: In member function 'long long int segment_tree::query(long long int, long long int)':
divide.cpp:39:13: warning: unused variable 'vm' [-Wunused-variable]
   39 |   long long vm = vl + (vr - vl) / 2;
      |             ^~

Subtask #1
17.0 / 17.0

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

Subtask #2
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 236 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 716 KB Output is correct
16 Correct 2 ms 972 KB Output is correct
17 Correct 2 ms 1100 KB Output is correct
18 Correct 3 ms 1996 KB Output is correct
19 Correct 2 ms 1228 KB Output is correct
20 Correct 2 ms 1228 KB Output is correct
21 Correct 2 ms 844 KB Output is correct
22 Correct 2 ms 1228 KB Output is correct
23 Correct 9 ms 4812 KB Output is correct
24 Correct 8 ms 4812 KB Output is correct

Subtask #3
52.0 / 52.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 236 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 716 KB Output is correct
16 Correct 2 ms 972 KB Output is correct
17 Correct 2 ms 1100 KB Output is correct
18 Correct 3 ms 1996 KB Output is correct
19 Correct 2 ms 1228 KB Output is correct
20 Correct 2 ms 1228 KB Output is correct
21 Correct 2 ms 844 KB Output is correct
22 Correct 2 ms 1228 KB Output is correct
23 Correct 9 ms 4812 KB Output is correct
24 Correct 8 ms 4812 KB Output is correct
25 Correct 5 ms 2636 KB Output is correct
26 Correct 13 ms 5588 KB Output is correct
27 Correct 20 ms 10028 KB Output is correct
28 Correct 79 ms 49860 KB Output is correct
29 Correct 85 ms 51180 KB Output is correct
30 Correct 206 ms 149828 KB Output is correct
31 Correct 156 ms 101924 KB Output is correct
32 Correct 168 ms 101952 KB Output is correct
33 Correct 113 ms 52536 KB Output is correct
34 Correct 102 ms 35060 KB Output is correct
35 Correct 142 ms 73916 KB Output is correct
36 Correct 141 ms 72916 KB Output is correct