제출 #1116100

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1116100		staszic_ojuz	Foehn Phenomena (JOI17_foehn_phenomena)	C++17	0 / 100	75 ms	3780 KiB

foehn_phenomena

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main()
{
    cin.tie(0);
    ios_base::sync_with_stdio(0);
    int n, q, s, t;
    cin >> n >> q >> s >> t;
    int pop, ter;
    cin >> pop;
    vector<int> roz;
    for(int i = 0; i < n; ++i)
    {
        cin >> ter;
        roz.push_back(ter - pop);
        pop = ter;
    }
    roz.push_back(0);
    ll odp = 0;
    for(int i = 0; i < n; ++i)
    {
        if(roz[i] > 0)
            odp -= s*roz[i];
        else
            odp -= t*roz[i];
    }
    for(int i = 0; i < q; ++i)
    {
        int l, r, x;
        cin >> l >> r >> x;
        int a = roz[l-1];
        int b = roz[r];
        roz[l-1] += x;
        roz[r] -= x;
        if(a > 0 && roz[l-1] <= 0)
            odp += s*a - t*roz[l-1];
        if(a <= 0 && roz[l-1] > 0)
            odp -= s*roz[l-1] - t*a;
        if(a > 0 && roz[l-1] > 0)
            odp += s*a - s*roz[l-1];
        if(a <= 0 && roz[l-1] <= 0)
            odp += t*a - t*roz[l-1];
        
        if(r >= n)
        {
            cout << odp << "\n";
            continue;
        }
        if(b > 0 && roz[r] <= 0)
            odp += s*b - t*roz[r];
        if(b <= 0 && roz[r] > 0)
            odp -= s*roz[r] - t*b;
        if(b > 0 && roz[r] > 0)
            odp += s*b - s*roz[r];
        if(b <= 0 && roz[r] <= 0)
            odp += t*b - t*roz[r];
        cout << odp << "\n";
    }
}

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