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;
typedef long long ll;
#define int ll
#define starburst ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define pii pair<int,int>
#define pb push_back
#define ff first
#define ss second
void solve(){
int N, Q; cin >> N >> Q;
vector<int> v(N), ans(N, 0);
vector<pii> snow(N + 1);
for(auto &x:v) cin >> x;
for(int i = 0; i <= N; ++i){
int l = (i == 0 ? -2e17 : v[i - 1]), r = (i == N ? 2e17 : v[i]);
snow[i] = pii(l, r);
}
while(Q--){
int w; cin >> w;
if(w > 0){
for(int i = 0; i < N; ++i){
v[i] += w;
if(snow[i + 1].ff < v[i] && snow[i + 1].ss - snow[i + 1].ff > 0){
ans[i] += min(snow[i + 1].ss - snow[i + 1].ff, v[i] - snow[i + 1].ff);
snow[i + 1].ff = v[i];
}
}
}else{
for(int i = 0; i < N; ++i){
v[i] += w;
if(snow[i].ss > v[i] && snow[i].ss - snow[i].ff > 0){
ans[i] += min(snow[i].ss - snow[i].ff ,snow[i].ss - v[i]);
snow[i].ss = v[i];
}
}
}
}
for(int x:ans) cout << x << '\n';
}
signed main(){
starburst
int t = 1; //cin >> t;
while(t--) solve();
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |