제출 #200782

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
200782		balbit	Foehn Phenomena (JOI17_foehn_phenomena)	C++11	100 / 100	157 ms	11128 KiB

foehn_phenomena

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define ull unsigned ll
#define f first
#define s second
#define FOR(i,a,b) for (int i=(a); i<(b); ++i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for (int i=(n-1); i>=0; --i)
#define REP1(i,n) FOR(i,1,n+1)
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
#define SQ(x) (x)*(x)
#define MN(a,b) a = min(a,(__typeof__(a))(b))
#define MX(a,b) a = max(a,(__typeof__(a))(b))
#define pb push_back
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#ifdef BALBIT
#define IOS()
#define bug(...) fprintf(stderr,"#%d (%s) = ",__LINE__,#__VA_ARGS__),_do(__VA_ARGS__);
template<typename T> void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T &&x, S &&...y){cerr<<x<<", ";_do(y...);}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define bug(...)
#endif

const int iinf = 1<<29;
const ll inf = 1ll<<60;
const ll mod = 1e9+7;


void GG(){cout<<"-1\n"; exit(0);}

ll mpow(ll a, ll n, ll mo = mod){ // a^n % mod
    ll re=1;
    while (n>0){
        if (n&1) re = re*a %mo;
        a = a*a %mo;
        n>>=1;
    }
    return re;
}

ll inv (ll b){
    return b==1?1:(mod-mod/b) * inv(mod%b) % mod;
}

const int maxn = 2e5+5;

ll re = 0;
ll df[maxn];
ll n, q, s, t;
inline ll val(ll x){
    if (x>0)return -s*x;
    else return -t*x;
}

signed main(){
    IOS();
    cin>>n>>q>>s>>t;
    vector<int> a(n+1);
    REP(i,n+1){
        cin>>a[i];
        if (i) df[i-1] = a[i]-a[i-1], re += val(df[i-1]);
    }
    REP(i,q){
        int l, r; cin>>l>>r;
        ll k; cin>>k;
        --l;
        re -= val(df[l]);
        df[l]+=k;
        re += val(df[l]);
        if (r<n){
            re -= val(df[r]);
            df[r]-=k;
            re += val(df[r]);
        }

        cout<<re<<endl;
    }

    // Check your array bounds!
    // Think about corner cases (smallest or biggest?)
}

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