제출 #1311463

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1311463		samarthkulkarni	Safety (NOI18_safety)	C++20	35 / 100	245 ms	1472 KiB

safety

#include <bits/stdc++.h>
using namespace std;

using ll = long long;
#define vi vector<long long>
#define all(x) x.begin(), x.end()
#define endl "\n"

void solution();
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solution();
    return 0;
}






void solution() {
	ll n, h;
	cin >> n >> h;
	vi a(n);
	for (ll &z : a) cin >> z;

	
	ll mx = *max_element(all(a));
		
	h = min(h, mx);
	vi dp(mx+1);

	for (int i = 0; i < n; i++) {
		vi ndp(mx+1);

		deque<ll> m;

		int p = 0;
		for (int j = 0; j <= mx; j++) {
			while (m.size() > 0 && m.front() < j-h) m.pop_front();

			while (p <= j+h && p <= mx) {
				m.push_back(p);
				p++;
				
				while (m.size() > 0 && dp[m.front()] > dp[m.back()]) m.pop_front();
			}	

			ndp[j] = abs(j-a[i]) + dp[m.front()];
		}

		dp = move(ndp);
	}

	cout << *min_element(all(dp)) << endl;
}

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