이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h>
using namespace std;
#define task "Phenomena"
#define lb lower_bound
#define ub upper_bound
#define alll(v) (v).begin(),(v).end()
#define szz(v) (v).size()
#define fi first
#define se second
#define pb push_back
#define FOR(i,a,b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORD(i,b,a) for (int i = (b), _a = (a); i >= _a; --i)
typedef long double ld;
typedef long long ll;
typedef pair<int,int> pii;
template <typename T>
inline void read(T& x)
{
bool Neg = false;
char c;
for (c = getchar(); c < '0' | c > '9'; c = getchar())
if (c == '-') Neg = !Neg;
x = c - '0';
for (c = getchar(); c >= '0' && c <= '9'; c = getchar())
x = x * 10 + c - '0';
if (Neg) x = -x;
}
template <typename T>
inline void write(T x)
{
if (x < 0)
{
putchar('-'); x = -x;
}
T p = 1;
for (T temp = x / 10; temp > 0; temp /= 10) p *= 10;
for (; p > 0; x %= p, p /= 10) putchar(x / p + '0');
}
const int MOD=1000000007; /// 998244353
const int base=311; /// for hash actually
const int N=2e5+5;
ll st[4*N],lazy[4*N],n,q,s,t,a[N];
void down(int i, int l, int r)
{
int t=lazy[i];
st[i<<1]+=t;
st[i<<1|1]+=t;
lazy[i<<1]+=t;
lazy[i<<1|1]+=t;
lazy[i]=0;
}
void upd(int i, int l, int r, int u, int v, int val)
{
if(u>r||v<l) return;
if(u<=l&&r<=v)
{
lazy[i]+=val;
st[i]+=val;
return;
}
down(i,l,r);
int mid=(l+r)>>1;
upd(i<<1,l,mid,u,v,val);
upd(i<<1|1,mid+1,r,u,v,val);
}
int get(int i, int l, int r, int p)
{
if(l==r) return st[i];
down(i,l,r);
int mid=(l+r)>>1;
if(p<=mid) return get(i<<1,l,mid,p);
else return get(i<<1|1,mid+1,r,p);
}
void solved()
{
read(n); read(q); read(s); read(t);
s=-s;
ll ans=0;
++n;
FOR(i,1,n)
{
read(a[i]);
upd(1,1,n,i,i,a[i]);
}
FOR(i,1,n-1)
{
if(a[i]<a[i+1]) ans+=s*(a[i+1]-a[i]);
else ans+=t*(a[i]-a[i+1]);
}
while(q--)
{
int l,r,x;
read(l); read(r); read(x);
++l,++r;
int p1=get(1,1,n,l-1), p2=get(1,1,n,l);
if(l>1)
{
if(p1<p2) ans-=s*(p2-p1);
else ans-=t*(p1-p2);
}
p1=get(1,1,n,r), p2=get(1,1,n,r+1);
if(r<n)
{
if(p1<p2)ans-=s*(p2-p1);
else ans-=t*(p1-p2);
}
upd(1,1,n,l,r,x);
p1=get(1,1,n,l-1), p2=get(1,1,n,l);
if(l>1)
{
if(p1<p2) ans+=s*(p2-p1);
else ans+=t*(p1-p2);
}
p1=get(1,1,n,r), p2=get(1,1,n,r+1);
if(r<n)
{
if(p1<p2)ans+=s*(p2-p1);
else ans+=t*(p1-p2);
}
write(ans); putchar('\n');
}
}
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
if(fopen(task".inp","r"))
{
freopen(task".inp","r",stdin);
freopen(task".out","w",stdout);
}
solved();
}
컴파일 시 표준 에러 (stderr) 메시지
foehn_phenomena.cpp: In instantiation of 'void read(T&) [with T = long long int]':
foehn_phenomena.cpp:79:11: required from here
foehn_phenomena.cpp:22:27: warning: suggest parentheses around comparison in operand of '|' [-Wparentheses]
22 | for (c = getchar(); c < '0' | c > '9'; c = getchar())
| ~~^~~~~
foehn_phenomena.cpp: In instantiation of 'void read(T&) [with T = int]':
foehn_phenomena.cpp:96:15: required from here
foehn_phenomena.cpp:22:27: warning: suggest parentheses around comparison in operand of '|' [-Wparentheses]
foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:131:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
131 | freopen(task".inp","r",stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:132:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
132 | freopen(task".out","w",stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |