Submission #751111

#TimeUsernameProblemLanguageResultExecution timeMemory
751111vjudge1Foehn Phenomena (JOI17_foehn_phenomena)C++17
0 / 100
1084 ms1100 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
    int N, Q, S, T; cin >> N >> Q >> S >> T;
    int A[N+1];
    for (int i = 0; i <= N; i++) {
        cin >> A[i];
    }
    for (int j = 0; j < Q; j++) {
        int L, R, X; cin >> L >> R >> X;
        for (int i = L; i <= R; i++) {
            A[i] += X;
        }
        int suhu = 0;
        for (int i = 1; i <= N; i++) {
            if (A[i] > A[i-1]) {
                suhu -= S * (A[i] - A[i-1]);
            } else {
                suhu += T * (A[i-1] - A[i]);
            }
        }
        cout << suhu << endl;
    }

    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...