제출 #118084

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
118084		JohnTitor	Foehn Phenomena (JOI17_foehn_phenomena)	C++11	100 / 100	213 ms	13096 KiB

foehn_phenomena

#include <bits/stdc++.h>
using namespace std;
#define FOR(i, j, k) for(int i=(j); i<=(k); i++)
#define FFOR(i, j, k) for(int i=(j); i<(k); i++)
#define DFOR(i, j, k) for(int i=(j); i>=(k); i--)
#define bug(x) cerr<<#x<<" = "<<(x)<<'\n'
#define pb push_back
#define mp make_pair
#define bit(s, i) (((s)>>(i))&1LL)
#define mask(i) ((1LL<<(i)))
#define builtin_popcount __builtin_popcountll
#define __builtin_popcount __builtin_popcountll
using ll=long long; using ld=long double;
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count()); const ld pi=acos(0)*2;
template <typename T> inline void read(T &x){char c; bool nega=0; while((!isdigit(c=getchar()))&&(c!='-')); if(c=='-'){nega=1; c=getchar();} x=c-48; while(isdigit(c=getchar())) x=x*10+c-48; if(nega) x=-x;}
template <typename T> inline void writep(T x){if(x>9) writep(x/10); putchar(x%10+48);}
template <typename T> inline void write(T x){if(x<0){ putchar('-'); x=-x;} writep(x);}
template <typename T> inline void writeln(T x){write(x); putchar('\n');}
#define taskname "Foehn"
int n, q;
ll s, t;
ll a[200001];
ll d[200001];
int main(){
    #ifdef Aria
        if(fopen(taskname".in", "r"))
            freopen(taskname".in", "r", stdin);
    #endif // Aria
    read(n);
    read(q);
    read(s);
    read(t);
    FOR(i, 0, n) read(a[i]);
    FOR(i, 1, n) d[i]=a[i]-a[i-1];
    ll ans=0;
    FOR(i, 1, n) if(d[i]>0) ans-=d[i]*s; else ans-=d[i]*t;
    {
        int l, r;
        ll x;
        FOR(i, 1, q){
            read(l);
            read(r);
            read(x);
            if(d[l]>0) ans+=d[l]*s; else ans+=d[l]*t;
            d[l]+=x;
            if(d[l]>0) ans-=d[l]*s; else ans-=d[l]*t;
            r++;
            if(r<=n){
                if(d[r]>0) ans+=d[r]*s; else ans+=d[r]*t;
                d[r]-=x;
                if(d[r]>0) ans-=d[r]*s; else ans-=d[r]*t;
            }
            writeln(ans);
        }
    }
}

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