Submission #1143627

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1143627	2025-02-01 08:19:48	psm9352	Safety (NOI18_safety)	C++20	7 / 100	2095 ms	840 KiB

safety

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <iostream>
#include <vector>
#include <iomanip>
using namespace std;
using ll = long long;
int main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    int n,h;cin >> n >> h;
    int k = 5000; // chnage to maxbound of arr[i]
    vector<int> arr(n+1);for (int i = 1;i<=n;i++){cin >> arr[i];}
    vector<ll> dp(k+1,0);
    for (int i = 0;i<=k;i++){
        dp[i]=abs(arr[1]-i);
    }
    for (int i = 2;i<=n;i++){
        vector<ll> ndp(k+1,1e18);
        for (int p = 0;p<=k;p++){
            for (int j = max(0,p-h);j<=min(k,p+h);j++){
                ndp[p]=min(ndp[p],dp[j]+abs(arr[i]-p));
            }
        }
        dp = ndp;
    }
    ll ans = 1e18;
    for (int i = 0;i<=k;i++){
        ans = min(ans,dp[i]);
    }
    cout << ans << "\n";
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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