| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1288117 | ilovewaguri | Foehn Phenomena (JOI17_foehn_phenomena) | C++20 | 67 ms | 6544 KiB |
#include<bits/stdc++.h>
using namespace std;
#define NAME "TEST"
#define nl '\n'
#define allofa(x,sz) x,x+sz+1
#define allof(x) x.begin(),x.end()
#define mset(x,val) memset(x,val,sizeof(x))
template<class X,class Y> bool minimize(X &a, Y b){if(a>b){a=b;return true;}return false;};
template<class X,class Y> bool maximize(X &a, Y b){if(a<b){a=b;return true;}return false;};
typedef long long ll;
const ll mod = (long long)1e9+7;
const ll LINF = (long long)1e18;
const int INF = (int)1e9;
const int MAXN = (int)2e5+5;
ll diff[MAXN],res;
int a[MAXN];
int n,q,s,t;
void ccps() {
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
if(fopen(NAME".inp","r")) {
freopen(NAME".inp","r",stdin);
freopen(NAME".out","w",stdout);
}
}
void add(int i, int d) {
ll val = diff[i];
if(val>=0) res-=1LL*d*s*val;
else res+=1LL*d*t*(-val);
}
signed main() {
ccps();
cin >> n >> q >> s >> t;
for (int i = 0; i<=n; i++) {
cin >> a[i];
}
diff[0]=a[0];
for (int i = 1; i<=n; i++) {
diff[i]=a[i]-a[i-1];
add(i,1);
}
while(q--) {
int l,r,x; cin >> l >> r >> x;
//delete the contribute
if(r+1<=n) add(r+1,-1);
add(l,-1);
//add the contribute
diff[l]+=x;
diff[r+1]-=x;
add(l,1);
if(r+1<=n) add(r+1,1);
cout << res << nl;
}
}
컴파일 시 표준 에러 (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... | ||||
