제출 #314155

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
314155		MarcoMeijer	Foehn Phenomena (JOI17_foehn_phenomena)	C++14	100 / 100	408 ms	28024 KiB

foehn_phenomena

#include <bits/stdc++.h>
using namespace std;
 
// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e18
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
#define sz size()
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
 
// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }
 
// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const vector<T>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class T> void OUT(const vector<T>& x) {RE(i,x.size()) OUT(i==0?"":" ",x[i]);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }
 
//===================//
//  Added libraries  //
//===================//
 
//===================//
//end added libraries//
//===================//
 
void program();
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    program();
}
 
 
//===================//
//   begin program   //
//===================//
 
const int N = (1<<20);

ll n, q, s, t;
ll a[N];

struct T {
    ll la, ra, temp;
};
T seg[N*2];
ll laz[N*2];

T comb(T l, T r) {
    T res;
    res.la = l.la;
    res.ra = r.ra;
    res.temp = l.temp + r.temp;
    if(l.ra < r.la) {
        res.temp -= (r.la-l.ra)*s;
    } else {
        res.temp += (l.ra-r.la)*t;
    }
    return res;
}
void buildSeg(int p=1, int l=0, int r=n-1) {
    laz[p] = 0;
    if(l == r) {
        seg[p] = {a[l], a[l], 0};
        return;
    }
    int m=(l+r)/2;
    buildSeg(p*2,l,m);
    buildSeg(p*2+1,m+1,r);
    seg[p] = comb(seg[p*2], seg[p*2+1]);
}
void addSeg(int i, int j, ll v, ll lazy=0, int p=1, int l=0, int r=n-1) {
    seg[p].la += lazy;
    seg[p].ra += lazy;
    laz[p] += lazy;
    if(j < l || i > r) return;
    if(i <= l && j >= r) {
        seg[p].la += v;
        seg[p].ra += v;
        laz[p] += v;
        return;
    }
    int m=(l+r)/2;
    addSeg(i,j,v,laz[p],p*2,l,m);
    addSeg(i,j,v,laz[p],p*2+1,m+1,r);
    seg[p] = comb(seg[p*2], seg[p*2+1]);
    laz[p] = 0;
}

void program() {
    IN(n,q,s,t); n++;
    RE(i,n) IN(a[i]);
    buildSeg();

    RE(i,q) {
        int l, r, x; IN(l,r,x);
        addSeg(l,r,x);
        OUTLS(seg[1].temp);
    }
}

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