Submission #563937

#	Time	Username	Problem	Language	Result	Execution time	Memory
563937		Bill_00	Safety (NOI18_safety)	C++14	100 / 100	50 ms	7092 KiB

safety

#include <bits/stdc++.h>
#define N 1000005
typedef long long ll;
using namespace std;

ll n, x, val, h[N], ans;
priority_queue<ll> pq1, pq2;
int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);

	cin >> n >> x;
	cin >> h[1];
	pq1.push(h[1]);
	pq2.push(-h[1]);
	for(ll i = 2; i <= n; i++){
		val += x;
		cin >> h[i];
		ll tp1 = pq1.top();
		ll tp2 = -pq2.top();
		if(tp1 - val <= h[i] && h[i] <= tp2 + val){
			pq1.push(h[i] + val);
			pq2.push(-(h[i] - val));
		}
		else{
			if(tp1 - val > h[i]){
				ans += (tp1 - val - h[i]);
				pq1.push(h[i] + val);
				pq1.push(h[i] + val);
				pq2.push(-(tp1 - 2 * val));
				pq1.pop();
			}
			else{
				ans += (h[i] - val - tp2);
				pq2.push(-(h[i] - val));
				pq2.push(-(h[i] - val));
				pq1.push(tp2 + 2 * val);
				pq2.pop();
			}
		}
	}
	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