Submission #751617

#TimeUsernameProblemLanguageResultExecution timeMemory
751617vjudge1Foehn Phenomena (JOI17_foehn_phenomena)C++17
30 / 100
21 ms468 KiB
#include <bits/stdc++.h> #define ll long long using namespace std; ll N,Q,S,T, A[2001], suhu[2001]; ll L[2001], R[2001], perub[2001]; int main(){ cin >> N >> Q >> S>> T; for (int i=0; i<=N; i++){ cin >> A[i]; } for (int j=1; j<=Q; j++){ cin >> L[j] >> R[j] >> perub[j]; for(int i= L[j]; i<= R[j]; i++){ A[i] += perub[j]; } for (int i=1; i<=N; i++){ if (A[i] > A[i-1]){ suhu[i] = suhu[i-1] - ((A[i] - A[i-1])*S); } else { suhu[i]=suhu[i-1] + ((A[i-1] - A[i])*T); } } cout << suhu[N] << endl; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...