oj.uz

Submission #474854

# Submission time Handle Problem Language Result Execution time Memory
474854 2021-09-20T06:36:16 Z ismoilov Divide and conquer (IZhO14_divide) C++14
100 / 100
 50 ms 7884 KB 
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);

const int maxx = 1e5+5;

ll x[maxx], g[maxx], d[maxx], pr[maxx], prr[maxx], mn[maxx];

void S()
{
	int n;
	cin >> n;
	for(int i = 0; i < n; i ++){
		cin >> x[i] >> g[i] >> d[i];
		pr[i] = pr[i-1] + g[i];
		prr[i] = prr[i-1] + d[i];
		mn[i] = min(mn[i-1], prr[i-1] - x[i]);
	}
	ll mx = 0;
	for(int i = 0; i < n; i ++){
		int l = 0, r = i, ans = i;
		while(l <= r){
			int m = (l+r) / 2;
			if(mn[m] <= prr[i] - x[i])
				r = m-1, ans = m;
			else
				l = m+1;
		}
		mx = max(mx, pr[i] - pr[ans - 1]);
	}
	cout << mx;
}

int main()
{
	IOS;
	/*int t;
	cin >> t;
	while(t --)*/
		S();
}

Subtask #1
17.0 / 17.0

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

Subtask #2
31.0 / 31.0

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

Subtask #3
52.0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 324 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 2 ms 460 KB Output is correct
23 Correct 2 ms 588 KB Output is correct
24 Correct 3 ms 588 KB Output is correct
25 Correct 2 ms 588 KB Output is correct
26 Correct 4 ms 844 KB Output is correct
27 Correct 5 ms 972 KB Output is correct
28 Correct 20 ms 3660 KB Output is correct
29 Correct 23 ms 3916 KB Output is correct
30 Correct 50 ms 7884 KB Output is correct
31 Correct 39 ms 6712 KB Output is correct
32 Correct 39 ms 6816 KB Output is correct
33 Correct 35 ms 6560 KB Output is correct
34 Correct 35 ms 6632 KB Output is correct
35 Correct 47 ms 7128 KB Output is correct
36 Correct 38 ms 7204 KB Output is correct