Submission #392420

#	Time	Username	Problem	Language	Result	Execution time	Memory
392420		bayemirov	Snowball (JOI21_ho_t2)	C++17	0 / 100	3 ms	3532 KiB

Main

#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 + 5;
int n, q;
ll a[N], d[N], p[N], pref[N], pos2[N], qr[N], pos1[N];
int t[N * 4];
vector<ll> all;

void update(int u, int l, int r, int pos, int val) {
	if (l == r) {
		t[u] = min(t[u], val);
		return;
	}
	int m = (l + r) / 2;
	if (pos <= m) update(u + u, l, m, pos, val);
	else update(u + u + 1, m + 1, r, pos, val);
	t[u] = min(t[u + u], t[u + u + 1]);
}

int get(int u, int ul, int ur, int l, int r) {
	if (l > ur || ul > r) return 1e9;
	if (l <= ul && ur <= r) return t[u];
	int um = (ul + ur) / 2;
	return min(get(u + u, ul, um, l, r), get(u + u + 1, um + 1, ur, l, r));
}

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(1, 1, N, need, N);
	int k = -1;
	need = m - a[pos + 1];
	need = lower_bound(all(all), need) - all.begin();
	k = get(1, 1, N, 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, 1, N, 1, need);
	
	int k = -1;
	need = m - a[pos - 1];
	need = upper_bound(all(all), need) - all.begin() + 1;
	k = get(1, 1, N, need, N);
	if (j == 1e9) return false;
	if (j > k) return false;
	return true; 
}


int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	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 mn = 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++) mn = min(mn, x + p[i]);
	for (int i = 1; i <= n; i++) a[i] += abs(mn) + 1;
	sort(all(all));
	all.erase(unique(all(all)), all.end());
	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++) update(1, 1, N, pref[i], i);
	// fnd right
	for (int i = 1; i < n; i++) {
		int l = a[i] + 1;
		int r = a[i + 1];
		int ans = -1;
		while (l <= r) {
			int m = l + r >> 1;
			if (check(i, m)) l = m + 1, ans = m;
			else r = m - 1;
		}
		//cout << "right : " << i << " " << ans << endl;
		pos1[i] = ans;
	}
	//fnd left
	for (int i = 2; i <= n; i++) {
		int l = a[i - 1];
		int r = a[i] - 1;
		int ans = -1;
		while (l <= r) {
			int m = l + r >> 1;
			if (check2(i, m)) r = m - 1, ans = m;
			else l = m + 1;
		}
		//cout << "left : " << i << " " << ans << endl;
		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;
}

Compilation message (stderr)

Main.cpp: In function 'int main()':
Main.cpp:85:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   85 |    int m = l + r >> 1;
      |            ~~^~~
Main.cpp:98:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   98 |    int m = l + r >> 1;
      |            ~~^~~

• Subtask 1: 0 / 33
• Subtask 2: 0 / 67