Submission #1042100

#	Time	Username	Problem	Language	Result	Execution time	Memory
1042100		Minbaev	Divide and conquer (IZhO14_divide)	C++17	17 / 100	1 ms	348 KiB

divide

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
 
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("Ofast,unroll-loops")
 
using namespace std;
using namespace __gnu_pbds;
 
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define f first
#define s second
#define int long long
#define pii pair<int,int>
#define ar array
 
template<class T>bool umax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<class T>bool umin(T &a,T b){if(b<a){a=b;return true;}return false;}
 
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
 tree_order_statistics_node_update> ordered_set;
 
const int inf = 1e17 + 7;
const int mod = 1e9 + 7;
const int N = 3e5 + 5;
const int md = 998244353;

int binpow(int a, int b){
	if(b == 0)return 1;
	if(b % 2 == 0){
		int c = binpow(a,b/2);
		return (c*c)%mod;
	}
	return (binpow(a,b-1)*a)%mod;
}

int divi(int a, int b){
	return (a*(binpow(b,mod-2)))%mod;
}

int n,m,k;

void solve(){
	
	cin >> n;
	
	vector<array<int,3>>v(n);
	for(auto &to:v){
		cin >> to[0] >> to[1] >> to[2];
	}
	
	int ans = 0, sum = 0, time = 0;
	int l = 0, r = 0;
	while(r < n && l <= r){
		sum += v[r][1];
		time += v[r][2];
		
		if(time >= (v[r][0]-v[l][0])){
			umax(ans, sum);
			r += 1;
		}
		else{
			while(time < (v[r][0]-v[l][0]) && l < n){
				sum -= v[l][1];
				time -= v[l][2];
				l += 1;	
			}
			if(time >= (v[r][0]-v[l][0])){
				umax(ans, sum);
			}
			r += 1;
		}
		
	}
	
	cout << ans << "\n";
	
}
/*

*/
 signed main()
{
//	freopen("seq.in", "r", stdin);
//  freopen("seq.out", "w", stdout);
	ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
	int tt=1;//cin>>tt;
	while(tt--)solve();
 
}
 

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