oj.uz

Submission #590692

# Submission time Handle Problem Language Result Execution time Memory
590692 2022-07-06T08:47:44 Z fuad27 Divide and conquer (IZhO14_divide) C++17
100 / 100
 133 ms 11752 KB 
/*
 * Created: 2022-07-06 11:21
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;
using namespace chrono;
// using namespace atcoder

template <typename T>
using ordered_set =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;
const ll inf = 1e18;

#define pii		pair<int,int>
#define pll		pair<ll,ll>
#define vi		vector<int>
#define vll		vector<ll>
#define rep(i, a, b)	for(int i = (a);i<(b);i++)
#define repn(i, a, b)	for(int i = (a);i>=(b);i--)
#define ss		second
#define ff		first
#define mkp		make_pair
#define pb		push_back

#define all(x)		(x).begin(), (x).end()
const int N = 100010;
long long g[N];
long long d[N];
long long x[N];

long long dv(int l, int r) {
	if(l == r) {
		return g[l];
	}
	ll ans2 = 0;
	int mid = (l+r)/2;
	map<ll, ll> mp;
	int prev = x[mid+1];
	long long sumg=0;
	long long sum=0;
	for(int i = mid+1;i<=r;i++) {
		sum+=d[i];
		sumg+=g[i];
		mp[sum-(x[i]-prev)]=sumg+1;
	}
	for(auto i = mp.rbegin();i!=mp.rend();++i) {
		auto it = i;
		++it;
		if(it!=mp.rend()) {
			(*it).second=max((*i).second, (*it).second);
		}
	}
	long long ans = 0;
	sumg=0;
	sum=0;
	prev=x[mid+1];
	for(int i = mid;i>=l;i--) {
		sum+=d[i];
		sumg+=g[i];
		auto it = mp.lower_bound(-sum+(prev-x[i]));
		if(it==mp.end())continue;
		ans=max(ans, sumg+(*it).second-1);
	}
	ans2=max(dv(l, mid), dv(mid+1, r));
	return max(ans2, ans);
}
void solve() {
	int n;
	cin >> n;
	for(int i = 0;i<n;i++) {
		cin >> x[i] >> g[i] >> d[i];
	}
	cout << dv(0, n-1) << "\n";
}

int main () {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int t = 1;
	while(t--) {
		solve();
	}
	return 0;
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 328 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 328 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 2 ms 388 KB Output is correct
22 Correct 2 ms 596 KB Output is correct
23 Correct 4 ms 856 KB Output is correct
24 Correct 4 ms 852 KB Output is correct

Subtask #3
52.0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 328 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 2 ms 388 KB Output is correct
22 Correct 2 ms 596 KB Output is correct
23 Correct 4 ms 856 KB Output is correct
24 Correct 4 ms 852 KB Output is correct
25 Correct 4 ms 724 KB Output is correct
26 Correct 8 ms 1232 KB Output is correct
27 Correct 9 ms 1384 KB Output is correct
28 Correct 49 ms 5652 KB Output is correct
29 Correct 52 ms 5928 KB Output is correct
30 Correct 121 ms 11752 KB Output is correct
31 Correct 109 ms 10640 KB Output is correct
32 Correct 103 ms 10700 KB Output is correct
33 Correct 97 ms 10484 KB Output is correct
34 Correct 133 ms 10332 KB Output is correct
35 Correct 110 ms 11056 KB Output is correct
36 Correct 100 ms 11220 KB Output is correct