제출 #207790

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
207790		tri	Foehn Phenomena (JOI17_foehn_phenomena)	C++14	0 / 100	798 ms	8684 KiB

foehn_phenomena

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;

#define pb push_back
#define f first
#define s second

const int MAXN = 2e5 + 10;

int d[MAXN];
int N, Q, S, T;

int cost = 0;

void update(int d, int x) {
    if (d > 0) {
        cost -= d * S * x;
    } else {
        cost += abs(d) * T * x;
    }
}

int main() {
    cin >> N >> Q >> S >> T;

    int last = 0;
    cin >> last;
    assert(last == 0);
    for (int i = 0; i < N; i++) {
        int c;
        cin >> c;
        d[i] = c - last;
        last = c;
    }

    for (int i = 0; i < N; i++) {
        update(d[i], 1);
    }
//    cout << cost << endl;

    for (int i = 0; i < Q; i++) {
        int l, r, x;
        cin >> l >> r >> x;

        l--;
        update(d[l], -1);
        d[l] += x;
        update(d[l], 1);

        if (r < N) {
            update(d[r], -1);
            d[r] -= x;
            update(d[r], 1);
        }

//        for (int i = 0; i < N; i++) {
//            cout << d[i] << " ";
//        }
//        cout << endl;

        cout << cost << endl;
    }
}

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