Submission #603167

#TimeUsernameProblemLanguageResultExecution timeMemory
603167ApiramSnowball (JOI21_ho_t2)C++14
33 / 100
2551 ms2380 KiB
#include<bits/stdc++.h> using namespace std; int main(){ ios_base::sync_with_stdio(false); cin.tie(0); int n,m;cin>>n>>m; vector<long long>arr(n); for (int i = 0;i<n;++i){ cin>>arr[i]; } vector<long long>ans(n); long long maxxy = 0,minny = 0; long long sum = 0; for (int i = 0;i<m;++i){ long long x;cin>>x; sum+=x; if (maxxy < sum){ for (int j = 0;j<n;++j){ if (j == n - 1){ ans[j] +=(sum - maxxy); } else{ ans[j]+=max(0LL,min(arr[j] + sum,arr[j + 1] + minny) - (arr[j] + maxxy)); } } maxxy = sum; } else if (minny > sum){ for (int j = 0;j<n;++j){ if (j == 0){ ans[j]+=-(sum - minny); } else{ ans[j]+=max(0LL,(arr[j] + minny) - max((arr[j - 1] + maxxy),arr[j] + sum)); } } minny = sum; } } for (auto x:ans)cout<<x<<'\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...