Submission #496107

#	Time	Username	Problem	Language	Result	Execution time	Memory
496107		shmad	Divide and conquer (IZhO14_divide)	C++17	100 / 100	37 ms	3460 KiB

divide

#include <bits/stdc++.h>
 
#define int long long
#define vt vector
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define ff first
#define ss second
#define dbg(x) cerr << #x << " = " << x << '\n'
 
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vvi = vt< vt<int> >;
 
const int N = 1e6 + 5, mod = 1e9 + 7, inf = 1e18 + 7, B = 500, LIM = (1ll << 20);
const double eps = 1e-6;
 
bool check (int a, int b, int c) {
	return (a <= b - c);
}
 
void solve () {
	int n;
	cin >> n;
	vt<int> x(n + 1), g(n + 1), d(n + 1), p(n + 1, inf);
	for (int i = 1; i <= n; i++) cin >> x[i] >> g[i] >> d[i];
	partial_sum(all(g), g.begin());
	partial_sum(all(d), d.begin());
	for (int i = 1; i <= n; i++) p[i] = min(p[i - 1], d[i - 1] - x[i]);
	int ans = 0;
	for (int i = 1; i <= n; i++) {
		int l = 0;
		for (int mid = LIM; mid ; mid >>= 1) if (l + mid <= i && !check(p[l + mid], d[i], x[i])) l += mid;
		l++;
		ans = max(ans, g[i] - g[l - 1]);
	}
	cout << ans;
	cout << '\n';
}
 
bool testcases = 0;
 
signed main() {
    cin.tie(0) -> sync_with_stdio(0);
    int test = 1;
    if (testcases) cin >> test;
    for (int cs = 1; cs <= test; cs++) {
        solve();
    }
}

• Subtask 1: 17 / 17
• Subtask 2: 31 / 31
• Subtask 3: 52 / 52