oj.uz

Submission #1097690

# Submission time Handle Problem Language Result Execution time Memory
1097690 2024-10-08T02:52:47 Z Alihan_8 Snowball (JOI21_ho_t2) C++17
100 / 100
 306 ms 22372 KB 
#include <bits/stdc++.h>

using namespace std;

#define all(x) x.begin(), x.end()
#define ar array

using i64 = long long;

const i64 inf = 1e18;

signed main(){
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int n, q; cin >> n >> q;
	
	vector <i64> X(n + 2);
	
	for ( int i = 1; i <= n; i++ ){
		cin >> X[i];
	}
	
	X[0] = -inf, X[n + 1] = inf;
	
	vector <i64> Q(q);
	
	for ( auto &x: Q ) cin >> x;
	
	vector <ar<i64,2>> f(q);
	
	i64 cnt = 0;
	
	for ( int i = 0; i < q; i++ ){
		if ( i > 0 ) f[i] = f[i - 1];
		
		cnt += Q[i];
		
		f[i][0] = min(f[i][0], cnt);
		f[i][1] = max(f[i][1], cnt);
	}
	
	sort(all(f), [&](auto &u, auto &v){
		return u[1] - u[0] < v[1] - v[0];
	});
	
	vector <i64> A(n + 1), B(n + 1);
	
	for ( int i = 1; i <= n; i++ ){
		A[i] = X[i] - X[i - 1];
		B[i] = X[i + 1] - X[i];
	}
	
	vector <i64> L(n + 1), R(n + 1);
	
	{ // L
		vector <int> p(n);
		iota(all(p), 1);
		
		sort(all(p), [&](int &u, int &v){
			return A[u] < A[v];
		});
		
		vector <i64> pf(q + 1, inf * 9), sf(q + 2, inf * 9);
		
		for ( int i = 0; i < q; i++ ) pf[i + 1] = min(pf[i], f[i][0]);
		for ( int i = q; i > 0; i-- ) sf[i] = min(sf[i + 1], f[i - 1][1]);
		
		int j = 0;
		
		for ( auto &i: p ){
			
			while ( j < q && f[j][1] <= A[i] + f[j][0] ) j++;
			
			L[i] = min({A[i], pf[j] + A[i], sf[j + 1]});
		}
	}
	{ // R
		vector <int> p(n);
		iota(all(p), 1);
		
		sort(all(p), [&](int &u, int &v){
			return B[u] < B[v];
		});
		
		vector <i64> pf(q + 1, -inf * 9), sf(q + 2, -inf * 9);
		
		for ( int i = 0; i < q; i++ ) pf[i + 1] = max(pf[i], f[i][1]);
		for ( int i = q; i > 0; i-- ) sf[i] = max(sf[i + 1], f[i - 1][0]);
		
		int j = 0;
		
		for ( auto &i: p ){
			while ( j < q && f[j][1] <= B[i] + f[j][0] ) j++;
			
			R[i] = max({R[i], pf[j], sf[j + 1] + B[i]});
		}
	}
	
	for ( int i = 1; i <= n; i++ ){
		cout << R[i] - L[i] + A[i] << endl;
	}
	
	cout << '\n';
}

Subtask #1
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 5 ms 604 KB Output is correct
5 Correct 3 ms 604 KB Output is correct
6 Correct 3 ms 604 KB Output is correct
7 Correct 3 ms 604 KB Output is correct
8 Correct 3 ms 604 KB Output is correct
9 Correct 3 ms 624 KB Output is correct
10 Correct 3 ms 604 KB Output is correct
11 Correct 3 ms 604 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 3 ms 604 KB Output is correct
16 Correct 3 ms 604 KB Output is correct
17 Correct 3 ms 604 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 3 ms 600 KB Output is correct

Subtask #2
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 5 ms 604 KB Output is correct
5 Correct 3 ms 604 KB Output is correct
6 Correct 3 ms 604 KB Output is correct
7 Correct 3 ms 604 KB Output is correct
8 Correct 3 ms 604 KB Output is correct
9 Correct 3 ms 624 KB Output is correct
10 Correct 3 ms 604 KB Output is correct
11 Correct 3 ms 604 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 3 ms 604 KB Output is correct
16 Correct 3 ms 604 KB Output is correct
17 Correct 3 ms 604 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 3 ms 600 KB Output is correct
20 Correct 26 ms 8172 KB Output is correct
21 Correct 26 ms 8272 KB Output is correct
22 Correct 30 ms 8276 KB Output is correct
23 Correct 27 ms 8284 KB Output is correct
24 Correct 47 ms 9124 KB Output is correct
25 Correct 305 ms 16724 KB Output is correct
26 Correct 306 ms 16724 KB Output is correct
27 Correct 277 ms 16788 KB Output is correct
28 Correct 280 ms 16840 KB Output is correct
29 Correct 285 ms 16720 KB Output is correct
30 Correct 269 ms 16872 KB Output is correct
31 Correct 250 ms 16832 KB Output is correct
32 Correct 262 ms 16908 KB Output is correct
33 Correct 27 ms 2140 KB Output is correct
34 Correct 278 ms 16724 KB Output is correct
35 Correct 277 ms 16720 KB Output is correct
36 Correct 306 ms 16724 KB Output is correct
37 Correct 278 ms 16876 KB Output is correct
38 Correct 286 ms 16840 KB Output is correct
39 Correct 262 ms 16840 KB Output is correct
40 Correct 250 ms 16720 KB Output is correct
41 Correct 25 ms 8280 KB Output is correct
42 Correct 267 ms 19964 KB Output is correct
43 Correct 268 ms 22092 KB Output is correct
44 Correct 27 ms 10836 KB Output is correct
45 Correct 276 ms 20564 KB Output is correct
46 Correct 285 ms 22104 KB Output is correct
47 Correct 265 ms 22352 KB Output is correct
48 Correct 269 ms 22372 KB Output is correct