제출 #760107

#제출 시각아이디문제언어결과실행 시간메모리
760107Trisanu_DasSafety (NOI18_safety)C++17
0 / 100
66 ms5816 KiB
#include <bits/stdc++.h>
#define int long long
using namespace std;
 
int a[200001];
priority_queue<int> L, R;
 
signed main() {
	int n, h, ans = 0;
	cin >> n >> h;
	for(int i = 0; i < n; i++) cin >> a[i];
	L.push(a[0]); R.push(-a[0]);
	for(int i = 0; i < n; i++){
		int X = L.top() - h * i, Y = -R.top() + h * i;
		if (X > a[i]) {
			ans += X - a[i];
			L.push(a[i] + h * i);
			L.push(a[i] + h * i);
			R.push(-X + h * i);
			L.pop();
		} else if (Y < a[i]) {
			ans += a[i] - Y;
			R.push(-a[i] + h * i);
			R.push(-a[i] + h * i);
			L.push(Y + h * i);
			R.pop();
		} else {
			L.push(a[i] + h * i);
			R.push(-a[i] + h * i);
		}
	}
	cout << ans << '\n';
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...