oj.uz

Submission #392494

# Submission time Handle Problem Language Result Execution time Memory
392494 2021-04-21T08:53:27 Z bayemirov Snowball (JOI21_ho_t2) C++17
100 / 100
 2273 ms 25020 KB 
#include <bits/stdc++.h>
#define ll long long
#define all(x) x.begin(), x.end()
#define pb push_back
#define pii pair<int, int> 
#define fr first
#define sc second
using namespace std;
const int N = 2e5 + 1;
int n, q;
ll a[N], d[N], p[N], pref[N], pos2[N], qr[N], pos1[N];
int t[N * 4], shift = 1, lg[2 * N], prmn[N + 500], sufmn[N + 500];
vector<ll> all;
 
int get(ll l, ll r) {
	if (l == 1) return prmn[r];
	else return sufmn[l];
}
 
 
bool check(int pos, ll m) {
	int j = -1;
	ll need = m - a[pos];
	need = lower_bound(all(all), need) - all.begin() + 1;
	j = get(need, N);
	int k = -1;
	need = m - a[pos + 1];
	need = lower_bound(all(all), need) - all.begin();
	k = get(1, need);
	if (j == 1e9) return false;
	if (j > k) return false;
	return true; 
}
 
bool check2(int pos, ll m) {
	int j = - 1;
	ll need = m - a[pos];
	need = upper_bound(all(all), need) - all.begin();
	j = get(1, need);
	
	int k = -1;
	need = m - a[pos - 1];
	need = upper_bound(all(all), need) - all.begin() + 1;
	k = get(need, N);
	
	if (j == 1e9) return false;
	if (j > k) return false;
	return true; 
}
 
 
int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	cin >> n >> q;
	
	for (int i = 0; i < 4 * N; i++) t[i] = 1e9;
	for (int i = 1; i <= n; i++) cin >> a[i];
	
	ll x = *min_element(a + 1, a + 1 + n);
	ll mn2 = 1e18;
	
	for (int i = 1; i <= q; i++) cin >> d[i];
	for (int i = 1; i <= q; i++) p[i] = p[i - 1] + d[i], all.pb(p[i]);
	for (int i = 1; i <= q; i++) mn2 = min(mn2, x + p[i]);
	for (int i = 1; i <= n; i++) a[i] += abs(mn2) + 1;
	
	sort(all(all));
	all.resize(unique(all(all)) - all.begin());
	
	for (int i = 1; i <= q; i++) pref[i] = lower_bound(all(all), p[i]) - all.begin() + 1;
	for (int i = 1; i <= q; i++) t[pref[i]] = min(t[pref[i]], i);
	fill(prmn, prmn + N + 500, 1e9);
	fill(sufmn, sufmn + N + 500, 1e9); 
	for (int i = 1; i <= N; i++) {
		prmn[i] = min(prmn[i - 1], t[i]);
	}
	for (int i = N; i >= 1; i--) {
		sufmn[i] = min(sufmn[i + 1], t[i]);
	} 
	for (int i = 1; i < n; i++) {
		ll l = a[i] + 1;
		ll r = a[i + 1];
		ll ans = -1;
		while (l <= r) {
			ll m = (l + r) / 2;
			if (check(i, m)) l = m + 1, ans = m;
			else r = m - 1;
		}
		pos1[i] = ans;
	}
	for (int i = 2; i <= n; i++) {
		ll l = a[i - 1];
		ll r = a[i] - 1;
		ll ans = -1;
		while (l <= r) {
			ll m = (l + r) / 2;
			if (check2(i, m)) r = m - 1, ans = m;
			else l = m + 1;
		}
		pos2[i] = ans;
	}
	
	for (int i = 1; i < n; i++) if (pos1[i] != -1) qr[i] += pos1[i] - a[i];
	for (int i = 2; i <= n; i++) if (pos2[i] != -1) qr[i] += a[i] - pos2[i];
	
	qr[1] += abs(min(0ll, *min_element(p + 1, p + 1 + q)));
	qr[n] += max(0ll, *max_element(p + 1, p + 1 + q));
	for (int i = 1; i <= n; i++) cout << qr[i] << endl; 	
	return 0;
}

