# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
771208 | Trisanu_Das | Snowball (JOI21_ho_t2) | C++17 | 70 ms | 13920 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 int long long
#define pii pair<int,int>
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
#define pb emplace_back
#define N 200010
int x[N],now,rmx,lmx,ans[N];
vector<pii> v;
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n,q,i,j,w;
cin>>n>>q;
x[0]=-1e18,x[n+1]=1e18;
for(i=1;i<=n+1;i++){
if(i<=n) cin>>x[i];
v.pb(x[i]-x[i-1],i-1);
}
sort(all(v));
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';
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |