제출 #1053874

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1053874		ArthuroWich	Foehn Phenomena (JOI17_foehn_phenomena)	C++17	100 / 100	379 ms	30152 KiB

foehn_phenomena

#include <bits/stdc++.h>
using namespace std;
#define int long long int
struct node {
    int s = 0, l = 0, r = 0;
};
int arr[200005], lazy[4*200005], s, t;
node seg[4*200005];
void lazypropagate(int n, int l, int r) {
    if (lazy[n]) {
        seg[n].l += lazy[n];
        seg[n].r += lazy[n];
        if (l != r) {
            lazy[2*n] += lazy[n];
            lazy[2*n+1] += lazy[n];
        }
        lazy[n] = 0;
    }
}
void build(int n, int l, int r) {
    if (l == r) {
        seg[n].l = arr[l];
        seg[n].r = arr[l];
    } else {
        int m = (l+r)/2;
        build(2*n, l, m);
        build(2*n+1, m+1, r);
        seg[n].s = seg[2*n].s + seg[2*n+1].s;
        seg[n].l = seg[2*n].l;
        seg[n].r = seg[2*n+1].r;
        if (seg[2*n].r < seg[2*n+1].l) {
            seg[n].s -= abs(seg[2*n].r-seg[2*n+1].l)*s;
        } else {
            seg[n].s += abs(seg[2*n].r-seg[2*n+1].l)*t;
        }
    }
}
void update(int n, int l, int r, int a, int b, int v) {
    lazypropagate(n, l, r);
    if (b < l || r < a) {
        return;
    } else if (a <= l && r <= b) {
        lazy[n] += v;
        lazypropagate(n, l, r);
    } else {
        int m = (l+r)/2;
        update(2*n, l, m, a, b, v);
        update(2*n+1, m+1, r, a, b, v);
        seg[n].s = seg[2*n].s + seg[2*n+1].s;
        seg[n].l = seg[2*n].l;
        seg[n].r = seg[2*n+1].r;
        if (seg[2*n].r < seg[2*n+1].l) {
            seg[n].s -= abs(seg[2*n].r-seg[2*n+1].l)*s;
        } else {
            seg[n].s += abs(seg[2*n].r-seg[2*n+1].l)*t;
        }
    }
}
void solve() {
    int n, q;
    cin >> n >> q >> s >> t;
    for (int i = 0; i <= n; i++) {
        cin >> arr[i];
    }
    build(1, 0, n);
    while(q--) {
        int l, r, x;
        cin >> l >> r >> x;
        update(1, 0, n, l, r, x);
        cout << seg[1].s << endl;
    }
}
int32_t main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t;
    t = 1;
    while(t--) {
        solve();
    }
}

• Subtask 1: 30 / 30
• Subtask 2: 10 / 10
• Subtask 3: 60 / 60