oj.uz

Submission #340796

# Submission time Handle Problem Language Result Execution time Memory
340796 2020-12-28T11:17:27 Z amunduzbaev Divide and conquer (IZhO14_divide) C++14
100 / 100
 40 ms 5868 KB 
/** made by amunduzbaev **/
 
#include <bits/stdc++.h>
using namespace std;
 
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vll vector<ll>
#define vii vector<int>
#define vpii vector<pii>
#define vpll vector<pll>
#define cnt(a)__builtin_popcount(a)
template<class T> bool umin(T& a, const T& b) {return a > b? a = b, true:false;}
template<class T> bool umax(T& a, const T& b) {return a < b? a = b, true:false;}
 
const int N = 1e5+5;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
ll s, n, m, k, ans, pos[N], e[N], gg[N], tree[4 *N];

ll find(ll xx, int lx, int rx, int x){
	if(lx == rx) return lx;
	int m = (lx + rx)>>1;
	if(tree[x*2+1] >= xx) return find(xx, m+1, rx, x*2+1);
	else return find(xx, lx, m, x*2);
}

void solve(){
	cin>>n;
	s = 1;
	while(s < n) s<<=1;
	memset(tree, -mod, sizeof tree);
	for(int i=1;i<=n;i++){
		cin>>pos[i]>>gg[i]>>e[i];
		umax(ans, gg[i]);
		e[i] += e[i-1];
		gg[i] += gg[i-1];
		tree[i+s-1] = e[i] - pos[i];
	}
	
	for(int i=s-1;i>=1;i--) tree[i] = max(tree[i<<1], tree[(i<<1)+1]);
	
	for(int i=1;i<=n;i++){
		ll cur = e[i-1] - pos[i];
		ll in = find(cur, 1, s, 1);
		//cout<<i<<" "<<in<<endl;
		umax(ans, gg[in] - gg[i-1]);
	}cout<<ans<<"\n";
	return;
}

/*

4
0 5 1
1 7 2
4 4 1
7 15 3

*/

int main(){
	fastios
	int t = 0;
	if(!t) solve();
	else {
		cin>>t;
		while (t--) solve();
	}
	return 0;
}

Subtask #1
17.0 / 17.0

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

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3436 KB Output is correct
2 Correct 2 ms 3436 KB Output is correct
3 Correct 2 ms 3436 KB Output is correct
4 Correct 2 ms 3436 KB Output is correct
5 Correct 2 ms 3436 KB Output is correct
6 Correct 3 ms 3436 KB Output is correct
7 Correct 2 ms 3436 KB Output is correct
8 Correct 2 ms 3436 KB Output is correct
9 Correct 3 ms 3436 KB Output is correct
10 Correct 2 ms 3436 KB Output is correct
11 Correct 2 ms 3436 KB Output is correct
12 Correct 2 ms 3436 KB Output is correct
13 Correct 2 ms 3436 KB Output is correct
14 Correct 2 ms 3436 KB Output is correct
15 Correct 2 ms 3436 KB Output is correct
16 Correct 2 ms 3436 KB Output is correct
17 Correct 3 ms 3564 KB Output is correct
18 Correct 3 ms 3564 KB Output is correct
19 Correct 2 ms 3564 KB Output is correct
20 Correct 2 ms 3564 KB Output is correct
21 Correct 3 ms 3584 KB Output is correct
22 Correct 3 ms 3564 KB Output is correct
23 Correct 5 ms 3564 KB Output is correct
24 Correct 4 ms 3564 KB Output is correct

Subtask #3
52.0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3436 KB Output is correct
2 Correct 2 ms 3436 KB Output is correct
3 Correct 2 ms 3436 KB Output is correct
4 Correct 2 ms 3436 KB Output is correct
5 Correct 2 ms 3436 KB Output is correct
6 Correct 3 ms 3436 KB Output is correct
7 Correct 2 ms 3436 KB Output is correct
8 Correct 2 ms 3436 KB Output is correct
9 Correct 3 ms 3436 KB Output is correct
10 Correct 2 ms 3436 KB Output is correct
11 Correct 2 ms 3436 KB Output is correct
12 Correct 2 ms 3436 KB Output is correct
13 Correct 2 ms 3436 KB Output is correct
14 Correct 2 ms 3436 KB Output is correct
15 Correct 2 ms 3436 KB Output is correct
16 Correct 2 ms 3436 KB Output is correct
17 Correct 3 ms 3564 KB Output is correct
18 Correct 3 ms 3564 KB Output is correct
19 Correct 2 ms 3564 KB Output is correct
20 Correct 2 ms 3564 KB Output is correct
21 Correct 3 ms 3584 KB Output is correct
22 Correct 3 ms 3564 KB Output is correct
23 Correct 5 ms 3564 KB Output is correct
24 Correct 4 ms 3564 KB Output is correct
25 Correct 4 ms 3564 KB Output is correct
26 Correct 5 ms 3692 KB Output is correct
27 Correct 5 ms 3692 KB Output is correct
28 Correct 19 ms 4716 KB Output is correct
29 Correct 20 ms 4716 KB Output is correct
30 Correct 38 ms 5868 KB Output is correct
31 Correct 34 ms 5868 KB Output is correct
32 Correct 34 ms 5868 KB Output is correct
33 Correct 33 ms 5868 KB Output is correct
34 Correct 36 ms 5868 KB Output is correct
35 Correct 38 ms 5868 KB Output is correct
36 Correct 40 ms 5868 KB Output is correct