Subtask #1
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5072 KB Output is correct
2 Correct 6 ms 5072 KB Output is correct
3 Correct 8 ms 5068 KB Output is correct
4 Correct 19 ms 5184 KB Output is correct
5 Correct 17 ms 5168 KB Output is correct
6 Correct 16 ms 5160 KB Output is correct
7 Correct 17 ms 5196 KB Output is correct
8 Correct 14 ms 5292 KB Output is correct
9 Correct 13 ms 5196 KB Output is correct
10 Correct 9 ms 5196 KB Output is correct
11 Correct 8 ms 5200 KB Output is correct
12 Correct 5 ms 5068 KB Output is correct
13 Correct 5 ms 5068 KB Output is correct
14 Correct 6 ms 5068 KB Output is correct
15 Correct 19 ms 5196 KB Output is correct
16 Correct 18 ms 5180 KB Output is correct
17 Correct 14 ms 5196 KB Output is correct
18 Correct 5 ms 4940 KB Output is correct
19 Correct 9 ms 5196 KB Output is correct

Subtask #2
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5072 KB Output is correct
2 Correct 6 ms 5072 KB Output is correct
3 Correct 8 ms 5068 KB Output is correct
4 Correct 19 ms 5184 KB Output is correct
5 Correct 17 ms 5168 KB Output is correct
6 Correct 16 ms 5160 KB Output is correct
7 Correct 17 ms 5196 KB Output is correct
8 Correct 14 ms 5292 KB Output is correct
9 Correct 13 ms 5196 KB Output is correct
10 Correct 9 ms 5196 KB Output is correct
11 Correct 8 ms 5200 KB Output is correct
12 Correct 5 ms 5068 KB Output is correct
13 Correct 5 ms 5068 KB Output is correct
14 Correct 6 ms 5068 KB Output is correct
15 Correct 19 ms 5196 KB Output is correct
16 Correct 18 ms 5180 KB Output is correct
17 Correct 14 ms 5196 KB Output is correct
18 Correct 5 ms 4940 KB Output is correct
19 Correct 9 ms 5196 KB Output is correct
20 Correct 65 ms 12064 KB Output is correct
21 Correct 65 ms 12164 KB Output is correct
22 Correct 75 ms 12068 KB Output is correct
23 Correct 83 ms 12188 KB Output is correct
24 Correct 282 ms 12892 KB Output is correct
25 Correct 2273 ms 20128 KB Output is correct
26 Correct 2212 ms 23000 KB Output is correct
27 Correct 2119 ms 22668 KB Output is correct
28 Correct 2033 ms 22728 KB Output is correct
29 Correct 1766 ms 22244 KB Output is correct
30 Correct 810 ms 21552 KB Output is correct
31 Correct 388 ms 21060 KB Output is correct
32 Correct 389 ms 21324 KB Output is correct
33 Correct 180 ms 6992 KB Output is correct
34 Correct 2261 ms 23464 KB Output is correct
35 Correct 2095 ms 22848 KB Output is correct
36 Correct 2245 ms 23116 KB Output is correct
37 Correct 2082 ms 22808 KB Output is correct
38 Correct 2078 ms 22572 KB Output is correct
39 Correct 2076 ms 22740 KB Output is correct
40 Correct 1123 ms 22656 KB Output is correct
41 Correct 55 ms 14132 KB Output is correct
42 Correct 414 ms 19640 KB Output is correct
43 Correct 810 ms 24784 KB Output is correct
44 Correct 61 ms 14012 KB Output is correct
45 Correct 1131 ms 22796 KB Output is correct
46 Correct 954 ms 24636 KB Output is correct
47 Correct 796 ms 24936 KB Output is correct
48 Correct 838 ms 25020 KB Output is correct