제출 #160302

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
160302		12tqian	Foehn Phenomena (JOI17_foehn_phenomena)	C++14	30 / 100	1065 ms	11268 KiB

foehn_phenomena

#pragma GCC optimize ("O3")
#pragma GCC optimize ("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

const double PI = 4 * atan(1);

#define sz(x) (int)(x).size()
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pii pair <int, int>
#define vi vector<int>
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define vpi vector<pair<int, int>>
#define vpd vector<pair<double, double>>
#define pd pair<double, double>

#define f0r(i,a) for(int i=0;i<a;i++)
#define f1r(i,a,b) for(int i=a;i<b;i++)
#define trav(a, x) for (auto& a : x)

template<typename A, typename B> ostream& operator<<(ostream &cout, pair<A, B> const &p) { return cout << "(" << p.f << ", " << p.s << ")"; }
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v) {
  cout << "["; for(int i = 0; i < v.size(); i++) {if (i) cout << ", "; cout << v[i];} return cout << "]";
}

void fast_io(){
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
}
void io(string taskname){
    string fin = taskname + ".in";
    string fout = taskname + ".out";
    const char* FIN = fin.c_str();
    const char* FOUT = fout.c_str();
    freopen(FIN, "r", stdin);
    freopen(FOUT, "w", stdout);
    fast_io();
}
const int MAX = 2e5 + 5;
ll a[MAX];
template<class T, int SZ> struct LazySeg { // set SZ to a power of 2
	T sum[2*SZ], lazy[2*SZ];
	LazySeg() {
		memset(sum,0,sizeof sum);
		memset(lazy,0,sizeof lazy);
	}

	void push(int ind, int L, int R) { // modify values for current node
		sum[ind] += (R-L+1)*lazy[ind];
		if (L != R) lazy[2*ind] += lazy[ind], lazy[2*ind+1] += lazy[ind]; // push lazy to children
		lazy[ind] = 0;
	}
	void pull(int ind) { // recalc values for current node
		sum[ind] = sum[2*ind]+sum[2*ind+1];
	}

	void upd(int lo, int hi, ll inc, int ind = 1, int L = 0, int R = SZ-1) {
		push(ind,L,R);
		if (hi < L || R < lo) return;
		if (lo <= L && R <= hi) {
			lazy[ind] = inc;
			push(ind,L,R); return;
		}
		int M = (L+R)/2;
		upd(lo,hi,inc,2*ind,L,M); upd(lo,hi,inc,2*ind+1,M+1,R);
		pull(ind);
	}

	T qsum(int lo, int hi, int ind = 1, int L = 0, int R = SZ-1) {
		push(ind,L,R);
		if (lo > R || L > hi) return 0;
		if (lo <= L && R <= hi) return sum[ind];
		int M = (L+R)/2;
		return qsum(lo,hi,2*ind,L,M)+qsum(lo,hi,2*ind+1,M+1,R);
	}
};
const int MAXSEG = (1<<19);
ll st[MAXSEG];
ll lazy[MAXSEG];
int N;
void push(int lo, int hi, int node) {
	if (lazy[node] == 0) return;
	st[node] += (hi - lo + 1) * lazy[node];
	if (lo != hi) {
		lazy[2 * node + 1] += lazy[node];
		lazy[2 * node + 2] += lazy[node];
	}
	lazy[node] = 0;
}

void update_range(int s, int e, ll x, int lo=0, int hi=-1, int node=0) {
	if (hi == -1) hi = N - 1;
	push(lo, hi, node);
	if (hi < s || lo > e) return;
	if (lo >= s && hi <= e) {
		lazy[node] = x;
		push(lo, hi, node);
		return;
	}
	int mid = (lo + hi) / 2;
	update_range(s, e, x, lo, mid, 2 * node + 1);
	update_range(s, e, x, mid + 1, hi, 2 * node + 2);
	st[node] = st[2 * node + 1] + st[2 * node + 2];
}

ll query(int s, int e, int lo=0, int hi=-1, int node=0) {
	if (hi == -1) hi = N - 1;
	push(lo, hi, node);
	if (hi < s || lo > e) return 0;
	if (lo >= s && hi <= e) return st[node];
	int mid = (lo + hi) / 2;
	return query(s, e, lo, mid, 2 * node + 1) +
			query(s, e, mid + 1, hi, 2 * node + 2);
}

int main(){
    fast_io();
    ll n, q, s, t;
    cin >> n >> q >> s >> t;
    N = n+1;
    f0r(i, n+1){
        cin >> a[i];
        update_range(i, i, a[i]);
    }
    ll ans = 0;
    f0r(i, n){
        if(a[i] < a[i+1]){
            ans -= s*(a[i+1] - a[i]);
        }
        else{
            ans += t*(a[i] - a[i+1]);
        }
    }
    while(q--){
        int l, r, x;
        cin >> l >> r >> x;
        ll d1 = query(l, l) - query(l-1, l-1);
        ll d2 = query(r+1, r+1) - query(r, r);

        update_range(l, r, x);
        if(l != 0){
            if(d1>0){
                ans += s*(d1);
            }
            else{
                ans += t*(d1);
            }
            if(d1+x>0){
                ans -= s*(d1+x);
            }
            else{
                ans -= t*(d1+x);
            }
        }
        if(r != n){
            if(d2>0){
                ans += s*(d2);
            }
            else{
                ans += t*(d2);
            }
            if(d2-x>0){
                ans -= s*(d2-x);
            }
            else{
                ans -= t*(d2-x);
            }
        }
        cout << ans << endl;

    }
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

foehn_phenomena.cpp: In function 'void io(std::__cxx11::string)':
foehn_phenomena.cpp:49:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     freopen(FIN, "r", stdin);
     ~~~~~~~^~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:50:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     freopen(FOUT, "w", stdout);
     ~~~~~~~^~~~~~~~~~~~~~~~~~~

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