Submission #830468

#	Time	Username	Problem	Language	Result	Execution time	Memory
830468		vjudge1	Safety (NOI18_safety)	C++17	0 / 100	38 ms	2568 KiB

safety

#include<bits/stdc++.h>
#define ll long long
#define fi first
#define se second
using namespace std;
const int nmax = 200002;
int S[nmax], dup[nmax];
int main() {
    int N,H;
    cin >> N >> H;
    for(int i=1; i<=N; i++) {
        cin >> S[i];
        dup[i]=S[i];
    }
    int idx=2;
    int sem;
    int cost = 0;
    while(idx<=N) {
        if(abs(dup[idx]-dup[idx-1])>H) {
            sem = abs(dup[idx]-dup[idx-1])-H;
            cost+=sem;
            if(dup[idx] > dup[idx-1]) {
                dup[idx]-=sem;
            }
            if(dup[idx] < dup[idx-1]) {
                dup[idx]+=sem;
            }
        }
        idx++;
    }
    cout << cost << endl;
    return 0;
}

• Subtask 1: 0 / 3
• Subtask 2: 0 / 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