Submission #1148469

#	Time	Username	Problem	Language	Result	Execution time	Memory
1148469		monkey133	Foehn Phenomena (JOI17_foehn_phenomena)	C++20	100 / 100	291 ms	7292 KiB

foehn_phenomena

#include <bits/stdc++.h>
//#include "includeall.h"
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define endl '\n'
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define input(x) scanf("%lld", &x);
#define input2(x, y) scanf("%lld%lld", &x, &y);
#define input3(x, y, z) scanf("%lld%lld%lld", &x, &y, &z);
#define input4(x, y, z, a) scanf("%lld%lld%lld%lld", &x, &y, &z, &a);
#define print(x, y) printf("%lld%c", x, y);
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define all(x) x.begin(), x.end()
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define FOR(i, x, n) for (ll i =x; i<=n; ++i) 
#define RFOR(i, x, n) for (ll i =x; i>=n; --i) 
#pragma GCC optimize("O3","unroll-loops")
using namespace std;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
//using namespace __gnu_pbds;
//#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
//#define ordered_multiset tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
typedef long double ld;
typedef pair<ld, ll> pd;
typedef pair<string, ll> psl;
typedef pair<ll, ll> pi;
typedef pair<ll, pi> pii;
typedef pair<pi, pi> piii;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

ll a[200005];
ll dx[200005];
int main()
{
	ll n, q, ss, t;
	cin >> n >> q >> ss >> t;
	for (ll i=0; i<=n; ++i) cin >> a[i];
	ll ans = 0;
	for (ll i=1; i<=n; ++i) {dx[i] = a[i] - a[i-1]; ans += ((dx[i] > 0)?-ss * dx[i]:-t*dx[i]);}
	while (q--)
	{
		ll l, r, x; 
		cin >> l >> r >> x;
		if (l > 0) ans -= ((dx[l] > 0)?-ss:-t)*dx[l];
		if (r + 1 <= n) ans -= ((dx[r + 1] > 0)?-ss:-t)*dx[r + 1];
		dx[l] += x;
		dx[r + 1] -=x;
		if (l > 0) ans += ((dx[l] > 0)?-ss:-t)*dx[l];
		if (r + 1 <= n) ans += ((dx[r + 1] > 0)?-ss:-t)*dx[r + 1];
		cout << ans << endl;   
	}
	
	
	return 0;
}

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