Submission #340620

#	Time	Username	Problem	Language	Result	Execution time	Memory
340620		tengiz05	Divide and conquer (IZhO14_divide)	C++17	48 / 100	1091 ms	2400 KiB

divide

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL);
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define PI acos(-1)
#define ld long double
template<class T> bool chmin(T& a, const T& b) {return a>b? a=b, true:false;}
template<class T> bool chmax(T& a, const T& b) {return a<b? a=b, true:false;}
const int mod = 1e9+7, N = 2e5+5;
int msb(int val){return sizeof(int)*8-__builtin_clzll(val)-1;}
int a[N], n, m, k;
int pr[N];
int prg[N];
void solve(int test_case){
	int i, j;
	vector<tuple<int, int, int>> v;
	cin >> n;
	v.pb(make_tuple(0,0,0));
	for(i=0;i<n;i++){
		int x, g, d;
		cin >> x >> g >> d;
		v.pb(make_tuple(x, g, d));
	}
	sort(all(v));
	for(i=1;i<=n;i++){
		pr[i] = pr[i-1] + get<2>(v[i]);
		prg[i] = prg[i-1] + get<1>(v[i]);
	}
	int ans = 0;
	for(i=1;i<=n;i++){
		for(j=i;j<=n;j++){
			if(get<0>(v[j]) - get<0>(v[i]) <= pr[j]-pr[i-1])
				chmax(ans, prg[j] - prg[i-1]);
		}
	}
	cout << ans << '\n';
	return;
}

signed main(){
	FASTIO;
#define MULTITEST 0
#if MULTITEST
	int _T;
	cin >> _T;
	for(int T_CASE = 1; T_CASE <= _T; T_CASE++)
		solve(T_CASE);
#else
	solve(1);
#endif
	return 0;
}

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