Submission #1092285

#TimeUsernameProblemLanguageResultExecution timeMemory
1092285PagodePaivaSnowball (JOI21_ho_t2)C++17
33 / 100
522 ms2640 KiB
#include<bits/stdc++.h>
#define int long long

using namespace std;

const int N = 2010;
int r[N],l[N];
int p[N];
int32_t main(){
    int n, q;
    cin >> n;
    cin >> q;
    for(int i = 1;i <= n;i++){
        cin >> p[i];
        l[i] = r[i] = p[i];
    }
    r[0] = -(1LL << 62);
    l[n+1] = (1LL << 62);
    while(q--){
        int x;
        cin >> x;
        for(int i = 1;i <= n;i++){
            p[i] += x;
            if(x > 0) r[i] = max(r[i], min(p[i], l[i+1]));
            else l[i] = min(l[i], max(p[i], r[i-1]));
        }
    }
    for(int i = 1;i <= n;i++) cout << r[i] - l[i] << '\n';
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...