Submission #1293753

#	Time	Username	Problem	Language	Result	Execution time	Memory
1293753		m.zeeshanrashid	Foehn Phenomena (JOI17_foehn_phenomena)	C++20	100 / 100	69 ms	7376 KiB

foehn_phenomena

#ifdef __AVX2__
#pragma GCC target "avx2"
#endif
#pragma GCC optimize "O3"
#pragma GCC optimize "unroll-loops"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 
using namespace __gnu_pbds; 
using namespace std;
#define int long long
#define elif else if
#define all(l) begin(l),end(l)
#define rall(l) rbegin(l),rend(l)
#define append push_back
#define print(l) for(auto i:l) cout<<i<<' '; cout<<endl;
#define pprint(a,b) cout<<a<<' '<<b<<endl;
#define inp(l) for(auto &i:l) cin>>i;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define pai make_pair
#define endl "\n"
#define pii pair<int,int>
#define fi first
#define se second
#define vec vector

// const int mod=998244353;
const int mod1=998244353;
const int mod=1e9+7;
const int N=2e5+5;

int iter=1,itera=1;
void solve(){
	int n,q,s,t;
	cin>>n>>q>>s>>t;
	n++;
	int ans=0;
	vec<int>a(n);
	inp(a);
	vec<int>d(n+1,0);
	for(int i=1;i<n;i++){
		d[i]=a[i]-a[i-1];
		if(d[i]>=0) ans-=s*d[i];
		else ans-=t*d[i];
	}
	for(int i=1;i<=q;i++){
		int l,r,x;
		cin>>l>>r>>x;
		// l--;
		// r--;
		if(l!=0){
			if(d[l]>=0) ans+=s*d[l];
			else ans+=t*d[l];
			d[l]+=x;
			if(d[l]>=0) ans-=s*d[l];
			else ans-=t*d[l];
		}
		if(r!=n-1){
			r++;
			if(d[r]>=0) ans+=s*d[r];
			else ans+=t*d[r];
			d[r]-=x;
			if(d[r]>=0) ans-=s*d[r];
			else ans-=t*d[r];
		}
		cout<<ans<<endl;
	}
	// print(d)
}
signed main(){
	// freopen("","r",stdin);
	// freopen("","w",stdout);
	ios_base::sync_with_stdio(false);
	cin.tie(NULL); 
	cout.tie(NULL);
	cout<<fixed<<setprecision(20);
	// cin>>itera;
	for(iter=1;iter<=itera;iter++) solve();
}

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