Submission #547657

#	Time	Username	Problem	Language	Result	Execution time	Memory
547657		tmn2005	Foehn Phenomena (JOI17_foehn_phenomena)	C++17	30 / 100	1084 ms	3636 KiB

foehn_phenomena

#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include<bits/stdc++.h>

using namespace __gnu_pbds;
using namespace std;
typedef long long ll;

#define fr first
#define sc second

#define mk make_pair
#define pb push_back
#define pob pop_back
#define pf push_front
#define pof pop_front

#define int long long
#define pii pair<int,int>
#define piii pair<int,pii>

#define all(s) s.begin(), s.end()
#define allr(s) s.rbegin(), s.rend()

#define NeedForSpeed ios::sync_with_stdio(0), cin.tie(0)
#define ordered_set tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>
const int N = 2e5 + 12;
int n, m, k, a[N], b, c, d, x, y, l, r;

void solve(){
	cin>>n>>m>>x>>y;
	cin>>a[0];for(int i=1; i<=n; i++)cin>>a[i];
	
	while(m--){
		int l, r, z;
		cin>>l>>r>>z;
		for(int i=l; i<=r; i++)a[i] += z;
		
		int ans = 0;
		for(int i=0; i<n; i++){
			if(a[i] < a[i+1]){
				ans -= (x * abs(a[i] - a[i+1]));
			}
			else{
				ans += (y * abs(a[i] - a[i+1]));
			}
		}
		cout<<ans<<"\n";
	}

}
main(){
	NeedForSpeed;
	int T = 1;
//	cin >> T;
	while(T--){
		solve();
	}
	return 0;
}

Compilation message (stderr)

foehn_phenomena.cpp:52:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   52 | main(){
      | ^~~~

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