Submission #1268139

#TimeUsernameProblemLanguageResultExecution timeMemory
1268139sohamsen15Safety (NOI18_safety)C++20
0 / 100
9 ms1348 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); ll n, k, ans = 0; cin >> n >> k; vector<ll> a(n + 1); for (ll i = 1; i <= n; i++) cin >> a[i]; for (ll i = 2; i <= n; i++) if (abs(a[i] - a[i - 1]) > k) { if (a[i] > a[i - 1]) ans += a[i] - (a[i - 1] + k), a[i] = a[i - 1] + k; else ans += a[i - 1] - k - a[i], a[i] = a[i - 1] - k; } cout << ans; }
#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...