# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
771206 | Trisanu_Das | Snowball (JOI21_ho_t2) | C++17 | 0 ms | 0 KiB |
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 N 200005
#define ff first
#define ss second
int x[N], now, rmx, lmx, ans[N];
vector<pair<int, int> > v;
signed main(){
ios::sync_with_stdio(0); cin.tie(0);
int n,q,i,j,w;
cin >> n >> q;
x[0] = INT_MIN, x[n+1] = INT_MAX;
for(i = 1;i <= n + 1; i++){
if(i <= n) cin >> x[i];
v.push_back(x[i] - x[i - 1], i - 1);
}
sort(v.begin(), v.end())
i = 0;
while(q--){
cin >> w;
now += w;
rmx = max(now, rmx), lmx = min(now, lmx);
while(rmx - lmx >= v[i].ff){
if(w > 0) ans[v[i].ss] += v[i].ff + lmx, ans[v[i].ss+1] -= lmx;
else ans[v[i].ss] += rmx, ans[v[i].ss + 1] += v[i].ff - rmx;
i++;
}
}
while(i < v.size()){
ans[v[i].ss] += rmx, ans[v[i].ss + 1] -= lmx;
i++;
}
for(i = 1; i <= n; i++) cout << ans[i] << '\n';
}