Submission #751106

#TimeUsernameProblemLanguageResultExecution timeMemory
751106vjudge1Foehn Phenomena (JOI17_foehn_phenomena)C++14
30 / 100
1086 ms1848 KiB
#include <bits/stdc++.h> #define ll long long using namespace std; ll n, q, s, t, l, r, x; ll a[200010]; //incer subtask 1 int main(){ cin >> n >> q >> s >> t; for(int i=0; i<=n; i++){ cin >>a[i]; } while(q--){ cin >> l >> r >> x; for(int i=l; i<=r; i++){ a[i]+=x; } // for(int i=0; i<=n; i++) cout << a[i] << " "; cout << endl; ll ans=0; for(int i=1; i<=n; i++){ if(a[i]>a[i-1]) ans-=s*(a[i]-a[i-1]); if(a[i]<a[i-1]) ans+=t*(a[i-1]-a[i]); } cout << ans << endl; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...