Submission #684418

# Submission time Handle Problem Language Result Execution time Memory
684418 2023-01-21T06:31:03 Z pragmatist Divide and conquer (IZhO14_divide) C++17
100 / 100
84 ms 14588 KB
/*
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
#pragma GCC target ("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
*/

#include<bits/stdc++.h>
 
#define sz(v) (int)v.size()
#define ll long long
#define pb push_back
#define x first
#define y second
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define nl "\n"

using namespace std;

const int N = (int)1e5 + 7; // make sure this is right
const int M = (int)1e3 + 7;
const int inf = (int)2e9 + 7;
const ll INF = (ll)3e18 + 7; 
const ll MOD = (ll)1e9 + 7; // make sure this is right

bool bit(int x, int i) {
	return x >> i & 1;
}

int sum(int x, int y) {
	x += y;
	if(x >= MOD) x -= MOD;
	return x;
}

pair<int, int> dir[] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};

int n, x[N], g[N], d[N];
int a[N], b[N];
ll p[N], w[N], t[8 * N];

void upd(int v, int tl, int tr, int i, ll x) {
	if(tl == tr) {
		t[v] = min(t[v], x);
		return;
	}
	int mid = (tl + tr) >> 1;
	if(i <= mid)
		upd(v * 2, tl, mid, i, x);
	else
		upd(v * 2 + 1, mid + 1, tr, i, x);
	t[v] = min(t[v * 2], t[v * 2 + 1]);	
}

ll get(int v, int tl, int tr, int l, int r) {
	if(tl >= l && tr <= r)
		return t[v];
	if(tl > r || l > tr || l > r)
		return INF;
	int mid = (tl + tr) >> 1;
	return min(get(v * 2, tl, mid, l, r), get(v * 2 + 1, mid + 1, tr, l, r));	
}

void compress() {
	vector<ll> v;
	for(int i = 1; i <= n; ++i) {
		v.pb(p[i] - x[i]);
		v.pb(p[i - 1] - x[i]);
	}
	sort(all(v));
	v.erase(unique(all(v)), v.end());
	for(int  i = 1; i <= n; ++i) {
		a[i] = lower_bound(all(v), p[i] - x[i]) - v.begin();
		b[i] = lower_bound(all(v), p[i - 1] - x[i]) - v.begin();
	}
}

void solve() {
	cin >> n;
	for(int i = 1; i <= n; ++i) {
		cin >> x[i] >> g[i] >> d[i];
		p[i] = p[i - 1] + d[i];
		w[i] = w[i - 1] + g[i];
	}	
	fill(t, t + 8 * N, INF);
	compress();
	ll ans = 0;
	for(int i = 1; i <= n; ++i) {
		upd(1, 1, n + n, b[i], w[i - 1]);				
		ans = max(ans, w[i] - get(1, 1, n + n, 1, a[i]));
	}
	cout << ans << "\n";
}

signed main() {	
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int test = 1;
	//cin >> test;
	for(int i = 1; i <= test; ++i) {
	 	//cout << "Case #" << i << ": ";
		solve();
	}
	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 3 ms 6612 KB Output is correct
2 Correct 3 ms 6612 KB Output is correct
3 Correct 3 ms 6612 KB Output is correct
4 Correct 3 ms 6612 KB Output is correct
5 Correct 3 ms 6612 KB Output is correct
6 Correct 3 ms 6612 KB Output is correct
7 Correct 4 ms 6612 KB Output is correct
8 Correct 4 ms 6600 KB Output is correct
9 Correct 4 ms 6612 KB Output is correct
10 Correct 4 ms 6612 KB Output is correct
11 Correct 3 ms 6612 KB Output is correct
12 Correct 3 ms 6612 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 6612 KB Output is correct
2 Correct 3 ms 6612 KB Output is correct
3 Correct 3 ms 6612 KB Output is correct
4 Correct 3 ms 6612 KB Output is correct
5 Correct 3 ms 6612 KB Output is correct
6 Correct 3 ms 6612 KB Output is correct
7 Correct 4 ms 6612 KB Output is correct
8 Correct 4 ms 6600 KB Output is correct
9 Correct 4 ms 6612 KB Output is correct
10 Correct 4 ms 6612 KB Output is correct
11 Correct 3 ms 6612 KB Output is correct
12 Correct 3 ms 6612 KB Output is correct
13 Correct 3 ms 6612 KB Output is correct
14 Correct 3 ms 6612 KB Output is correct
15 Correct 3 ms 6612 KB Output is correct
16 Correct 4 ms 6612 KB Output is correct
17 Correct 4 ms 6612 KB Output is correct
18 Correct 3 ms 6612 KB Output is correct
19 Correct 3 ms 6612 KB Output is correct
20 Correct 3 ms 6612 KB Output is correct
21 Correct 4 ms 6612 KB Output is correct
22 Correct 4 ms 6752 KB Output is correct
23 Correct 6 ms 6996 KB Output is correct
24 Correct 6 ms 6972 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 6612 KB Output is correct
2 Correct 3 ms 6612 KB Output is correct
3 Correct 3 ms 6612 KB Output is correct
4 Correct 3 ms 6612 KB Output is correct
5 Correct 3 ms 6612 KB Output is correct
6 Correct 3 ms 6612 KB Output is correct
7 Correct 4 ms 6612 KB Output is correct
8 Correct 4 ms 6600 KB Output is correct
9 Correct 4 ms 6612 KB Output is correct
10 Correct 4 ms 6612 KB Output is correct
11 Correct 3 ms 6612 KB Output is correct
12 Correct 3 ms 6612 KB Output is correct
13 Correct 3 ms 6612 KB Output is correct
14 Correct 3 ms 6612 KB Output is correct
15 Correct 3 ms 6612 KB Output is correct
16 Correct 4 ms 6612 KB Output is correct
17 Correct 4 ms 6612 KB Output is correct
18 Correct 3 ms 6612 KB Output is correct
19 Correct 3 ms 6612 KB Output is correct
20 Correct 3 ms 6612 KB Output is correct
21 Correct 4 ms 6612 KB Output is correct
22 Correct 4 ms 6752 KB Output is correct
23 Correct 6 ms 6996 KB Output is correct
24 Correct 6 ms 6972 KB Output is correct
25 Correct 6 ms 6996 KB Output is correct
26 Correct 8 ms 7256 KB Output is correct
27 Correct 9 ms 7256 KB Output is correct
28 Correct 33 ms 9216 KB Output is correct
29 Correct 36 ms 10572 KB Output is correct
30 Correct 68 ms 14588 KB Output is correct
31 Correct 62 ms 13528 KB Output is correct
32 Correct 84 ms 13508 KB Output is correct
33 Correct 75 ms 13432 KB Output is correct
34 Correct 64 ms 13328 KB Output is correct
35 Correct 63 ms 13892 KB Output is correct
36 Correct 68 ms 14088 KB Output is correct