Submission #828399

#	Time	Username	Problem	Language	Result	Execution time	Memory
828399		NhanBeoo	Divide and conquer (IZhO14_divide)	C++17	48 / 100	1084 ms	2516 KiB

divide

// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")

#include <bits/stdc++.h>
using namespace std;

#define int ll
#define MAX LLONG_MAX
#define st first
#define nd second
#define endl '\n'
#define SZ(x) ((int)x.size())
#define ALL(x) x.begin(), x.end()
typedef long long ll;
typedef pair< int, int > ii;
typedef pair< int, ii > iii;
typedef vector< int > vi;
typedef vector< ii > vii;
typedef vector< iii > viii;
typedef vector< vi > vvi;
typedef vector< vii > vvii;
typedef vector< viii > vviii;

const int N = 1e5 + 5;
int x[N], g[N], e[N];

void sol(){
    int n; cin >> n;
    for(int i=1; i<=n; i++){
    	cin >> x[i] >> g[i] >> e[i];
    	g[i] += g[i-1];
    	e[i] += e[i-1];
	}
	int ans = 0;
	for(int i=1; i<=n; i++){
		for(int j=i; j<=n; j++){
			if(e[j] - e[i-1] >= x[j] - x[i]){
				ans = max(ans, g[j] - g[i-1]);
			}
		}
	}
	cout << ans;
}

signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);

    int t = 1;
    // cin >> t;
    while(t--) sol();
}

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