Submission #751107

#TimeUsernameProblemLanguageResultExecution timeMemory
751107vjudge1Foehn Phenomena (JOI17_foehn_phenomena)C++17
0 / 100
16 ms340 KiB
#include <bits/stdc++.h>
using namespace std;
#define ll long long int;
//////
int n, q, s, t, a[2000], suhu[2000];

void update(int l , int r, int z) {
    for (int i = l; i <= r; i++) {
        a[i] += z;
    }
}

int main () {
    cin >> n >> q >> s >> t;
    for (int i = 0; i < n+1; i++) {
        cin >> a[i];
    }
    for (int i = 0; i < q; i++) {
        int x, y, z;
        cin >> x >> y >> z;
        update(x, y, z);
        for (int i = 0; i < n+1; i++) {
            if (a[i] > a[i + 1]) {
                suhu[i] -= a[i] - a[i-1] * s;
            } else if (a[i] < a[i + 1]) {
                suhu[i] += a[i-1] - a[i] * t;
            }
        }
        cout << suhu[n];
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...