# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
398704 | duality | Foehn Phenomena (JOI17_foehn_phenomena) | C++11 | 143 ms | 11456 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#define DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}
// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
public:
template<typename T>
_Debug& operator,(T val) {
cout << val << endl;
return *this;
}
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif
// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back
// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;
// ---------- END OF TEMPLATE ----------
LLI A[200000];
int main() {
int i;
int N,Q,S,T;
int L,R,X;
LLI ans = 0;
scanf("%d %d %d %d",&N,&Q,&S,&T);
for (i = 0; i <= N; i++) scanf("%lld",&A[i]),A[i-1] = A[i]-A[i-1];
for (i = 0; i < N; i++) {
if (A[i] >= 0) ans -= (LLI) S*A[i];
else ans -= (LLI) T*A[i];
}
for (i = 0; i < Q; i++) {
scanf("%d %d %d",&L,&R,&X);
L--,R--;
if (A[L] >= 0) ans += (LLI) S*A[L];
else ans += (LLI) T*A[L];
A[L] += X;
if (A[L] >= 0) ans -= (LLI) S*A[L];
else ans -= (LLI) T*A[L];
if (R+1 < N) {
if (A[R+1] >= 0) ans += (LLI) S*A[R+1];
else ans += (LLI) T*A[R+1];
A[R+1] -= X;
if (A[R+1] >= 0) ans -= (LLI) S*A[R+1];
else ans -= (LLI) T*A[R+1];
}
printf("%lld\n",ans);
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |