제출 #1043037

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1043037		Aldas25	Safety (NOI18_safety)	C++14	100 / 100	56 ms	7168 KiB

safety

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int MAXN = 2e5 + 100;

int n;
ll h;
priority_queue<ll> pqLeft;
priority_queue<ll, vector<ll>, greater<ll>> pqRight;
ll ans = 0;
ll a[MAXN];

int main() {
	cin >> n >> h;

	for (int i = 0; i < n; i++) cin >> a[i];

	pqLeft.push(a[0]); pqRight.push(a[0]);

	for (int i = 1; i < n; i++) {
		ll range = ((ll)i) * h; // mimic shifting left side by -h, and right side by h

		// minimum area in graph is interval [pqLeft.top() - range; pqRight.top() + range]
		ll minFrom = pqLeft.top() - range;
		ll minTo = pqRight.top() + range;

		if (a[i] < minFrom) {
			pqLeft.push(a[i] + range);
			pqLeft.push(a[i] + range);
			ans += minFrom - a[i];
			
			pqRight.push(pqLeft.top() - 2*range);
			pqLeft.pop();
		} else if (a[i] > minTo) {
			pqRight.push(a[i] - range);
			pqRight.push(a[i] - range);
			ans += a[i] - minTo;

			pqLeft.push(pqRight.top() + 2*range);
			pqRight.pop();
		} else {
			pqLeft.push(a[i] + range);
			pqRight.push(a[i] - range);
		}
	}

	cout << ans << "\n";

	return 0;
}

• Subtask 1: 3 / 3
• Subtask 2: 4 / 4
• Subtask 3: 9 / 9
• Subtask 4: 5 / 5
• Subtask 5: 6 / 6
• Subtask 6: 11 / 11
• Subtask 7: 11 / 11
• Subtask 8: 22 / 22
• Subtask 9: 29 / 29