oj.uz

Submission #760107

# Submission time Handle Problem Language Result Execution time Memory
760107 2023-06-17T07:51:34 Z Trisanu_Das Safety (NOI18_safety) C++17
0 / 100
 66 ms 5816 KB 
#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';
}

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 308 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 0 ms 308 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 308 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 66 ms 5816 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 308 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 0 ms 308 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 308 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 0 ms 308 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #7
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 308 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 0 ms 308 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #8
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 308 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 0 ms 308 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #9
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 308 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 0 ms 308 KB Output isn't correct
4 Halted 0 ms 0 KB -