This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define ar array
using i64 = long long;
const i64 inf = 1e18;
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n, q; cin >> n >> q;
vector <i64> X(n + 2);
for ( int i = 1; i <= n; i++ ){
cin >> X[i];
}
X[0] = -inf, X[n + 1] = inf;
vector <i64> Q(q);
for ( auto &x: Q ) cin >> x;
vector <ar<i64,2>> f(q);
i64 cnt = 0;
for ( int i = 0; i < q; i++ ){
if ( i > 0 ) f[i] = f[i - 1];
cnt += Q[i];
f[i][0] = min(f[i][0], cnt);
f[i][1] = max(f[i][1], cnt);
}
vector <i64> ans(n + 1);
for ( int i = 1; i <= n; i++ ){
i64 l = X[i], r = X[i];
for ( int j = 0; j < q; j++ ){
l = min(l, max(f[j][0] + X[i], f[j][1] + X[i - 1]));
r = max(r, min(f[j][1] + X[i], f[j][0] + X[i + 1]));
}
ans[i] = r - l;
}
for ( int i = 1; i <= n; i++ ){
cout << ans[i] << endl;
}
cout << '\n';
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |