제출 #404870

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
404870		SeDunion	Safety (NOI18_safety)	C++17	33 / 100	2092 ms	464 KiB

safety

#include<bits/stdc++.h>
#ifndef LOCAL
#define cerr if(false)cerr
#endif // LOCAL
using namespace std;
using ll = long long;
const int N = 1e6 + 66;

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	int n; ll d;
	cin >> n >> d;
	priority_queue<ll, vector<ll>, greater<ll>>R;
	priority_queue<ll>L;
	ll ans = 0;
	for (int i = 0 ; i < n ; ++ i) {
		ll x;
		cin >> x;
		{
			auto C = L;
			while (C.size()) C.pop();
			while (L.size()) {
				C.push(L.top() - d), L.pop();
			}
			L = C;
		}
		{
			auto C = R;
			while (C.size()) C.pop();
			while (R.size()) {
				C.push(R.top() + d), R.pop();
			}
			R = C;
		}
		if (i == 0) {
			L.push(x);
			R.push(x);
			continue;
		}
		if (L.top() <= x && x <= R.top()) {
			L.push(x);
			R.push(x);
		} else if (L.top() > x) {
			assert(x <= R.top());
			ans += L.top() - x;
			R.push(L.top());
			L.pop();
			L.push(x);
			L.push(x);
		} else { // R.top() < x
			assert(x >= L.top());
			ans += x - R.top();
			L.push(R.top());
			R.pop();
			R.push(x);
			R.push(x);
		}
	}
	cout << ans;
}

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