oj.uz

답안 #392434

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
392434 2021-04-21T06:49:00 Z bayemirov Snowball (JOI21_ho_t2) C++17
33 / 100
 2500 ms 13788 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 + 5;
int n, q;
ll a[N], d[N], p[N], pref[N], pos2[N], qr[N], pos1[N];
int t[N * 4], shift = 1;
vector<ll> all;

void update(int u, int val) {
	t[u] = min(t[u], val);
	while (u >>= 1) t[u] = min(t[u + u], t[u + u + 1]);
}

int get(int l, int r) {
	int res = 1e9;
	while (l <= r) {
		if (l & 1) res = min(res, t[l++]);
		if (!(r & 1)) res = min(res, t[r--]);
		l >>= 1;
		r >>= 1;
	}	
	return res;
}


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 + shift, N + shift);
	int k = -1;
	need = m - a[pos + 1];
	need = lower_bound(all(all), need) - all.begin();
	k = get(1 + shift, need + shift);
	
	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 + shift, need + shift);
	
	int k = -1;
	need = m - a[pos - 1];
	need = upper_bound(all(all), need) - all.begin() + 1;
	k = get(need + shift, N + shift);
	
	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;
	
	while (shift < N) shift *= 2;
	shift--;
	
	
	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(pref[i] + shift, i);
	// fnd right
	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;
		}
		//cout << "right : " << i << " " << ans << endl;
		pos1[i] = ans;
	}
	//fnd left
	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;
		}
		//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;
}

Subtask #1
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 3532 KB Output is correct
2 Correct 4 ms 3532 KB Output is correct
3 Correct 6 ms 3532 KB Output is correct
4 Correct 25 ms 3600 KB Output is correct
5 Correct 23 ms 3624 KB Output is correct
6 Correct 20 ms 3644 KB Output is correct
7 Correct 18 ms 3608 KB Output is correct
8 Correct 17 ms 3620 KB Output is correct
9 Correct 14 ms 3584 KB Output is correct
10 Correct 7 ms 3564 KB Output is correct
11 Correct 9 ms 3532 KB Output is correct
12 Correct 3 ms 3408 KB Output is correct
13 Correct 3 ms 3404 KB Output is correct
14 Correct 4 ms 3404 KB Output is correct
15 Correct 26 ms 3588 KB Output is correct
16 Correct 24 ms 3604 KB Output is correct
17 Correct 20 ms 3616 KB Output is correct
18 Correct 3 ms 3404 KB Output is correct
19 Correct 10 ms 3532 KB Output is correct

Subtask #2
0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 3532 KB Output is correct
2 Correct 4 ms 3532 KB Output is correct
3 Correct 6 ms 3532 KB Output is correct
4 Correct 25 ms 3600 KB Output is correct
5 Correct 23 ms 3624 KB Output is correct
6 Correct 20 ms 3644 KB Output is correct
7 Correct 18 ms 3608 KB Output is correct
8 Correct 17 ms 3620 KB Output is correct
9 Correct 14 ms 3584 KB Output is correct
10 Correct 7 ms 3564 KB Output is correct
11 Correct 9 ms 3532 KB Output is correct
12 Correct 3 ms 3408 KB Output is correct
13 Correct 3 ms 3404 KB Output is correct
14 Correct 4 ms 3404 KB Output is correct
15 Correct 26 ms 3588 KB Output is correct
16 Correct 24 ms 3604 KB Output is correct
17 Correct 20 ms 3616 KB Output is correct
18 Correct 3 ms 3404 KB Output is correct
19 Correct 10 ms 3532 KB Output is correct
20 Correct 87 ms 9824 KB Output is correct
21 Correct 74 ms 9872 KB Output is correct
22 Correct 75 ms 9780 KB Output is correct
23 Correct 110 ms 9912 KB Output is correct
24 Correct 437 ms 10628 KB Output is correct
25 Execution timed out 2553 ms 13788 KB Time limit exceeded
26 Halted 0 ms 0 KB -