Submission #164938

#	Time	Username	Problem	Language	Result	Execution time	Memory
164938		gs18103	Safety (NOI18_safety)	C++14	100 / 100	84 ms	5188 KiB

safety

#include <bits/stdc++.h>
 
using namespace std;
typedef long long ll;
 
ll s[202020];
priority_queue <ll> L;
priority_queue <ll, vector <ll>, greater <ll> > R;
 
int main() {
	ios::sync_with_stdio(false); cin.tie(0);
 
	int n; ll h;
	cin >> n >> h;
	for(int i = 1; i <= n; i++) {
		cin >> s[i];
	}
 
	ll ans = 0;
	L.push(s[1]), R.push(s[1]);
	for(int i = 2; i <= n; i++) {
		ll l = L.top() - h * (i - 1), r = R.top() + h * (i - 1);
		if(s[i] < l) {
			ans += l - s[i];
			L.push(s[i] + h * (i - 1));
			L.push(s[i] + h * (i - 1));
			R.push(l - h * (i - 1));
			L.pop();
		}
		else if(s[i] > r) {
			ans += s[i] - r;
			R.push(s[i] - h * (i - 1));
			R.push(s[i] - h * (i - 1));
			L.push(r + h * (i - 1));
			R.pop();
		}
		else {
			l = r = s[i];
			L.push(s[i] + h * (i - 1));
			R.push(s[i] - h * (i - 1));
		}
	}
	cout << ans;
}

• 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